{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XSFBTC54TXE2QE765I7IFOK4SE","short_pith_number":"pith:XSFBTC54","schema_version":"1.0","canonical_sha256":"bc8a198bbc9dc9a813feea3e82b95c911a36c9ea826a0fa79fcc737757a85a32","source":{"kind":"arxiv","id":"1602.03881","version":2},"attestation_state":"computed","paper":{"title":"Parallel Shortest-Paths Using Radius Stepping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Kanat Tangwongsan, Yan Gu, Yihan Sun","submitted_at":"2016-02-11T20:51:47Z","abstract_excerpt":"The single-source shortest path problem (SSSP) with nonnegative edge weights is a notoriously difficult problem to solve efficiently in parallel---it is one of the graph problems said to suffer from the transitive-closure bottleneck. In practice, the $\\Delta$-stepping algorithm of Meyer and Sanders (J. Algorithms, 2003) often works efficiently but has no known theoretical bounds on general graphs. The algorithm takes a sequence of steps, each increasing the radius by a user-specified value $\\Delta$. Each step settles the vertices in its annulus but can take $\\Theta(n)$ substeps, each requiring"},"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":"1602.03881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-11T20:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"b7f86582b7f523edfdbe378e4c05607c9ce3bb7695d70ae2352ba59a173be876","abstract_canon_sha256":"885c1abd699618d2851ffcdbd11e0efbea067ab081d2a5c557aab23675ddd427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.907139Z","signature_b64":"ENRY8aLzdDAjL3hK72hwNss/DsvDECJ48Nk9h7xAKRwdVeBmij05Srr4PJKaIkxChRC/XFz7qVhOnCxSEIjmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc8a198bbc9dc9a813feea3e82b95c911a36c9ea826a0fa79fcc737757a85a32","last_reissued_at":"2026-05-18T01:19:10.906413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.906413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Shortest-Paths Using Radius Stepping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Kanat Tangwongsan, Yan Gu, Yihan Sun","submitted_at":"2016-02-11T20:51:47Z","abstract_excerpt":"The single-source shortest path problem (SSSP) with nonnegative edge weights is a notoriously difficult problem to solve efficiently in parallel---it is one of the graph problems said to suffer from the transitive-closure bottleneck. In practice, the $\\Delta$-stepping algorithm of Meyer and Sanders (J. Algorithms, 2003) often works efficiently but has no known theoretical bounds on general graphs. The algorithm takes a sequence of steps, each increasing the radius by a user-specified value $\\Delta$. Each step settles the vertices in its annulus but can take $\\Theta(n)$ substeps, each requiring"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03881","kind":"arxiv","version":2},"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":"1602.03881","created_at":"2026-05-18T01:19:10.906531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03881v2","created_at":"2026-05-18T01:19:10.906531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03881","created_at":"2026-05-18T01:19:10.906531+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSFBTC54TXE2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSFBTC54TXE2QE76","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSFBTC54","created_at":"2026-05-18T12:30:51.357362+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/XSFBTC54TXE2QE765I7IFOK4SE","json":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE.json","graph_json":"https://pith.science/api/pith-number/XSFBTC54TXE2QE765I7IFOK4SE/graph.json","events_json":"https://pith.science/api/pith-number/XSFBTC54TXE2QE765I7IFOK4SE/events.json","paper":"https://pith.science/paper/XSFBTC54"},"agent_actions":{"view_html":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE","download_json":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE.json","view_paper":"https://pith.science/paper/XSFBTC54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03881&json=true","fetch_graph":"https://pith.science/api/pith-number/XSFBTC54TXE2QE765I7IFOK4SE/graph.json","fetch_events":"https://pith.science/api/pith-number/XSFBTC54TXE2QE765I7IFOK4SE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE/action/storage_attestation","attest_author":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE/action/author_attestation","sign_citation":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE/action/citation_signature","submit_replication":"https://pith.science/pith/XSFBTC54TXE2QE765I7IFOK4SE/action/replication_record"}},"created_at":"2026-05-18T01:19:10.906531+00:00","updated_at":"2026-05-18T01:19:10.906531+00:00"}