{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2FNCYPWKRKSIFN2NU2BP5QK7ST","short_pith_number":"pith:2FNCYPWK","schema_version":"1.0","canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","source":{"kind":"arxiv","id":"1504.07056","version":5},"attestation_state":"computed","paper":{"title":"A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2015-04-27T12:33:50Z","abstract_excerpt":"We present a deterministic $(1+o(1))$-approximation $(n^{1/2+o(1)}+D^{1+o(1)})$-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here $n$ is the number of nodes in the network and $D$ is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized $(1+o(1))$-approximation $\\tilde O(n^{1/2}D^{1/4}+D)$-time algorithm of Nanongkai [STOC 2014] by a factor of as large as $n^{1/8}$, and (ii) the $O(\\epsilon^{-1}\\log \\epsilon^{-1})$-approximat"},"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":"1504.07056","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-27T12:33:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4e426b85fe2bdbc92a437624721947f5dcc4d94a4f9e5f2c131c7d41fedc31dc","abstract_canon_sha256":"fe6b50a9c5c4ebbbc079da4f00d36196e62f52ba9e517d09f2f3e8c6d9260665"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:24.347019Z","signature_b64":"jOCrubXWzUbveGEseCemcm/8dpJv9n2v3digcv80ydOzz+tBHqvwIHAa+i+lJkBl1n+B5d1fKngqZ7vYeUJMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","last_reissued_at":"2026-05-18T00:05:24.346585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:24.346585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2015-04-27T12:33:50Z","abstract_excerpt":"We present a deterministic $(1+o(1))$-approximation $(n^{1/2+o(1)}+D^{1+o(1)})$-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here $n$ is the number of nodes in the network and $D$ is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized $(1+o(1))$-approximation $\\tilde O(n^{1/2}D^{1/4}+D)$-time algorithm of Nanongkai [STOC 2014] by a factor of as large as $n^{1/8}$, and (ii) the $O(\\epsilon^{-1}\\log \\epsilon^{-1})$-approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07056","kind":"arxiv","version":5},"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":"1504.07056","created_at":"2026-05-18T00:05:24.346653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07056v5","created_at":"2026-05-18T00:05:24.346653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07056","created_at":"2026-05-18T00:05:24.346653+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FNCYPWKRKSI","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FNCYPWKRKSIFN2N","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FNCYPWK","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/2FNCYPWKRKSIFN2NU2BP5QK7ST","json":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST.json","graph_json":"https://pith.science/api/pith-number/2FNCYPWKRKSIFN2NU2BP5QK7ST/graph.json","events_json":"https://pith.science/api/pith-number/2FNCYPWKRKSIFN2NU2BP5QK7ST/events.json","paper":"https://pith.science/paper/2FNCYPWK"},"agent_actions":{"view_html":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST","download_json":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST.json","view_paper":"https://pith.science/paper/2FNCYPWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07056&json=true","fetch_graph":"https://pith.science/api/pith-number/2FNCYPWKRKSIFN2NU2BP5QK7ST/graph.json","fetch_events":"https://pith.science/api/pith-number/2FNCYPWKRKSIFN2NU2BP5QK7ST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/action/storage_attestation","attest_author":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/action/author_attestation","sign_citation":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/action/citation_signature","submit_replication":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/action/replication_record"}},"created_at":"2026-05-18T00:05:24.346653+00:00","updated_at":"2026-05-18T00:05:24.346653+00:00"}