{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UBYIR5R4WK6BYNQXJ64UHOWV4Y","short_pith_number":"pith:UBYIR5R4","schema_version":"1.0","canonical_sha256":"a07088f63cb2bc1c36174fb943bad5e610aaefb89c79dfdef60543fd6d00b109","source":{"kind":"arxiv","id":"2606.26554","version":1},"attestation_state":"computed","paper":{"title":"Almost Optimal Multiple Source Shortest Paths and Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Christopher Ye, Yinzhan Xu","submitted_at":"2026-06-25T03:02:46Z","abstract_excerpt":"Given a graph, computing distances and reachabilities from a small set of vertices to the whole graph is an important primitive both in theory and in practice.\n  In undirected unweighted graphs, while computing single-source shortest path (SSSP) requires $O(n^2)$ time in dense graphs, all-pairs shortest paths (APSP) can be computed in $\\hat{O}(n^\\omega) = O(n^{2.372})$ time [Seidel '95] providing significant savings over running $n$ SSSP instances separately. However, if one needs to compute multiple-source shortest paths (MSSP) from a set of $n^\\sigma$ vertices, the previously best known runn"},"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":"2606.26554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-25T03:02:46Z","cross_cats_sorted":[],"title_canon_sha256":"5825b186568122781e202b07b76337b1efcde73268fb8d176826c7fbbb6dd474","abstract_canon_sha256":"881097e59a1128fb3d22295c2fa35bda3df7a2b3514ebf0284f6abe08eca3fbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:34.466917Z","signature_b64":"qhFsFDKZ+L+EoVPSHYyhMuok4WFQjOqfreBXaVepw1TZhOxJaGoJhwx9P+P1lL917DEeB1Qil13MPWCs9oPQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07088f63cb2bc1c36174fb943bad5e610aaefb89c79dfdef60543fd6d00b109","last_reissued_at":"2026-06-26T01:15:34.466507Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:34.466507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Optimal Multiple Source Shortest Paths and Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Christopher Ye, Yinzhan Xu","submitted_at":"2026-06-25T03:02:46Z","abstract_excerpt":"Given a graph, computing distances and reachabilities from a small set of vertices to the whole graph is an important primitive both in theory and in practice.\n  In undirected unweighted graphs, while computing single-source shortest path (SSSP) requires $O(n^2)$ time in dense graphs, all-pairs shortest paths (APSP) can be computed in $\\hat{O}(n^\\omega) = O(n^{2.372})$ time [Seidel '95] providing significant savings over running $n$ SSSP instances separately. However, if one needs to compute multiple-source shortest paths (MSSP) from a set of $n^\\sigma$ vertices, the previously best known runn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26554","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/2606.26554/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":"2606.26554","created_at":"2026-06-26T01:15:34.466562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26554v1","created_at":"2026-06-26T01:15:34.466562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26554","created_at":"2026-06-26T01:15:34.466562+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBYIR5R4WK6B","created_at":"2026-06-26T01:15:34.466562+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBYIR5R4WK6BYNQX","created_at":"2026-06-26T01:15:34.466562+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBYIR5R4","created_at":"2026-06-26T01:15:34.466562+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/UBYIR5R4WK6BYNQXJ64UHOWV4Y","json":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y.json","graph_json":"https://pith.science/api/pith-number/UBYIR5R4WK6BYNQXJ64UHOWV4Y/graph.json","events_json":"https://pith.science/api/pith-number/UBYIR5R4WK6BYNQXJ64UHOWV4Y/events.json","paper":"https://pith.science/paper/UBYIR5R4"},"agent_actions":{"view_html":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y","download_json":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y.json","view_paper":"https://pith.science/paper/UBYIR5R4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26554&json=true","fetch_graph":"https://pith.science/api/pith-number/UBYIR5R4WK6BYNQXJ64UHOWV4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/UBYIR5R4WK6BYNQXJ64UHOWV4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y/action/storage_attestation","attest_author":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y/action/author_attestation","sign_citation":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y/action/citation_signature","submit_replication":"https://pith.science/pith/UBYIR5R4WK6BYNQXJ64UHOWV4Y/action/replication_record"}},"created_at":"2026-06-26T01:15:34.466562+00:00","updated_at":"2026-06-26T01:15:34.466562+00:00"}