{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P5PWNZAX4BQFQBIK6WVCFGY3HH","short_pith_number":"pith:P5PWNZAX","schema_version":"1.0","canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","source":{"kind":"arxiv","id":"1911.01956","version":1},"attestation_state":"computed","paper":{"title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Clifford Stein, Peilin Zhong","submitted_at":"2019-11-05T17:33:02Z","abstract_excerpt":"We present a $(1+\\varepsilon)$-approximate parallel algorithm for computing shortest paths in undirected graphs, achieving $\\mathrm{poly}(\\log n)$ depth and $m\\mathrm{poly}(\\log n)$ work for $n$-nodes $m$-edges graphs. Although sequential algorithms with (nearly) optimal running time have been known for several decades, near-optimal parallel algorithms have turned out to be a much tougher challenge. For $(1+\\varepsilon)$-approximation, all prior algorithms with $\\mathrm{poly}(\\log n)$ depth perform at least $\\Omega(mn^{c})$ work for some constant $c>0$. Improving this long-standing upper bound"},"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":"1911.01956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T17:33:02Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7c3747a9bdcc9c9db1a863122983bea4640b5fd5a7f2bbb8b04b76b5d8b6bc74","abstract_canon_sha256":"1c135a9ef2d76f36e031d6e382cff83d3b0c972476b2441a55f1eff533acad87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:23.288787Z","signature_b64":"JAURHG+iIfNvtDihD2ZJeTfxpDRJ/rZR1OwsofIesZvUPs7eBiI733FPxjIKUUfz2BaJIxQZbw85EacqHKa7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","last_reissued_at":"2026-07-05T00:17:23.288405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:23.288405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Clifford Stein, Peilin Zhong","submitted_at":"2019-11-05T17:33:02Z","abstract_excerpt":"We present a $(1+\\varepsilon)$-approximate parallel algorithm for computing shortest paths in undirected graphs, achieving $\\mathrm{poly}(\\log n)$ depth and $m\\mathrm{poly}(\\log n)$ work for $n$-nodes $m$-edges graphs. Although sequential algorithms with (nearly) optimal running time have been known for several decades, near-optimal parallel algorithms have turned out to be a much tougher challenge. For $(1+\\varepsilon)$-approximation, all prior algorithms with $\\mathrm{poly}(\\log n)$ depth perform at least $\\Omega(mn^{c})$ work for some constant $c>0$. Improving this long-standing upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01956","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.01956/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.01956","created_at":"2026-07-05T00:17:23.288458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01956v1","created_at":"2026-07-05T00:17:23.288458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01956","created_at":"2026-07-05T00:17:23.288458+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5PWNZAX4BQF","created_at":"2026-07-05T00:17:23.288458+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5PWNZAX4BQFQBIK","created_at":"2026-07-05T00:17:23.288458+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5PWNZAX","created_at":"2026-07-05T00:17:23.288458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19898","citing_title":"Distributed Sparsest Cut via Eigenvalue Estimation","ref_index":335,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH","json":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH.json","graph_json":"https://pith.science/api/pith-number/P5PWNZAX4BQFQBIK6WVCFGY3HH/graph.json","events_json":"https://pith.science/api/pith-number/P5PWNZAX4BQFQBIK6WVCFGY3HH/events.json","paper":"https://pith.science/paper/P5PWNZAX"},"agent_actions":{"view_html":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH","download_json":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH.json","view_paper":"https://pith.science/paper/P5PWNZAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01956&json=true","fetch_graph":"https://pith.science/api/pith-number/P5PWNZAX4BQFQBIK6WVCFGY3HH/graph.json","fetch_events":"https://pith.science/api/pith-number/P5PWNZAX4BQFQBIK6WVCFGY3HH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/action/storage_attestation","attest_author":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/action/author_attestation","sign_citation":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/action/citation_signature","submit_replication":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/action/replication_record"}},"created_at":"2026-07-05T00:17:23.288458+00:00","updated_at":"2026-07-05T00:17:23.288458+00:00"}