{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QDZ2ALGGFQUAB2DBARASBCRDT6","short_pith_number":"pith:QDZ2ALGG","schema_version":"1.0","canonical_sha256":"80f3a02cc62c2800e8610441208a239f83af5b54108e1ce80e99f06fcdffe84d","source":{"kind":"arxiv","id":"2506.20017","version":1},"attestation_state":"computed","paper":{"title":"All-Pairs Shortest Paths with Few Weights per Node","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Ce Jin, Nick Fischer, Virginia Vassilevska Williams, Zoe Xi","submitted_at":"2025-06-24T21:21:25Z","abstract_excerpt":"We study the central All-Pairs Shortest Paths (APSP) problem under the restriction that there are at most $d$ distinct weights on the outgoing edges from every node. For $d=n$ this is the classical (unrestricted) APSP problem that is hypothesized to require cubic time $n^{3-o(1)}$, and at the other extreme, for $d=1$, it is equivalent to the Node-Weighted APSP problem. We present new algorithms that achieve the following results:\n  1. Node-Weighted APSP can be solved in time $\\tilde{O}(n^{(3+\\omega)/2}) = \\tilde{O}(n^{2.686})$, improving on the 15-year-old subcubic bounds $\\tilde{O}(n^{(9+\\ome"},"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":"2506.20017","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-24T21:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"0f01d6478183ff55d40846e4bf0fd597f56daf8e2bcf95c8934af4ed6dd8e649","abstract_canon_sha256":"ed2228d1131ae673d72f492bbc6de741fdce628395104934fcf43c8291304487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:58.584866Z","signature_b64":"IkoKaUM7+12lPO5Yve0ODPrIMpNims65rySjRn51AB8+Y/DIsg3n+pFM0Wk42lENyRbjmauQpfumdG7vU/4SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80f3a02cc62c2800e8610441208a239f83af5b54108e1ce80e99f06fcdffe84d","last_reissued_at":"2026-07-05T11:26:58.584152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:58.584152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-Pairs Shortest Paths with Few Weights per Node","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Ce Jin, Nick Fischer, Virginia Vassilevska Williams, Zoe Xi","submitted_at":"2025-06-24T21:21:25Z","abstract_excerpt":"We study the central All-Pairs Shortest Paths (APSP) problem under the restriction that there are at most $d$ distinct weights on the outgoing edges from every node. For $d=n$ this is the classical (unrestricted) APSP problem that is hypothesized to require cubic time $n^{3-o(1)}$, and at the other extreme, for $d=1$, it is equivalent to the Node-Weighted APSP problem. We present new algorithms that achieve the following results:\n  1. Node-Weighted APSP can be solved in time $\\tilde{O}(n^{(3+\\omega)/2}) = \\tilde{O}(n^{2.686})$, improving on the 15-year-old subcubic bounds $\\tilde{O}(n^{(9+\\ome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20017","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/2506.20017/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":"2506.20017","created_at":"2026-07-05T11:26:58.584233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20017v1","created_at":"2026-07-05T11:26:58.584233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20017","created_at":"2026-07-05T11:26:58.584233+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDZ2ALGGFQUA","created_at":"2026-07-05T11:26:58.584233+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDZ2ALGGFQUAB2DB","created_at":"2026-07-05T11:26:58.584233+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDZ2ALGG","created_at":"2026-07-05T11:26:58.584233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09538","citing_title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","ref_index":193,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6","json":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6.json","graph_json":"https://pith.science/api/pith-number/QDZ2ALGGFQUAB2DBARASBCRDT6/graph.json","events_json":"https://pith.science/api/pith-number/QDZ2ALGGFQUAB2DBARASBCRDT6/events.json","paper":"https://pith.science/paper/QDZ2ALGG"},"agent_actions":{"view_html":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6","download_json":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6.json","view_paper":"https://pith.science/paper/QDZ2ALGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20017&json=true","fetch_graph":"https://pith.science/api/pith-number/QDZ2ALGGFQUAB2DBARASBCRDT6/graph.json","fetch_events":"https://pith.science/api/pith-number/QDZ2ALGGFQUAB2DBARASBCRDT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6/action/storage_attestation","attest_author":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6/action/author_attestation","sign_citation":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6/action/citation_signature","submit_replication":"https://pith.science/pith/QDZ2ALGGFQUAB2DBARASBCRDT6/action/replication_record"}},"created_at":"2026-07-05T11:26:58.584233+00:00","updated_at":"2026-07-05T11:26:58.584233+00:00"}