{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2ECS2WMMNAIM7C5S2KUXBPJMV4","short_pith_number":"pith:2ECS2WMM","schema_version":"1.0","canonical_sha256":"d1052d598c6810cf8bb2d2a970bd2caf2a7674803c43f8be35802bf77d462a44","source":{"kind":"arxiv","id":"1212.6327","version":1},"attestation_state":"computed","paper":{"title":"Speeding up shortest path algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrej Brodnik, Marko Grgurovi\\v{c}","submitted_at":"2012-12-27T08:59:40Z","abstract_excerpt":"Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\\mathcal{O}(m^* n + m \\lg n + nT_\\psi(m^*, n))$, where $m^*$ is the number of different edges contained in shortest paths and $T_\\psi(m^*, n)$ is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial $n$ times application of $\\psi$ that runs in $\\mathcal{O}(nT_\\psi(m,n))$. In our algorithm we use $\\psi$ as a black box and hence any improvement on $\\psi$ results also in impro"},"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":"1212.6327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-27T08:59:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"61002baffb6d2c6c481d8a694c2bfd624a4168ec47da0d59cb8a48a9afbb56fe","abstract_canon_sha256":"6b706fab9946be69c69a20ccbf5694490251cf1ea5f050e38a6cfe814b8660ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:40.136125Z","signature_b64":"swoIEIVQYi3w+QN4nNoJKeTsbt7EcNSoq4kKnFuxOqTrULFJJIcLtPMKsje4qk0OZzbDPM96IiOxK2af0gN7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1052d598c6810cf8bb2d2a970bd2caf2a7674803c43f8be35802bf77d462a44","last_reissued_at":"2026-05-18T03:37:40.135558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:40.135558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding up shortest path algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrej Brodnik, Marko Grgurovi\\v{c}","submitted_at":"2012-12-27T08:59:40Z","abstract_excerpt":"Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\\mathcal{O}(m^* n + m \\lg n + nT_\\psi(m^*, n))$, where $m^*$ is the number of different edges contained in shortest paths and $T_\\psi(m^*, n)$ is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial $n$ times application of $\\psi$ that runs in $\\mathcal{O}(nT_\\psi(m,n))$. In our algorithm we use $\\psi$ as a black box and hence any improvement on $\\psi$ results also in impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6327","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":""},"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":"1212.6327","created_at":"2026-05-18T03:37:40.135638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6327v1","created_at":"2026-05-18T03:37:40.135638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6327","created_at":"2026-05-18T03:37:40.135638+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ECS2WMMNAIM","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ECS2WMMNAIM7C5S","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ECS2WMM","created_at":"2026-05-18T12:26:50.516681+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/2ECS2WMMNAIM7C5S2KUXBPJMV4","json":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4.json","graph_json":"https://pith.science/api/pith-number/2ECS2WMMNAIM7C5S2KUXBPJMV4/graph.json","events_json":"https://pith.science/api/pith-number/2ECS2WMMNAIM7C5S2KUXBPJMV4/events.json","paper":"https://pith.science/paper/2ECS2WMM"},"agent_actions":{"view_html":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4","download_json":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4.json","view_paper":"https://pith.science/paper/2ECS2WMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6327&json=true","fetch_graph":"https://pith.science/api/pith-number/2ECS2WMMNAIM7C5S2KUXBPJMV4/graph.json","fetch_events":"https://pith.science/api/pith-number/2ECS2WMMNAIM7C5S2KUXBPJMV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/action/storage_attestation","attest_author":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/action/author_attestation","sign_citation":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/action/citation_signature","submit_replication":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/action/replication_record"}},"created_at":"2026-05-18T03:37:40.135638+00:00","updated_at":"2026-05-18T03:37:40.135638+00:00"}