{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FYX3CATSGWNAW6SXTGJEB7YIQS","short_pith_number":"pith:FYX3CATS","schema_version":"1.0","canonical_sha256":"2e2fb10272359a0b7a57999240ff08848c1a93f7ac0a312a481bfa5744697342","source":{"kind":"arxiv","id":"1712.09121","version":4},"attestation_state":"computed","paper":{"title":"Improved Distributed Algorithms for Exact Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Jason Li, Mohsen Ghaffari","submitted_at":"2017-12-25T19:57:16Z","abstract_excerpt":"Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et al. [DISC'17] which deterministically computes $(1+o(1))$-approximate shortest paths in $\\tilde O(D+\\sqrt n)$ time, where $D$ is the hop-diameter of the graph. Up to logarithmic factors, this time complexity is optimal, matching the lower bound of Elkin [STOC'04].\n  The question of exact shortest paths however saw no algorithmic progress for dec"},"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":"1712.09121","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-25T19:57:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fa7d79ffea6f63054a84ffe5b25e168743184c2be02dde3acf92c7440997728c","abstract_canon_sha256":"e862ff0bc97cd2f6b837fcf919d0556b96b2ead4875951c218e37073d9c742f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:41.063950Z","signature_b64":"GmlzpiR//X4CPO2uDfQMdJjbmlrkio5/bVqc4D2cA6WRP4u/xYp/VxQpUe9XHxmPGt58tYZALFLfE+s4W9gNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e2fb10272359a0b7a57999240ff08848c1a93f7ac0a312a481bfa5744697342","last_reissued_at":"2026-05-18T00:18:41.063255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:41.063255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Distributed Algorithms for Exact Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Jason Li, Mohsen Ghaffari","submitted_at":"2017-12-25T19:57:16Z","abstract_excerpt":"Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et al. [DISC'17] which deterministically computes $(1+o(1))$-approximate shortest paths in $\\tilde O(D+\\sqrt n)$ time, where $D$ is the hop-diameter of the graph. Up to logarithmic factors, this time complexity is optimal, matching the lower bound of Elkin [STOC'04].\n  The question of exact shortest paths however saw no algorithmic progress for dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09121","kind":"arxiv","version":4},"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":"1712.09121","created_at":"2026-05-18T00:18:41.063358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09121v4","created_at":"2026-05-18T00:18:41.063358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09121","created_at":"2026-05-18T00:18:41.063358+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYX3CATSGWNA","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYX3CATSGWNAW6SX","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYX3CATS","created_at":"2026-05-18T12:31:15.632608+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/FYX3CATSGWNAW6SXTGJEB7YIQS","json":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS.json","graph_json":"https://pith.science/api/pith-number/FYX3CATSGWNAW6SXTGJEB7YIQS/graph.json","events_json":"https://pith.science/api/pith-number/FYX3CATSGWNAW6SXTGJEB7YIQS/events.json","paper":"https://pith.science/paper/FYX3CATS"},"agent_actions":{"view_html":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS","download_json":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS.json","view_paper":"https://pith.science/paper/FYX3CATS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09121&json=true","fetch_graph":"https://pith.science/api/pith-number/FYX3CATSGWNAW6SXTGJEB7YIQS/graph.json","fetch_events":"https://pith.science/api/pith-number/FYX3CATSGWNAW6SXTGJEB7YIQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS/action/storage_attestation","attest_author":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS/action/author_attestation","sign_citation":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS/action/citation_signature","submit_replication":"https://pith.science/pith/FYX3CATSGWNAW6SXTGJEB7YIQS/action/replication_record"}},"created_at":"2026-05-18T00:18:41.063358+00:00","updated_at":"2026-05-18T00:18:41.063358+00:00"}