{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2XMIHJU5MSOHJ4BPXFA5NAIMEJ","short_pith_number":"pith:2XMIHJU5","schema_version":"1.0","canonical_sha256":"d5d883a69d649c74f02fb941d6810c2278d9ca93a95a0282c22fd6bf9df8f789","source":{"kind":"arxiv","id":"1412.3852","version":4},"attestation_state":"computed","paper":{"title":"Fully Dynamic All Pairs All Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","submitted_at":"2014-12-11T22:53:27Z","abstract_excerpt":"We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph $G=(V,E)$ with a positive real weight on each edge. We present two fully dynamic algorithms for this problem in which an update supports either weight increases or weight decreases on a subset of edges incident to a vertex. Our first algorithm runs in amortized $O({\\nu^*}^2 \\cdot \\log^3 n)$ time per update, where $n = |V|$, and $\\nu^*$ bounds the number of edges that lie on shortest paths through any single vertex. Our APASP algorithm leads "},"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":"1412.3852","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T22:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"1e27f6c24545a7c3dabf840407e79d454a87c9019a1910b9b00baf02e3fa40da","abstract_canon_sha256":"2f1eb23263b65b6b5e66dcdae463ebedbd7c63627b82819fb5502fc075e7644d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:10.257840Z","signature_b64":"ymUcxewxQ+FTGB/I5ciJE4kvL60+M3VQ1+5YKETYxugivfw6GWrb4Xi6BDqkD2H39HjScMw7S+P/4jvCIip2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5d883a69d649c74f02fb941d6810c2278d9ca93a95a0282c22fd6bf9df8f789","last_reissued_at":"2026-07-05T04:16:10.257384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:10.257384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Dynamic All Pairs All Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","submitted_at":"2014-12-11T22:53:27Z","abstract_excerpt":"We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph $G=(V,E)$ with a positive real weight on each edge. We present two fully dynamic algorithms for this problem in which an update supports either weight increases or weight decreases on a subset of edges incident to a vertex. Our first algorithm runs in amortized $O({\\nu^*}^2 \\cdot \\log^3 n)$ time per update, where $n = |V|$, and $\\nu^*$ bounds the number of edges that lie on shortest paths through any single vertex. Our APASP algorithm leads "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3852","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1412.3852/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1412.3852","created_at":"2026-07-05T04:16:10.257450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3852v4","created_at":"2026-07-05T04:16:10.257450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3852","created_at":"2026-07-05T04:16:10.257450+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XMIHJU5MSOH","created_at":"2026-07-05T04:16:10.257450+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XMIHJU5MSOHJ4BP","created_at":"2026-07-05T04:16:10.257450+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XMIHJU5","created_at":"2026-07-05T04:16:10.257450+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/2XMIHJU5MSOHJ4BPXFA5NAIMEJ","json":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ.json","graph_json":"https://pith.science/api/pith-number/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/graph.json","events_json":"https://pith.science/api/pith-number/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/events.json","paper":"https://pith.science/paper/2XMIHJU5"},"agent_actions":{"view_html":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ","download_json":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ.json","view_paper":"https://pith.science/paper/2XMIHJU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3852&json=true","fetch_graph":"https://pith.science/api/pith-number/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/action/storage_attestation","attest_author":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/action/author_attestation","sign_citation":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/action/citation_signature","submit_replication":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/action/replication_record"}},"created_at":"2026-07-05T04:16:10.257450+00:00","updated_at":"2026-07-05T04:16:10.257450+00:00"}