{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2ECS2WMMNAIM7C5S2KUXBPJMV4","short_pith_number":"pith:2ECS2WMM","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"},"canonical_sha256":"d1052d598c6810cf8bb2d2a970bd2caf2a7674803c43f8be35802bf77d462a44","source":{"kind":"arxiv","id":"1212.6327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6327","created_at":"2026-05-18T03:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6327v1","created_at":"2026-05-18T03:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6327","created_at":"2026-05-18T03:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"2ECS2WMMNAIM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2ECS2WMMNAIM7C5S","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2ECS2WMM","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2ECS2WMMNAIM7C5S2KUXBPJMV4","target":"record","payload":{"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"},"canonical_sha256":"d1052d598c6810cf8bb2d2a970bd2caf2a7674803c43f8be35802bf77d462a44","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"},"source_kind":"arxiv","source_id":"1212.6327","source_version":1,"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-18T03:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pA5m3EJsJdqtfgSOUwKuyv2ElglLW97EIqnaEtCi0otGSz6Bbnroj2jxdiP4z/YhHem+kIeole/iS0dJVv4nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:08:57.563236Z"},"content_sha256":"2bb32caf60fba73a8bc3cdfae840d87f281d3719d9f34957c88bc02ea60b5cc9","schema_version":"1.0","event_id":"sha256:2bb32caf60fba73a8bc3cdfae840d87f281d3719d9f34957c88bc02ea60b5cc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2ECS2WMMNAIM7C5S2KUXBPJMV4","target":"graph","payload":{"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"},"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-18T03:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSYAKsLDdcR4fqw+fl1WEvHUXvEnrwaFgXtOXZ4FK/Y7M1W655qg+Gu5TiziELScU3YkMpQzlaA5Fi2NuAMsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:08:57.563607Z"},"content_sha256":"95e406b5371e9d142e160e286df373516b89e4a0c807f3201c2907f312f7bfa4","schema_version":"1.0","event_id":"sha256:95e406b5371e9d142e160e286df373516b89e4a0c807f3201c2907f312f7bfa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/bundle.json","state_url":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/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-22T11:08:57Z","links":{"resolver":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4","bundle":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/bundle.json","state":"https://pith.science/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ECS2WMMNAIM7C5S2KUXBPJMV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2ECS2WMMNAIM7C5S2KUXBPJMV4","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":"6b706fab9946be69c69a20ccbf5694490251cf1ea5f050e38a6cfe814b8660ee","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-27T08:59:40Z","title_canon_sha256":"61002baffb6d2c6c481d8a694c2bfd624a4168ec47da0d59cb8a48a9afbb56fe"},"schema_version":"1.0","source":{"id":"1212.6327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6327","created_at":"2026-05-18T03:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6327v1","created_at":"2026-05-18T03:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6327","created_at":"2026-05-18T03:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"2ECS2WMMNAIM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2ECS2WMMNAIM7C5S","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2ECS2WMM","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:95e406b5371e9d142e160e286df373516b89e4a0c807f3201c2907f312f7bfa4","target":"graph","created_at":"2026-05-18T03:37:40Z","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":"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","authors_text":"Andrej Brodnik, Marko Grgurovi\\v{c}","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-27T08:59:40Z","title":"Speeding up shortest path algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6327","kind":"arxiv","version":1},"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:2bb32caf60fba73a8bc3cdfae840d87f281d3719d9f34957c88bc02ea60b5cc9","target":"record","created_at":"2026-05-18T03:37:40Z","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":"6b706fab9946be69c69a20ccbf5694490251cf1ea5f050e38a6cfe814b8660ee","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-27T08:59:40Z","title_canon_sha256":"61002baffb6d2c6c481d8a694c2bfd624a4168ec47da0d59cb8a48a9afbb56fe"},"schema_version":"1.0","source":{"id":"1212.6327","kind":"arxiv","version":1}},"canonical_sha256":"d1052d598c6810cf8bb2d2a970bd2caf2a7674803c43f8be35802bf77d462a44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1052d598c6810cf8bb2d2a970bd2caf2a7674803c43f8be35802bf77d462a44","first_computed_at":"2026-05-18T03:37:40.135558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:40.135558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swoIEIVQYi3w+QN4nNoJKeTsbt7EcNSoq4kKnFuxOqTrULFJJIcLtPMKsje4qk0OZzbDPM96IiOxK2af0gN7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:40.136125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bb32caf60fba73a8bc3cdfae840d87f281d3719d9f34957c88bc02ea60b5cc9","sha256:95e406b5371e9d142e160e286df373516b89e4a0c807f3201c2907f312f7bfa4"],"state_sha256":"b3988ef456b137d986a2905d58055897100ee14712d9a9cbcc79cc35ccf890a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ir15esLtYpTvhzUpRzvLOIru/E5+7h8m48CgoPv2Lg4veGbrCNyQEehw4uicS1p9p2CS8fRTniQEIxCeDzq5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:08:57.565558Z","bundle_sha256":"5f948a53a38e01e1c635a554c27c17e9ac7f51dcc11274d8e9c56dc7475e0c7c"}}