{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:42M43O6PSXCH5DSKEBC62MER3T","short_pith_number":"pith:42M43O6P","schema_version":"1.0","canonical_sha256":"e699cdbbcf95c47e8e4a2045ed3091dcc8cff144e8a4ecc3b22be616c79234d4","source":{"kind":"arxiv","id":"2407.05071","version":1},"attestation_state":"computed","paper":{"title":"Clustering in typical unit-distance avoiding sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Alex Cohen, Nitya Mani","submitted_at":"2024-07-06T13:26:29Z","abstract_excerpt":"In the 1960s Moser asked how dense a subset of $\\mathbb{R}^d$ can be if no pairs of points in the subset are exactly distance 1 apart. There has been a long line of work showing upper bounds on this density. One curious feature of dense unit distance avoiding sets is that they appear to be ``clumpy,'' i.e. forbidding unit distances comes hand in hand with having more than the expected number distance $\\approx 2$ pairs.\n  In this work we rigorously establish this phenomenon in $\\mathbb{R}^2$. We show that dense unit distance avoiding sets have over-represented distance $\\approx 2$ pairs, and th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.05071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-07-06T13:26:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c5b1078458a7f8c1824b2dd57fa29c90f8846b6f9e02ef0c5cd1eccfafca8f89","abstract_canon_sha256":"87dc78b31d06ed787dac664e65c01d4599431ba856b09ef7d41cadd51ed5aa1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:07.638000Z","signature_b64":"Sf46Il0H2Iyl6j1HhdsQ6RfUBtw6HMOF610TiDlEiRxKiReWAZ5gcsxZLnjkPvvQPXrQBoc79ydupK+UCbW5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e699cdbbcf95c47e8e4a2045ed3091dcc8cff144e8a4ecc3b22be616c79234d4","last_reissued_at":"2026-07-05T08:41:07.637591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:07.637591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering in typical unit-distance avoiding sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Alex Cohen, Nitya Mani","submitted_at":"2024-07-06T13:26:29Z","abstract_excerpt":"In the 1960s Moser asked how dense a subset of $\\mathbb{R}^d$ can be if no pairs of points in the subset are exactly distance 1 apart. There has been a long line of work showing upper bounds on this density. One curious feature of dense unit distance avoiding sets is that they appear to be ``clumpy,'' i.e. forbidding unit distances comes hand in hand with having more than the expected number distance $\\approx 2$ pairs.\n  In this work we rigorously establish this phenomenon in $\\mathbb{R}^2$. We show that dense unit distance avoiding sets have over-represented distance $\\approx 2$ pairs, and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05071","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.05071/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.05071","created_at":"2026-07-05T08:41:07.637659+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05071v1","created_at":"2026-07-05T08:41:07.637659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05071","created_at":"2026-07-05T08:41:07.637659+00:00"},{"alias_kind":"pith_short_12","alias_value":"42M43O6PSXCH","created_at":"2026-07-05T08:41:07.637659+00:00"},{"alias_kind":"pith_short_16","alias_value":"42M43O6PSXCH5DSK","created_at":"2026-07-05T08:41:07.637659+00:00"},{"alias_kind":"pith_short_8","alias_value":"42M43O6P","created_at":"2026-07-05T08:41:07.637659+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13248","citing_title":"On lower bounds of the density of planar periodic sets without unit distances","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T","json":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T.json","graph_json":"https://pith.science/api/pith-number/42M43O6PSXCH5DSKEBC62MER3T/graph.json","events_json":"https://pith.science/api/pith-number/42M43O6PSXCH5DSKEBC62MER3T/events.json","paper":"https://pith.science/paper/42M43O6P"},"agent_actions":{"view_html":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T","download_json":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T.json","view_paper":"https://pith.science/paper/42M43O6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05071&json=true","fetch_graph":"https://pith.science/api/pith-number/42M43O6PSXCH5DSKEBC62MER3T/graph.json","fetch_events":"https://pith.science/api/pith-number/42M43O6PSXCH5DSKEBC62MER3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T/action/storage_attestation","attest_author":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T/action/author_attestation","sign_citation":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T/action/citation_signature","submit_replication":"https://pith.science/pith/42M43O6PSXCH5DSKEBC62MER3T/action/replication_record"}},"created_at":"2026-07-05T08:41:07.637659+00:00","updated_at":"2026-07-05T08:41:07.637659+00:00"}