{"schema_version":"source-reader-v1","record":{"source_id":"erdos-unit-distances-lean","versions":[{"work":{"authors":["plby/Erdos90 project"],"kind":"research_project","publication":"project","publication_note":"Public formal source; execution and statement correspondence are separate checks.","ai_role":"not_reported","ai_note":"No specific AI contribution is attributed by this source record.","artifacts":[{"kind":"formal_code","title":"Unit-distance counterexample in Lean — pinned source","url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","version":"2062b0e6c9770c81e397bfe41148e90b92ca0567","assessment":"not_executed","note":"Exact source inspected; OpenMath has not executed this formal proof project.","sha256":"db155ffc72c15808cd47302f38fe8d77b94b48287fcdf50c5e09fb695201290d"}],"published":{"value":"2026-06-27"}},"id":"erdos-unit-distances:source:lean:v1","source_id":"erdos-unit-distances-lean","title":"Unit-distance counterexample in Lean","owner":"plby/Erdos90 project","url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","subject_scope":"The pinned submission proves a positive exponent gain for arbitrarily large finite Euclidean planar point sets.","revision":"2062b0e6c9770c81e397bfe41148e90b92ca0567","content_sha256":"db155ffc72c15808cd47302f38fe8d77b94b48287fcdf50c5e09fb695201290d","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","attribution":"plby/Erdos90 project","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}],"entries":[{"id":"erdos-unit-distances:entry:lean:v1","source_version_id":"erdos-unit-distances:source:lean:v1","item_id":"lean","url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","wording":"The pinned submission proves a positive exponent gain for arbitrarily large finite Euclidean planar point sets.","wording_kind":"paraphrase","locator":"src/submission/Submission.lean; ChallengeDeps.lean pair-count definition","supersedes":null}],"problems":[{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":2}],"selected_version_id":"erdos-unit-distances:source:lean:v1","available_versions":[{"id":"erdos-unit-distances:source:lean:v2","revision":"2062b0e6c9770c81e397bfe41148e90b92ca0567","observed_on":"2026-10-13","title":"Unit-distance counterexample in Lean","publication":"project","content_sha256":null,"used_in_current_publications":true},{"id":"erdos-unit-distances:source:lean:v1","revision":"2062b0e6c9770c81e397bfe41148e90b92ca0567","observed_on":"2026-10-13","title":"Unit-distance counterexample in Lean","publication":"project","content_sha256":"db155ffc72c15808cd47302f38fe8d77b94b48287fcdf50c5e09fb695201290d","used_in_current_publications":false}],"usages":[{"id":"source-use-dd04a376494240047604","entry_id":"erdos-unit-distances:entry:lean:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":2},"kind":"assessment","title":"Formal exponent-gain endpoint reported complete","claim":{"id":"claim-unit-distances-positive-exponent","version":1,"slug":"unit-distances-positive-exponent","title":"A fixed power gain for infinitely many sizes"},"fragment":"claim-unit-distances-positive-exponent","assessment":{"id":"erdos-unit-distances:report:formal:v1","entry_id":"erdos-unit-distances:entry:lean:v1","state":"resolved","source_label":"Formal exponent-gain endpoint reported complete","scope":"Exact Euclidean norm and unordered counting; external proof execution.","source_date":"2026-06-27","observed_on":"2026-10-13","evidence_url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-9ef1784c457fbdff445a","entry_id":"erdos-unit-distances:entry:lean:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":2},"kind":"formalization","title":"Lean: positive exponent in the Euclidean plane","claim":{"id":"claim-unit-distances-positive-exponent","version":1,"slug":"unit-distances-positive-exponent","title":"A fixed power gain for infinitely many sizes"},"fragment":"claim-unit-distances-positive-exponent","assessment":null,"superseded":false,"formalization":{"title":"Lean: positive exponent in the Euclidean plane","url":"https://github.com/plby/Erdos90/blob/2062b0e6c9770c81e397bfe41148e90b92ca0567/src/submission/Submission.lean","note":"The finite-set definition counts ordered off-diagonal distance-one pairs and divides by two. The endpoint uses EuclideanSpace ℝ (Fin 2), not the product sup norm, and proves arbitrarily large sizes. It does not specify δ = 0.014.","target":{"id":"claim-unit-distances-positive-exponent","version":1},"proof_status":"reported_complete","source_entry_ids":["erdos-unit-distances:entry:lean:v1"],"declaration":"Submission.erdos_unit_distance_conjecture_false","source_commit":"2062b0e6c9770c81e397bfe41148e90b92ca0567","alignment":"staff_linked","checked_on":"2026-10-13"},"update":null},{"id":"source-use-ad697c9d673477a6f77f","entry_id":"erdos-unit-distances:entry:lean:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":2},"kind":"milestone","title":"A pinned Euclidean Lean submission","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e8ebf6200116ca75ab3c","entry_id":"erdos-unit-distances:entry:lean:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":2},"kind":"question","title":"Erdős unit-distance problem","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e09f122db410b7eb223b","entry_id":"erdos-unit-distances:entry:lean:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":2},"kind":"statement","title":"A fixed power gain for infinitely many sizes","claim":{"id":"claim-unit-distances-positive-exponent","version":1,"slug":"unit-distances-positive-exponent","title":"A fixed power gain for infinitely many sizes"},"fragment":"claim-unit-distances-positive-exponent","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[{"id":"erdos-unit-distances:entry:lean:v1","source_version_id":"erdos-unit-distances:source:lean:v1","item_id":"lean","url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","wording":"The pinned submission proves a positive exponent gain for arbitrarily large finite Euclidean planar point sets.","wording_kind":"paraphrase","locator":"src/submission/Submission.lean; ChallengeDeps.lean pair-count definition","supersedes":null}],"linked_sources":[{"work":{"authors":["plby/Erdos90 project"],"kind":"research_project","publication":"project","publication_note":"Public formal source; execution and statement correspondence are separate checks.","ai_role":"not_reported","ai_note":"No specific AI contribution is attributed by this source record.","artifacts":[{"kind":"formal_code","title":"Unit-distance counterexample in Lean — pinned source","url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","version":"2062b0e6c9770c81e397bfe41148e90b92ca0567","assessment":"not_executed","note":"Exact source inspected; OpenMath has not executed this formal proof project.","sha256":"db155ffc72c15808cd47302f38fe8d77b94b48287fcdf50c5e09fb695201290d"}],"published":{"value":"2026-06-27"}},"id":"erdos-unit-distances:source:lean:v1","source_id":"erdos-unit-distances-lean","title":"Unit-distance counterexample in Lean","owner":"plby/Erdos90 project","url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","subject_scope":"The pinned submission proves a positive exponent gain for arbitrarily large finite Euclidean planar point sets.","revision":"2062b0e6c9770c81e397bfe41148e90b92ca0567","content_sha256":"db155ffc72c15808cd47302f38fe8d77b94b48287fcdf50c5e09fb695201290d","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://github.com/plby/Erdos90/tree/2062b0e6c9770c81e397bfe41148e90b92ca0567","attribution":"plby/Erdos90 project","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}]}}