{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AWJBYZARHJRZOQIC3ETPPTPDT6","short_pith_number":"pith:AWJBYZAR","schema_version":"1.0","canonical_sha256":"05921c64113a63974102d926f7cde39f9b9883a56626351cb27cb19d86969ac9","source":{"kind":"arxiv","id":"1911.01626","version":6},"attestation_state":"computed","paper":{"title":"Faster Parallel Algorithm for Approximate Shortest Path","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jason Li","submitted_at":"2019-11-05T05:28:08Z","abstract_excerpt":"We present the first $m\\,\\text{polylog}(n)$ work, $\\text{polylog}(n)$ time algorithm in the PRAM model that computes $(1+\\epsilon)$-approximate single-source shortest paths on weighted, undirected graphs. This improves upon the breakthrough result of Cohen~[JACM'00] that achieves $O(m^{1+\\epsilon_0})$ work and $\\text{polylog}(n)$ time. While most previous approaches, including Cohen's, leveraged the power of hopsets, our algorithm builds upon the recent developments in \\emph{continuous optimization}, studying the shortest path problem from the lens of the closely-related \\emph{minimum transshi"},"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.01626","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T05:28:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"53f04a57bcd7a4909b9d7f6496fe7662f3cea828b595fcead045cf0145051e0c","abstract_canon_sha256":"e62f949e9a5df14fd20ececf6344b8f0df66823008c99b18852ce0facc2c1d03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:05.295177Z","signature_b64":"9n+wU0qkdS7uxWPkvTWFfu+CT7WqnBdX27Lm8W8lHm3/2EfsKJ+RpcJRf1E9n0ybXxfTvC2/OkDx73DJ82utBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05921c64113a63974102d926f7cde39f9b9883a56626351cb27cb19d86969ac9","last_reissued_at":"2026-07-05T04:28:05.294724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:05.294724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Parallel Algorithm for Approximate Shortest Path","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jason Li","submitted_at":"2019-11-05T05:28:08Z","abstract_excerpt":"We present the first $m\\,\\text{polylog}(n)$ work, $\\text{polylog}(n)$ time algorithm in the PRAM model that computes $(1+\\epsilon)$-approximate single-source shortest paths on weighted, undirected graphs. This improves upon the breakthrough result of Cohen~[JACM'00] that achieves $O(m^{1+\\epsilon_0})$ work and $\\text{polylog}(n)$ time. While most previous approaches, including Cohen's, leveraged the power of hopsets, our algorithm builds upon the recent developments in \\emph{continuous optimization}, studying the shortest path problem from the lens of the closely-related \\emph{minimum transshi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01626","kind":"arxiv","version":6},"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.01626/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.01626","created_at":"2026-07-05T04:28:05.294784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01626v6","created_at":"2026-07-05T04:28:05.294784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01626","created_at":"2026-07-05T04:28:05.294784+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWJBYZARHJRZ","created_at":"2026-07-05T04:28:05.294784+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWJBYZARHJRZOQIC","created_at":"2026-07-05T04:28:05.294784+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWJBYZAR","created_at":"2026-07-05T04:28:05.294784+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":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6","json":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6.json","graph_json":"https://pith.science/api/pith-number/AWJBYZARHJRZOQIC3ETPPTPDT6/graph.json","events_json":"https://pith.science/api/pith-number/AWJBYZARHJRZOQIC3ETPPTPDT6/events.json","paper":"https://pith.science/paper/AWJBYZAR"},"agent_actions":{"view_html":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6","download_json":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6.json","view_paper":"https://pith.science/paper/AWJBYZAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01626&json=true","fetch_graph":"https://pith.science/api/pith-number/AWJBYZARHJRZOQIC3ETPPTPDT6/graph.json","fetch_events":"https://pith.science/api/pith-number/AWJBYZARHJRZOQIC3ETPPTPDT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6/action/storage_attestation","attest_author":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6/action/author_attestation","sign_citation":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6/action/citation_signature","submit_replication":"https://pith.science/pith/AWJBYZARHJRZOQIC3ETPPTPDT6/action/replication_record"}},"created_at":"2026-07-05T04:28:05.294784+00:00","updated_at":"2026-07-05T04:28:05.294784+00:00"}