{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HUSYQE5F6AQLCHK4PSSZAXRTR6","short_pith_number":"pith:HUSYQE5F","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"},"canonical_sha256":"3d258813a5f020b11d5c7ca5905e338faaa8ade17aef2dd156bf29df2a2ca3ee","source":{"kind":"arxiv","id":"1905.01325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01325","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01325v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01325","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"HUSYQE5F6AQL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HUSYQE5F6AQLCHK4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HUSYQE5F","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HUSYQE5F6AQLCHK4PSSZAXRTR6","target":"record","payload":{"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"},"canonical_sha256":"3d258813a5f020b11d5c7ca5905e338faaa8ade17aef2dd156bf29df2a2ca3ee","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"},"source_kind":"arxiv","source_id":"1905.01325","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykF+jNJinFcRxI7AnWNTp7G6ucQ+GVG+r6l/0D+e90/4xQ0EKik5wb85Xg6/xlavYm28sEvanCfTyGeWEGxlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:12:26.254646Z"},"content_sha256":"95f044d50ad460778bb57f06551f2e64f903f6f93df19a30a26d6fd9880ff43a","schema_version":"1.0","event_id":"sha256:95f044d50ad460778bb57f06551f2e64f903f6f93df19a30a26d6fd9880ff43a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HUSYQE5F6AQLCHK4PSSZAXRTR6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASpmm+lG7WLSVde3YuvfVgA3+BrwIf3z0/091NvY2b8ozX0n0TmABbhaVVgk11TlxeJpJiEsMMY8HnmxKxNeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:12:26.254992Z"},"content_sha256":"f4ff7aa3e6996f9f7a6fab479dcfd82ffbcdf5dfa0d3be2ce2ff471de18429ca","schema_version":"1.0","event_id":"sha256:f4ff7aa3e6996f9f7a6fab479dcfd82ffbcdf5dfa0d3be2ce2ff471de18429ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/bundle.json","state_url":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T11:12:26Z","links":{"resolver":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6","bundle":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/bundle.json","state":"https://pith.science/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUSYQE5F6AQLCHK4PSSZAXRTR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HUSYQE5F6AQLCHK4PSSZAXRTR6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"56cd7ff3bc40e48874876c7232909ea2f734c00ad2513a8c39ff61e6a11f8360","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T18:04:34Z","title_canon_sha256":"d0ad9bf4d321a3ca99c65e0a9955058f61eae13187865124bdc3e49dd7dedfc1"},"schema_version":"1.0","source":{"id":"1905.01325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01325","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01325v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01325","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"HUSYQE5F6AQL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HUSYQE5F6AQLCHK4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HUSYQE5F","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:f4ff7aa3e6996f9f7a6fab479dcfd82ffbcdf5dfa0d3be2ce2ff471de18429ca","target":"graph","created_at":"2026-05-17T23:43:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 $","authors_text":"Amr Elmasry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T18:04:34Z","title":"Breaking the Bellman-Ford Shortest-Path Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01325","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95f044d50ad460778bb57f06551f2e64f903f6f93df19a30a26d6fd9880ff43a","target":"record","created_at":"2026-05-17T23:43:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"56cd7ff3bc40e48874876c7232909ea2f734c00ad2513a8c39ff61e6a11f8360","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T18:04:34Z","title_canon_sha256":"d0ad9bf4d321a3ca99c65e0a9955058f61eae13187865124bdc3e49dd7dedfc1"},"schema_version":"1.0","source":{"id":"1905.01325","kind":"arxiv","version":2}},"canonical_sha256":"3d258813a5f020b11d5c7ca5905e338faaa8ade17aef2dd156bf29df2a2ca3ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d258813a5f020b11d5c7ca5905e338faaa8ade17aef2dd156bf29df2a2ca3ee","first_computed_at":"2026-05-17T23:43:08.870211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:08.870211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QqRZOYcr4KZMQgRYzSrefaSZN6jd5mZH/SOK3/6XcHoQD+8bvYbyOwncJ8PwOm1ysq9vZ1GMqzyXt6B7AyQ0BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:08.870652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95f044d50ad460778bb57f06551f2e64f903f6f93df19a30a26d6fd9880ff43a","sha256:f4ff7aa3e6996f9f7a6fab479dcfd82ffbcdf5dfa0d3be2ce2ff471de18429ca"],"state_sha256":"5607f2735c8a89c85152aac280c0706291dcef9cd16c140ba32613b627dac6fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsT2CNF6ITDtJTcFEsACPXeXcJu0iLIYZgHuK0OS+d/DmudQZcAGyj5Rdlg+deNBegOWibqAoh2r+bTe11ccAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:12:26.256998Z","bundle_sha256":"65d26da7234cc805de966e412b557843af053ec55b53e4c809e6da1741e789d6"}}