{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V7WDTFK2KVMAAANLUDTSOYEC6R","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":"98e57a2e4eb3cf3f5d3d9a8a575f336ec604271ef371b1d8cac6c621933d09cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-10T17:54:59Z","title_canon_sha256":"120daa4598643d3b84b74c817a3a35a7aad8227df65f369b0a75cdcd7d5f2250"},"schema_version":"1.0","source":{"id":"1702.03266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03266","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03266v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03266","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"V7WDTFK2KVMA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V7WDTFK2KVMAAANL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V7WDTFK2","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:fb7d248fe53ee9445f00f25a42039a7ad9c10dca2b21c50d08ec8478f1875270","target":"graph","created_at":"2026-05-18T00:50:58Z","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"},"paper":{"abstract_excerpt":"We present an implementation of a recent algorithm to compute shortest-path trees in unit disk graphs in $O(n\\log n)$ worst-case time, where $n$ is the number of disks.\n  In the minimum-separation problem, we are given $n$ unit disks and two points $s$ and $t$, not contained in any of the disks, and we want to compute the minimum number of disks one needs to retain so that any curve connecting $s$ to $t$ intersects some of the retained disks. We present a new algorithm solving this problem in $O(n^2\\log^3 n)$ worst-case time and its implementation.","authors_text":"Lazar Milinkovi\\'c, Sergio Cabello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-10T17:54:59Z","title":"Two Optimization Problems for Unit Disks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03266","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:da9235d8b3053d743f69ce521b0909512fe058c69dc16001ee65f1895689bdb3","target":"record","created_at":"2026-05-18T00:50:58Z","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":"98e57a2e4eb3cf3f5d3d9a8a575f336ec604271ef371b1d8cac6c621933d09cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-10T17:54:59Z","title_canon_sha256":"120daa4598643d3b84b74c817a3a35a7aad8227df65f369b0a75cdcd7d5f2250"},"schema_version":"1.0","source":{"id":"1702.03266","kind":"arxiv","version":1}},"canonical_sha256":"afec39955a55580001aba0e7276082f4453d7828eb2c6b21dd74cf371308abaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afec39955a55580001aba0e7276082f4453d7828eb2c6b21dd74cf371308abaa","first_computed_at":"2026-05-18T00:50:58.328420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:58.328420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0W2TpytD2zg4plzgfadoTaZw5FgyK9RqKz9FYB3gPhgnFXY/mLKrU25j8oo+5r5p4eGrgQW3UXOrCKr8nZ80CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:58.328909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da9235d8b3053d743f69ce521b0909512fe058c69dc16001ee65f1895689bdb3","sha256:fb7d248fe53ee9445f00f25a42039a7ad9c10dca2b21c50d08ec8478f1875270"],"state_sha256":"6826a20265dac537e9c1c96ed9c4bfb170d5b26492a32555112a93eb3881f60c"}