{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3OJGL6L6FBSER5RPP72GJHONM2","short_pith_number":"pith:3OJGL6L6","schema_version":"1.0","canonical_sha256":"db9265f97e286448f62f7ff4649dcd66954051b7a7d0b76da44e927c53976169","source":{"kind":"arxiv","id":"1411.4073","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.4073","created_at":"2026-05-18T02:35:46.583788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4073v1","created_at":"2026-05-18T02:35:46.583788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4073","created_at":"2026-05-18T02:35:46.583788+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OJGL6L6FBSE","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OJGL6L6FBSER5RP","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OJGL6L6","created_at":"2026-05-18T12:28:11.866339+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/3OJGL6L6FBSER5RPP72GJHONM2","json":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2.json","graph_json":"https://pith.science/api/pith-number/3OJGL6L6FBSER5RPP72GJHONM2/graph.json","events_json":"https://pith.science/api/pith-number/3OJGL6L6FBSER5RPP72GJHONM2/events.json","paper":"https://pith.science/paper/3OJGL6L6"},"agent_actions":{"view_html":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2","download_json":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2.json","view_paper":"https://pith.science/paper/3OJGL6L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4073&json=true","fetch_graph":"https://pith.science/api/pith-number/3OJGL6L6FBSER5RPP72GJHONM2/graph.json","fetch_events":"https://pith.science/api/pith-number/3OJGL6L6FBSER5RPP72GJHONM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/action/storage_attestation","attest_author":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/action/author_attestation","sign_citation":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/action/citation_signature","submit_replication":"https://pith.science/pith/3OJGL6L6FBSER5RPP72GJHONM2/action/replication_record"}},"created_at":"2026-05-18T02:35:46.583788+00:00","updated_at":"2026-05-18T02:35:46.583788+00:00"}