{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZO4TIMZRAKCAAHSH5XH7TI4CVG","short_pith_number":"pith:ZO4TIMZR","schema_version":"1.0","canonical_sha256":"cbb93433310284001e47edcff9a382a99a2ee7755d773508d922a0c7b9384eeb","source":{"kind":"arxiv","id":"1402.4855","version":2},"attestation_state":"computed","paper":{"title":"Shortest Paths in Intersection Graphs of Unit Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Miha Jej\\v{c}i\\v{c}, Sergio Cabello","submitted_at":"2014-02-20T00:59:45Z","abstract_excerpt":"Let $G$ be a unit disk graph in the plane defined by $n$ disks whose positions are known. For the case when $G$ is unweighted, we give a simple algorithm to compute a shortest path tree from a given source in $O(n\\log n)$ time. For the case when $G$ is weighted, we show that a shortest path tree from a given source can be computed in $O(n^{1+\\varepsilon})$ time, improving the previous best time bound of $O(n^{4/3+\\varepsilon})$."},"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":"1402.4855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-20T00:59:45Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"a59a44b861a0e6e0b359b9a5b2bfa3fd9d82bea0da79be0d572a5ad817b8fe96","abstract_canon_sha256":"8d99d016cbea176b0ef04c2d809b5413faa04bb3f8f615aa77d2c5a8e9552d29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:52.485775Z","signature_b64":"UbllTrWAiIaoujsE0p9XrXKtzf86QObL9B3BfDXjYLxQE+YWI/iDrz8czbj/DY9vfGiq7JwBC8JVhBXf9JUZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbb93433310284001e47edcff9a382a99a2ee7755d773508d922a0c7b9384eeb","last_reissued_at":"2026-05-18T02:34:52.485280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:52.485280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Paths in Intersection Graphs of Unit Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Miha Jej\\v{c}i\\v{c}, Sergio Cabello","submitted_at":"2014-02-20T00:59:45Z","abstract_excerpt":"Let $G$ be a unit disk graph in the plane defined by $n$ disks whose positions are known. For the case when $G$ is unweighted, we give a simple algorithm to compute a shortest path tree from a given source in $O(n\\log n)$ time. For the case when $G$ is weighted, we show that a shortest path tree from a given source can be computed in $O(n^{1+\\varepsilon})$ time, improving the previous best time bound of $O(n^{4/3+\\varepsilon})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4855","kind":"arxiv","version":2},"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":"1402.4855","created_at":"2026-05-18T02:34:52.485367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4855v2","created_at":"2026-05-18T02:34:52.485367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4855","created_at":"2026-05-18T02:34:52.485367+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZO4TIMZRAKCA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZO4TIMZRAKCAAHSH","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZO4TIMZR","created_at":"2026-05-18T12:28:59.999130+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/ZO4TIMZRAKCAAHSH5XH7TI4CVG","json":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG.json","graph_json":"https://pith.science/api/pith-number/ZO4TIMZRAKCAAHSH5XH7TI4CVG/graph.json","events_json":"https://pith.science/api/pith-number/ZO4TIMZRAKCAAHSH5XH7TI4CVG/events.json","paper":"https://pith.science/paper/ZO4TIMZR"},"agent_actions":{"view_html":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG","download_json":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG.json","view_paper":"https://pith.science/paper/ZO4TIMZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4855&json=true","fetch_graph":"https://pith.science/api/pith-number/ZO4TIMZRAKCAAHSH5XH7TI4CVG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZO4TIMZRAKCAAHSH5XH7TI4CVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG/action/storage_attestation","attest_author":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG/action/author_attestation","sign_citation":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG/action/citation_signature","submit_replication":"https://pith.science/pith/ZO4TIMZRAKCAAHSH5XH7TI4CVG/action/replication_record"}},"created_at":"2026-05-18T02:34:52.485367+00:00","updated_at":"2026-05-18T02:34:52.485367+00:00"}