{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DUUCBD5QOQQISMTLXOYNIRURJW","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":"e44a44ea470e642ae9fd3659fa5cd1c8555fc0c4c9f0ce1cf2cea8726131ec42","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-11-20T12:07:19Z","title_canon_sha256":"c409b2b25ba7bc779688a46faf800f3f82b3e92598fab2446763fd9ea78b6d95"},"schema_version":"1.0","source":{"id":"2411.13248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13248","created_at":"2026-07-05T10:47:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13248v2","created_at":"2026-07-05T10:47:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13248","created_at":"2026-07-05T10:47:33Z"},{"alias_kind":"pith_short_12","alias_value":"DUUCBD5QOQQI","created_at":"2026-07-05T10:47:33Z"},{"alias_kind":"pith_short_16","alias_value":"DUUCBD5QOQQISMTL","created_at":"2026-07-05T10:47:33Z"},{"alias_kind":"pith_short_8","alias_value":"DUUCBD5Q","created_at":"2026-07-05T10:47:33Z"}],"graph_snapshots":[{"event_id":"sha256:3cfdba595feafd8d9f38e8212945b9c76e0f58ec7e3684e3f84bf5abc5d7eace","target":"graph","created_at":"2026-07-05T10:47:33Z","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/2411.13248/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determining the maximal density $m_1(\\mathbb{R}^2)$ of planar sets without unit distances is a fundamental problem in combinatorial geometry. This paper investigates lower bounds for this quantity. We introduce a novel approach to estimating $m_1(\\mathbb{R}^2)$ by reformulating the problem as a Maximal Independent Set (MIS) problem on graphs constructed from flat torus, focusing on periodic sets with respect to two non-collinear vectors. Our experimental results, supported by theoretical justifications of proposed method, demonstrate that for a sufficiently wide range of parameters this approa","authors_text":"Alexander Tolmachev","cross_cats":["cs.LG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-11-20T12:07:19Z","title":"On lower bounds of the density of planar periodic sets without unit distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13248","kind":"arxiv","version":2},"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:09bca1229652fd6ea7864cb3de4699719daefe5fcb4acaa5511b1c91ebea251d","target":"record","created_at":"2026-07-05T10:47:33Z","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":"e44a44ea470e642ae9fd3659fa5cd1c8555fc0c4c9f0ce1cf2cea8726131ec42","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-11-20T12:07:19Z","title_canon_sha256":"c409b2b25ba7bc779688a46faf800f3f82b3e92598fab2446763fd9ea78b6d95"},"schema_version":"1.0","source":{"id":"2411.13248","kind":"arxiv","version":2}},"canonical_sha256":"1d28208fb0742089326bbbb0d446914d9329a7afeb1d517868bd7841b42dc52f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d28208fb0742089326bbbb0d446914d9329a7afeb1d517868bd7841b42dc52f","first_computed_at":"2026-07-05T10:47:33.634907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:33.634907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gvph9Bddm0Gxh5e8BkTJnrmmG69aQdRMKHeNU8mDOmAG3gEp5pOVJMiQHRUHi6OEDCjU+tQLpPazvss7CTUaAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:33.635465Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09bca1229652fd6ea7864cb3de4699719daefe5fcb4acaa5511b1c91ebea251d","sha256:3cfdba595feafd8d9f38e8212945b9c76e0f58ec7e3684e3f84bf5abc5d7eace"],"state_sha256":"03135a193a114d86037558d64504970fe2344805868da6680f617c55cb1ac750"}