{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NCWLR6JPMJITWJI6K33GZSBS2L","short_pith_number":"pith:NCWLR6JP","schema_version":"1.0","canonical_sha256":"68acb8f92f62513b251e56f66cc832d2f70cc8ad42144b54daf1a69199fad752","source":{"kind":"arxiv","id":"2203.03456","version":6},"attestation_state":"computed","paper":{"title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Christian Wulff-Nilsen, Danupon Nanongkai","submitted_at":"2022-03-07T15:15:09Z","abstract_excerpt":"We present a randomized algorithm that computes single-source shortest paths (SSSP) in $O(m\\log^8(n)\\log W)$ time when edge weights are integral and can be negative. This essentially resolves the classic negative-weight SSSP problem. The previous bounds are $\\tilde O((m+n^{1.5})\\log W)$ [BLNPSSSW FOCS'20] and $m^{4/3+o(1)}\\log W$ [AMV FOCS'20]. Near-linear time algorithms were known previously only for the special case of planar directed graphs [Fakcharoenphol and Rao FOCS'01].\n  In contrast to all recent developments that rely on sophisticated continuous optimization methods and dynamic algor"},"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":"2203.03456","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-07T15:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"1b2ea687aebaa87f5ca54e5a7b49e417eb58654b9aeefc6ff1b66f517b9944ae","abstract_canon_sha256":"170903bca1c7c15fa595d862af879159d65a5b3b8410c97677c71a73b9517898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:30.695144Z","signature_b64":"TkoVylp7DvA/ogYQPp6nC3u4pQ/WXmmTEpaJU22OuIxVHX5j8CCvCXeniKZhfylcfyKtWXnIzkE/mLRjwz9dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68acb8f92f62513b251e56f66cc832d2f70cc8ad42144b54daf1a69199fad752","last_reissued_at":"2026-07-05T11:05:30.694690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:30.694690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Christian Wulff-Nilsen, Danupon Nanongkai","submitted_at":"2022-03-07T15:15:09Z","abstract_excerpt":"We present a randomized algorithm that computes single-source shortest paths (SSSP) in $O(m\\log^8(n)\\log W)$ time when edge weights are integral and can be negative. This essentially resolves the classic negative-weight SSSP problem. The previous bounds are $\\tilde O((m+n^{1.5})\\log W)$ [BLNPSSSW FOCS'20] and $m^{4/3+o(1)}\\log W$ [AMV FOCS'20]. Near-linear time algorithms were known previously only for the special case of planar directed graphs [Fakcharoenphol and Rao FOCS'01].\n  In contrast to all recent developments that rely on sophisticated continuous optimization methods and dynamic algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03456","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/2203.03456/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":"2203.03456","created_at":"2026-07-05T11:05:30.694746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03456v6","created_at":"2026-07-05T11:05:30.694746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03456","created_at":"2026-07-05T11:05:30.694746+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCWLR6JPMJIT","created_at":"2026-07-05T11:05:30.694746+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCWLR6JPMJITWJI6","created_at":"2026-07-05T11:05:30.694746+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCWLR6JP","created_at":"2026-07-05T11:05:30.694746+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.02999","citing_title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L","json":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L.json","graph_json":"https://pith.science/api/pith-number/NCWLR6JPMJITWJI6K33GZSBS2L/graph.json","events_json":"https://pith.science/api/pith-number/NCWLR6JPMJITWJI6K33GZSBS2L/events.json","paper":"https://pith.science/paper/NCWLR6JP"},"agent_actions":{"view_html":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L","download_json":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L.json","view_paper":"https://pith.science/paper/NCWLR6JP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03456&json=true","fetch_graph":"https://pith.science/api/pith-number/NCWLR6JPMJITWJI6K33GZSBS2L/graph.json","fetch_events":"https://pith.science/api/pith-number/NCWLR6JPMJITWJI6K33GZSBS2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L/action/storage_attestation","attest_author":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L/action/author_attestation","sign_citation":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L/action/citation_signature","submit_replication":"https://pith.science/pith/NCWLR6JPMJITWJI6K33GZSBS2L/action/replication_record"}},"created_at":"2026-07-05T11:05:30.694746+00:00","updated_at":"2026-07-05T11:05:30.694746+00:00"}