{"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 Lean submission","url":"https://github.com/plby/Erdos90/blob/2062b0e6c9770c81e397bfe41148e90b92ca0567/src/submission/Submission.lean","version":"2062b0e6c9770c81e397bfe41148e90b92ca0567","assessment":"not_executed","note":"Exact proof source inspected. This digest identifies this file only, not a project build, theorem correspondence or independent reproduction.","sha256":"51e80f264d618539a8ce31fae79ad95814678d081cc7fc952d74e7904b243ab8"}],"published":{"value":"2026-06-27"}},"id":"erdos-unit-distances:source:lean:v2","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":null,"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:v2","source_version_id":"erdos-unit-distances:source:lean:v2","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":"erdos-unit-distances:entry:lean:v1"}],"problems":[{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6}],"selected_version_id":"erdos-unit-distances:source:lean:v2","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-564fe3e1b88914bf0214","entry_id":"erdos-unit-distances:entry:lean:v2","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"assessment","title":"Formal exponent-gain endpoint reported complete","claim":{"id":"claim-unit-distances-positive-exponent","version":2,"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:v2","entry_id":"erdos-unit-distances:entry:lean:v2","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":"erdos-unit-distances:report:formal:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-2cd46b815605dd2c0622","entry_id":"erdos-unit-distances:entry:lean:v2","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"formalization","title":"Lean: positive exponent in the Euclidean plane","claim":{"id":"claim-unit-distances-positive-exponent","version":2,"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 formal theorem 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":2},"proof_status":"reported_complete","source_entry_ids":["erdos-unit-distances:entry:lean:v2"],"declaration":"Submission.erdos_unit_distance_conjecture_false","source_commit":"2062b0e6c9770c81e397bfe41148e90b92ca0567","alignment":"staff_linked","checked_on":"2026-10-13"},"update":null},{"id":"source-use-a05cd67669a43652746e","entry_id":"erdos-unit-distances:entry:lean:v2","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"milestone","title":"A pinned Euclidean Lean submission","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-3dbac9bd4eca89b154ff","entry_id":"erdos-unit-distances:entry:lean:v2","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"question","title":"Erdős unit-distance problem","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-d2cd0100cb39b94325a0","entry_id":"erdos-unit-distances:entry:lean:v2","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"reading","title":"Inspect the formal statement, assumptions and reported checks.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-eb6af8194a49eb61c859","entry_id":"erdos-unit-distances:entry:lean:v2","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"statement","title":"A fixed power gain for infinitely many sizes","claim":{"id":"claim-unit-distances-positive-exponent","version":2,"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:v2","source_version_id":"erdos-unit-distances:source:lean:v2","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":"erdos-unit-distances:entry:lean:v1"}],"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 Lean submission","url":"https://github.com/plby/Erdos90/blob/2062b0e6c9770c81e397bfe41148e90b92ca0567/src/submission/Submission.lean","version":"2062b0e6c9770c81e397bfe41148e90b92ca0567","assessment":"not_executed","note":"Exact proof source inspected. This digest identifies this file only, not a project build, theorem correspondence or independent reproduction.","sha256":"51e80f264d618539a8ce31fae79ad95814678d081cc7fc952d74e7904b243ab8"}],"published":{"value":"2026-06-27"}},"id":"erdos-unit-distances:source:lean:v2","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":null,"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}]}}