{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2HVXOEO3Q5ZUPTVEF4WMWFLSLG","short_pith_number":"pith:2HVXOEO3","schema_version":"1.0","canonical_sha256":"d1eb7711db877347cea42f2ccb1572598a1414b163743a80af3d0e2d8a6d54e2","source":{"kind":"arxiv","id":"1903.05255","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jie Xue","submitted_at":"2019-03-12T23:11:02Z","abstract_excerpt":"We revisit a classical graph-theoretic problem, the \\textit{single-source shortest-path} (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic) algorithm which solves the problem in $O(n \\log^2 n)$ time using linear space, where $n$ is the number of the vertices of the graph. This significantly improves the previous deterministic algorithm by Cabello and Jej\\v{c}i\\v{c} [CGTA'15] which uses $O(n^{1+\\delta})$ time and $O(n^{1+\\delta})$ space (for any small constant $\\delta>0$) and the previous randomized algorithm by Kaplan et al. [SODA'17] which uses $O(n \\l"},"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":"1903.05255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-12T23:11:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"394c30e7253a3c56facd157c3c326bffc04700dfd11cc11b22a3ba6a6ee3b87a","abstract_canon_sha256":"4176b6427cda6ca3fac20ebb5f65c767ab1478601ab2044148785731de65ad90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.896916Z","signature_b64":"puOgYtLMz22/ab7/jZBPAokXKgrP0OZjizrq+t5Lfc4lbxpwx7Z5WD+7qhUlRT3//vqqMiLLG575i3TT23h9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1eb7711db877347cea42f2ccb1572598a1414b163743a80af3d0e2d8a6d54e2","last_reissued_at":"2026-05-17T23:51:24.896300Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.896300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jie Xue","submitted_at":"2019-03-12T23:11:02Z","abstract_excerpt":"We revisit a classical graph-theoretic problem, the \\textit{single-source shortest-path} (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic) algorithm which solves the problem in $O(n \\log^2 n)$ time using linear space, where $n$ is the number of the vertices of the graph. This significantly improves the previous deterministic algorithm by Cabello and Jej\\v{c}i\\v{c} [CGTA'15] which uses $O(n^{1+\\delta})$ time and $O(n^{1+\\delta})$ space (for any small constant $\\delta>0$) and the previous randomized algorithm by Kaplan et al. [SODA'17] which uses $O(n \\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05255","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":"1903.05255","created_at":"2026-05-17T23:51:24.896396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05255v1","created_at":"2026-05-17T23:51:24.896396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05255","created_at":"2026-05-17T23:51:24.896396+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HVXOEO3Q5ZU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HVXOEO3Q5ZUPTVE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HVXOEO3","created_at":"2026-05-18T12:33:07.085635+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/2HVXOEO3Q5ZUPTVEF4WMWFLSLG","json":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG.json","graph_json":"https://pith.science/api/pith-number/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/graph.json","events_json":"https://pith.science/api/pith-number/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/events.json","paper":"https://pith.science/paper/2HVXOEO3"},"agent_actions":{"view_html":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG","download_json":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG.json","view_paper":"https://pith.science/paper/2HVXOEO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05255&json=true","fetch_graph":"https://pith.science/api/pith-number/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/graph.json","fetch_events":"https://pith.science/api/pith-number/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/action/storage_attestation","attest_author":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/action/author_attestation","sign_citation":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/action/citation_signature","submit_replication":"https://pith.science/pith/2HVXOEO3Q5ZUPTVEF4WMWFLSLG/action/replication_record"}},"created_at":"2026-05-17T23:51:24.896396+00:00","updated_at":"2026-05-17T23:51:24.896396+00:00"}