{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3OJGL6L6FBSER5RPP72GJHONM2","short_pith_number":"pith:3OJGL6L6","canonical_record":{"source":{"id":"1411.4073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T22:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"afbca3a28eb1cda9ea14cc3dcb26d73af65e09db0906018105b55ee022c67eef","abstract_canon_sha256":"b71881ddb1ed4e6384e56d47d0ebd4d56f921fc95f12cde21935b48a14545416"},"schema_version":"1.0"},"canonical_sha256":"db9265f97e286448f62f7ff4649dcd66954051b7a7d0b76da44e927c53976169","source":{"kind":"arxiv","id":"1411.4073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4073","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4073v1","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4073","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"3OJGL6L6FBSE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3OJGL6L6FBSER5RP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3OJGL6L6","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3OJGL6L6FBSER5RPP72GJHONM2","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T22:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"afbca3a28eb1cda9ea14cc3dcb26d73af65e09db0906018105b55ee022c67eef","abstract_canon_sha256":"b71881ddb1ed4e6384e56d47d0ebd4d56f921fc95f12cde21935b48a14545416"},"schema_version":"1.0"},"canonical_sha256":"db9265f97e286448f62f7ff4649dcd66954051b7a7d0b76da44e927c53976169","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.584180Z","signature_b64":"3sun1ien1VqQ6hrn/nBKLPoHOOX7zaoafBpj0Gp2zxNW69RpVGvIcAyz8utwDtoS8TgQhjgJ2rIqRy8B/p48CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db9265f97e286448f62f7ff4649dcd66954051b7a7d0b76da44e927c53976169","last_reissued_at":"2026-05-18T02:35:46.583716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.583716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4073","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2QD8l6KmcFIkxh99xdfVSX2RiCw42szAs+ZOjuqhXfmcToiCWICIFEqRArV5wBG87rRRcw1M+jGVJtss5N8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:00:32.554859Z"},"content_sha256":"3827945bede7f65a231fb3a13fd0aa7f21f2d9c0fc7e04723ca4d6e81072462c","schema_version":"1.0","event_id":"sha256:3827945bede7f65a231fb3a13fd0aa7f21f2d9c0fc7e04723ca4d6e81072462c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3OJGL6L6FBSER5RPP72GJHONM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Meghana Nasre, Vijaya Ramachandran","submitted_at":"2014-11-14T22:11:39Z","abstract_excerpt":"We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. For this problem we present a decremental algorithm (that supports the deletion of a vertex, or weight increases on edges incident to a vertex). Our algorithm runs in amortized O(\\vstar^2 \\cdot \\log n) time per update, where n=|V|, and \\vstar bounds the number of edges that lie on shortest paths through any given vertex. Our APASP algorithm can be used for the decremental computation of betweenness centrality (BC), a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4073","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0khFY4OGjanakOspWMg7n4h4K2cb5T8U7D42N+aYiN71y0Th80cahPyvCc7pBe4UQl1NwuJNggzlW9+C7k/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:00:32.555206Z"},"content_sha256":"efc64829c5668a813878b996941b9249b1cd67f08e6382314f13ecbbd71ce604","schema_version":"1.0","event_id":"sha256:efc64829c5668a813878b996941b9249b1cd67f08e6382314f13ecbbd71ce604"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/bundle.json","state_url":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OJGL6L6FBSER5RPP72GJHONM2/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-25T02:00:32Z","links":{"resolver":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2","bundle":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/bundle.json","state":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OJGL6L6FBSER5RPP72GJHONM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3OJGL6L6FBSER5RPP72GJHONM2","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":"b71881ddb1ed4e6384e56d47d0ebd4d56f921fc95f12cde21935b48a14545416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T22:11:39Z","title_canon_sha256":"afbca3a28eb1cda9ea14cc3dcb26d73af65e09db0906018105b55ee022c67eef"},"schema_version":"1.0","source":{"id":"1411.4073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4073","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4073v1","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4073","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"3OJGL6L6FBSE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3OJGL6L6FBSER5RP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3OJGL6L6","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:efc64829c5668a813878b996941b9249b1cd67f08e6382314f13ecbbd71ce604","target":"graph","created_at":"2026-05-18T02:35:46Z","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":"We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. For this problem we present a decremental algorithm (that supports the deletion of a vertex, or weight increases on edges incident to a vertex). Our algorithm runs in amortized O(\\vstar^2 \\cdot \\log n) time per update, where n=|V|, and \\vstar bounds the number of edges that lie on shortest paths through any given vertex. Our APASP algorithm can be used for the decremental computation of betweenness centrality (BC), a ","authors_text":"Matteo Pontecorvi, Meghana Nasre, Vijaya Ramachandran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T22:11:39Z","title":"Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4073","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:3827945bede7f65a231fb3a13fd0aa7f21f2d9c0fc7e04723ca4d6e81072462c","target":"record","created_at":"2026-05-18T02:35:46Z","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":"b71881ddb1ed4e6384e56d47d0ebd4d56f921fc95f12cde21935b48a14545416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T22:11:39Z","title_canon_sha256":"afbca3a28eb1cda9ea14cc3dcb26d73af65e09db0906018105b55ee022c67eef"},"schema_version":"1.0","source":{"id":"1411.4073","kind":"arxiv","version":1}},"canonical_sha256":"db9265f97e286448f62f7ff4649dcd66954051b7a7d0b76da44e927c53976169","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db9265f97e286448f62f7ff4649dcd66954051b7a7d0b76da44e927c53976169","first_computed_at":"2026-05-18T02:35:46.583716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:46.583716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3sun1ien1VqQ6hrn/nBKLPoHOOX7zaoafBpj0Gp2zxNW69RpVGvIcAyz8utwDtoS8TgQhjgJ2rIqRy8B/p48CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:46.584180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3827945bede7f65a231fb3a13fd0aa7f21f2d9c0fc7e04723ca4d6e81072462c","sha256:efc64829c5668a813878b996941b9249b1cd67f08e6382314f13ecbbd71ce604"],"state_sha256":"62929114e42939a088a2eed1c4b45a1b473957d62d3dbdf46b50b1a1a551dd3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lRNLFVurqX1xOEL74lYYMYJuKvGT/8Pc9UdTJjqEgoYe2QTt1sbQZRryZ3i4JR/20SZGUkM+GXTMeww0HVHMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:00:32.557130Z","bundle_sha256":"e7ec1bace82b112459fd63df5239aac6c74855cdfdfbe01973155c259bcf8f82"}}