{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LI6MEJWGR4SC73EZLZOR7PSEHE","short_pith_number":"pith:LI6MEJWG","canonical_record":{"source":{"id":"2606.29415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-06-28T14:25:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"11e5860af99d85a5096b858e91f6d779f4f93af11aa0638782ad359e3ff8597a","abstract_canon_sha256":"54e911707d2959279909e2cd92461c5cf103ff7812efd9bb464c54735e1e30ed"},"schema_version":"1.0"},"canonical_sha256":"5a3cc226c68f242fec995e5d1fbe4439035b1ba418a343fad8e8f218208d58af","source":{"kind":"arxiv","id":"2606.29415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29415","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29415v1","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29415","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"LI6MEJWGR4SC","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"pith_short_16","alias_value":"LI6MEJWGR4SC73EZ","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"pith_short_8","alias_value":"LI6MEJWG","created_at":"2026-06-30T01:18:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LI6MEJWGR4SC73EZLZOR7PSEHE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.29415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-06-28T14:25:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"11e5860af99d85a5096b858e91f6d779f4f93af11aa0638782ad359e3ff8597a","abstract_canon_sha256":"54e911707d2959279909e2cd92461c5cf103ff7812efd9bb464c54735e1e30ed"},"schema_version":"1.0"},"canonical_sha256":"5a3cc226c68f242fec995e5d1fbe4439035b1ba418a343fad8e8f218208d58af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:05.343967Z","signature_b64":"5Geuc5mjwYeEg8Q8h2vIL0+erb7PLHEwIuzIRvjjAfOdcKAktvL4ir5BMCf1jRoBke8AGiYP535F7BN0EscTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3cc226c68f242fec995e5d1fbe4439035b1ba418a343fad8e8f218208d58af","last_reissued_at":"2026-06-30T01:18:05.343042Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:05.343042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.29415","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T01:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyvTS2RpHUDcHm5zE4MLUncnwswGkPvYr7+cdZUJdE4AQukoOO74wPQMQ2snOLSHpolXBBAZclxNIwxQRZ2TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:42:54.443035Z"},"content_sha256":"710c4c0e20f43e7169c040ebbae71221d9f83eb7756c8172c30d21671cfd6cf6","schema_version":"1.0","event_id":"sha256:710c4c0e20f43e7169c040ebbae71221d9f83eb7756c8172c30d21671cfd6cf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LI6MEJWGR4SC73EZLZOR7PSEHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic exploration of the unit distance problem in the rational plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Panteleimon Rodis","submitted_at":"2026-06-28T14:25:17Z","abstract_excerpt":"This paper presents reproducible experimental evidence on unit-distance graph density that surpasses recent theoretical lower bounds. Our approach is based on a novel algorithmic exploration of the rational plane for the generation of unit-distance graphs. An efficient algorithm for this utility must perform a local-breadth search on a bounded and finite set of elements and generate a graph that potentially encompasses the general properties of a unit-distance graph, not affected by restrictions on its generation. To this end, we show that our approach accomplishes this purpose by overcoming t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29415","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/2606.29415/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T01:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLOTDPBKUMil3K7HXEOom1rrWcOU2wGJq6mCrsTrbWZavvMK+3YwFAuVyAdn3FcZjLfQfazJbIRzM0EUQcZyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:42:54.443419Z"},"content_sha256":"8a8fe99a268c6820074228a6957682aa8ec61a63ad5099b0dc5a71aeccdfa662","schema_version":"1.0","event_id":"sha256:8a8fe99a268c6820074228a6957682aa8ec61a63ad5099b0dc5a71aeccdfa662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LI6MEJWGR4SC73EZLZOR7PSEHE/bundle.json","state_url":"https://pith.science/pith/LI6MEJWGR4SC73EZLZOR7PSEHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LI6MEJWGR4SC73EZLZOR7PSEHE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T06:42:54Z","links":{"resolver":"https://pith.science/pith/LI6MEJWGR4SC73EZLZOR7PSEHE","bundle":"https://pith.science/pith/LI6MEJWGR4SC73EZLZOR7PSEHE/bundle.json","state":"https://pith.science/pith/LI6MEJWGR4SC73EZLZOR7PSEHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LI6MEJWGR4SC73EZLZOR7PSEHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LI6MEJWGR4SC73EZLZOR7PSEHE","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":"54e911707d2959279909e2cd92461c5cf103ff7812efd9bb464c54735e1e30ed","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-06-28T14:25:17Z","title_canon_sha256":"11e5860af99d85a5096b858e91f6d779f4f93af11aa0638782ad359e3ff8597a"},"schema_version":"1.0","source":{"id":"2606.29415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29415","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29415v1","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29415","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"LI6MEJWGR4SC","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"pith_short_16","alias_value":"LI6MEJWGR4SC73EZ","created_at":"2026-06-30T01:18:05Z"},{"alias_kind":"pith_short_8","alias_value":"LI6MEJWG","created_at":"2026-06-30T01:18:05Z"}],"graph_snapshots":[{"event_id":"sha256:8a8fe99a268c6820074228a6957682aa8ec61a63ad5099b0dc5a71aeccdfa662","target":"graph","created_at":"2026-06-30T01:18:05Z","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/2606.29415/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents reproducible experimental evidence on unit-distance graph density that surpasses recent theoretical lower bounds. Our approach is based on a novel algorithmic exploration of the rational plane for the generation of unit-distance graphs. An efficient algorithm for this utility must perform a local-breadth search on a bounded and finite set of elements and generate a graph that potentially encompasses the general properties of a unit-distance graph, not affected by restrictions on its generation. To this end, we show that our approach accomplishes this purpose by overcoming t","authors_text":"Panteleimon Rodis","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-06-28T14:25:17Z","title":"Algorithmic exploration of the unit distance problem in the rational plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29415","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:710c4c0e20f43e7169c040ebbae71221d9f83eb7756c8172c30d21671cfd6cf6","target":"record","created_at":"2026-06-30T01:18:05Z","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":"54e911707d2959279909e2cd92461c5cf103ff7812efd9bb464c54735e1e30ed","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-06-28T14:25:17Z","title_canon_sha256":"11e5860af99d85a5096b858e91f6d779f4f93af11aa0638782ad359e3ff8597a"},"schema_version":"1.0","source":{"id":"2606.29415","kind":"arxiv","version":1}},"canonical_sha256":"5a3cc226c68f242fec995e5d1fbe4439035b1ba418a343fad8e8f218208d58af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a3cc226c68f242fec995e5d1fbe4439035b1ba418a343fad8e8f218208d58af","first_computed_at":"2026-06-30T01:18:05.343042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:18:05.343042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Geuc5mjwYeEg8Q8h2vIL0+erb7PLHEwIuzIRvjjAfOdcKAktvL4ir5BMCf1jRoBke8AGiYP535F7BN0EscTCA==","signature_status":"signed_v1","signed_at":"2026-06-30T01:18:05.343967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.29415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:710c4c0e20f43e7169c040ebbae71221d9f83eb7756c8172c30d21671cfd6cf6","sha256:8a8fe99a268c6820074228a6957682aa8ec61a63ad5099b0dc5a71aeccdfa662"],"state_sha256":"ec640c715bbd083fe897bc1e78033ed87647b3de157ae624cb76a502800e67c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lw3iSlGK8ryHSyMiti0uw3SwdKLUpim+dDGJMtEFC7aENjYY9N9My44pM6RC8m3u7Qb6IgljMdQCwN18nFJ8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:42:54.445331Z","bundle_sha256":"3fdf90335bcb7b780fe51ca79e26f56aa8507029ac277d4c99b939d20be38897"}}