{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:42M43O6PSXCH5DSKEBC62MER3T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"87dc78b31d06ed787dac664e65c01d4599431ba856b09ef7d41cadd51ed5aa1c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-07-06T13:26:29Z","title_canon_sha256":"c5b1078458a7f8c1824b2dd57fa29c90f8846b6f9e02ef0c5cd1eccfafca8f89"},"schema_version":"1.0","source":{"id":"2407.05071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05071","created_at":"2026-07-05T08:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05071v1","created_at":"2026-07-05T08:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05071","created_at":"2026-07-05T08:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"42M43O6PSXCH","created_at":"2026-07-05T08:41:07Z"},{"alias_kind":"pith_short_16","alias_value":"42M43O6PSXCH5DSK","created_at":"2026-07-05T08:41:07Z"},{"alias_kind":"pith_short_8","alias_value":"42M43O6P","created_at":"2026-07-05T08:41:07Z"}],"graph_snapshots":[{"event_id":"sha256:974c237d4389a2c59cceee59449c52800addcb7364557abcd0d7b573b880085e","target":"graph","created_at":"2026-07-05T08:41:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.05071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alex Cohen, Nitya Mani","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-07-06T13:26:29Z","title":"Clustering in typical unit-distance avoiding sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05071","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ece6cdb52ff97bd21cb4df1579841536af7ebdea896cb2975189ee92751d1d74","target":"record","created_at":"2026-07-05T08:41:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"87dc78b31d06ed787dac664e65c01d4599431ba856b09ef7d41cadd51ed5aa1c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-07-06T13:26:29Z","title_canon_sha256":"c5b1078458a7f8c1824b2dd57fa29c90f8846b6f9e02ef0c5cd1eccfafca8f89"},"schema_version":"1.0","source":{"id":"2407.05071","kind":"arxiv","version":1}},"canonical_sha256":"e699cdbbcf95c47e8e4a2045ed3091dcc8cff144e8a4ecc3b22be616c79234d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e699cdbbcf95c47e8e4a2045ed3091dcc8cff144e8a4ecc3b22be616c79234d4","first_computed_at":"2026-07-05T08:41:07.637591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:41:07.637591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sf46Il0H2Iyl6j1HhdsQ6RfUBtw6HMOF610TiDlEiRxKiReWAZ5gcsxZLnjkPvvQPXrQBoc79ydupK+UCbW5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T08:41:07.638000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.05071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ece6cdb52ff97bd21cb4df1579841536af7ebdea896cb2975189ee92751d1d74","sha256:974c237d4389a2c59cceee59449c52800addcb7364557abcd0d7b573b880085e"],"state_sha256":"caa7196b9725e4a95080d06fa49a40ceb0d33a8e00af83b2607b3fc1eaa89356"}