{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V7WDTFK2KVMAAANLUDTSOYEC6R","short_pith_number":"pith:V7WDTFK2","schema_version":"1.0","canonical_sha256":"afec39955a55580001aba0e7276082f4453d7828eb2c6b21dd74cf371308abaa","source":{"kind":"arxiv","id":"1702.03266","version":1},"attestation_state":"computed","paper":{"title":"Two Optimization Problems for Unit Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lazar Milinkovi\\'c, Sergio Cabello","submitted_at":"2017-02-10T17:54:59Z","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."},"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":"1702.03266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-10T17:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"120daa4598643d3b84b74c817a3a35a7aad8227df65f369b0a75cdcd7d5f2250","abstract_canon_sha256":"98e57a2e4eb3cf3f5d3d9a8a575f336ec604271ef371b1d8cac6c621933d09cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:58.328909Z","signature_b64":"0W2TpytD2zg4plzgfadoTaZw5FgyK9RqKz9FYB3gPhgnFXY/mLKrU25j8oo+5r5p4eGrgQW3UXOrCKr8nZ80CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afec39955a55580001aba0e7276082f4453d7828eb2c6b21dd74cf371308abaa","last_reissued_at":"2026-05-18T00:50:58.328420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:58.328420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Optimization Problems for Unit Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lazar Milinkovi\\'c, Sergio Cabello","submitted_at":"2017-02-10T17:54:59Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03266","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":""},"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":"1702.03266","created_at":"2026-05-18T00:50:58.328508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03266v1","created_at":"2026-05-18T00:50:58.328508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03266","created_at":"2026-05-18T00:50:58.328508+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7WDTFK2KVMA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7WDTFK2KVMAAANL","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7WDTFK2","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R","json":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R.json","graph_json":"https://pith.science/api/pith-number/V7WDTFK2KVMAAANLUDTSOYEC6R/graph.json","events_json":"https://pith.science/api/pith-number/V7WDTFK2KVMAAANLUDTSOYEC6R/events.json","paper":"https://pith.science/paper/V7WDTFK2"},"agent_actions":{"view_html":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R","download_json":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R.json","view_paper":"https://pith.science/paper/V7WDTFK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03266&json=true","fetch_graph":"https://pith.science/api/pith-number/V7WDTFK2KVMAAANLUDTSOYEC6R/graph.json","fetch_events":"https://pith.science/api/pith-number/V7WDTFK2KVMAAANLUDTSOYEC6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R/action/storage_attestation","attest_author":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R/action/author_attestation","sign_citation":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R/action/citation_signature","submit_replication":"https://pith.science/pith/V7WDTFK2KVMAAANLUDTSOYEC6R/action/replication_record"}},"created_at":"2026-05-18T00:50:58.328508+00:00","updated_at":"2026-05-18T00:50:58.328508+00:00"}