{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HUSYQE5F6AQLCHK4PSSZAXRTR6","short_pith_number":"pith:HUSYQE5F","schema_version":"1.0","canonical_sha256":"3d258813a5f020b11d5c7ca5905e338faaa8ade17aef2dd156bf29df2a2ca3ee","source":{"kind":"arxiv","id":"1905.01325","version":2},"attestation_state":"computed","paper":{"title":"Breaking the Bellman-Ford Shortest-Path Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry","submitted_at":"2019-05-03T18:04:34Z","abstract_excerpt":"In this paper we give a single-source shortest-path algorithm that breaks, after over 60 years, the $O(n \\cdot m)$ time bound for the Bellman-Ford algorithm, where $n$ is the number of vertices and $m$ is the number of arcs of the graph. Our algorithm converts the input graph to a graph with nonnegative weights by performing at most $\\min(\\sqrt{n},\\sqrt{m/\\log n})$ calls to Dijkstra's algorithm, such that the shortest-path tree is the same for the new graph as that for the original. When Dijkstra's algorithm is implemented using Fibonacci heaps, the running time of our algorithm is therefore $"},"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":"1905.01325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T18:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"d0ad9bf4d321a3ca99c65e0a9955058f61eae13187865124bdc3e49dd7dedfc1","abstract_canon_sha256":"56cd7ff3bc40e48874876c7232909ea2f734c00ad2513a8c39ff61e6a11f8360"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.870652Z","signature_b64":"QqRZOYcr4KZMQgRYzSrefaSZN6jd5mZH/SOK3/6XcHoQD+8bvYbyOwncJ8PwOm1ysq9vZ1GMqzyXt6B7AyQ0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d258813a5f020b11d5c7ca5905e338faaa8ade17aef2dd156bf29df2a2ca3ee","last_reissued_at":"2026-05-17T23:43:08.870211Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.870211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Bellman-Ford Shortest-Path Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry","submitted_at":"2019-05-03T18:04:34Z","abstract_excerpt":"In this paper we give a single-source shortest-path algorithm that breaks, after over 60 years, the $O(n \\cdot m)$ time bound for the Bellman-Ford algorithm, where $n$ is the number of vertices and $m$ is the number of arcs of the graph. Our algorithm converts the input graph to a graph with nonnegative weights by performing at most $\\min(\\sqrt{n},\\sqrt{m/\\log n})$ calls to Dijkstra's algorithm, such that the shortest-path tree is the same for the new graph as that for the original. When Dijkstra's algorithm is implemented using Fibonacci heaps, the running time of our algorithm is therefore $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01325","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":"1905.01325","created_at":"2026-05-17T23:43:08.870287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01325v2","created_at":"2026-05-17T23:43:08.870287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01325","created_at":"2026-05-17T23:43:08.870287+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUSYQE5F6AQL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUSYQE5F6AQLCHK4","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUSYQE5F","created_at":"2026-05-18T12:33:18.533446+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/HUSYQE5F6AQLCHK4PSSZAXRTR6","json":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6.json","graph_json":"https://pith.science/api/pith-number/HUSYQE5F6AQLCHK4PSSZAXRTR6/graph.json","events_json":"https://pith.science/api/pith-number/HUSYQE5F6AQLCHK4PSSZAXRTR6/events.json","paper":"https://pith.science/paper/HUSYQE5F"},"agent_actions":{"view_html":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6","download_json":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6.json","view_paper":"https://pith.science/paper/HUSYQE5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01325&json=true","fetch_graph":"https://pith.science/api/pith-number/HUSYQE5F6AQLCHK4PSSZAXRTR6/graph.json","fetch_events":"https://pith.science/api/pith-number/HUSYQE5F6AQLCHK4PSSZAXRTR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/action/storage_attestation","attest_author":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/action/author_attestation","sign_citation":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/action/citation_signature","submit_replication":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/action/replication_record"}},"created_at":"2026-05-17T23:43:08.870287+00:00","updated_at":"2026-05-17T23:43:08.870287+00:00"}