{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2XMIHJU5MSOHJ4BPXFA5NAIMEJ","short_pith_number":"pith:2XMIHJU5","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"},"canonical_sha256":"d5d883a69d649c74f02fb941d6810c2278d9ca93a95a0282c22fd6bf9df8f789","source":{"kind":"arxiv","id":"1412.3852","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3852","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3852v4","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3852","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"pith_short_12","alias_value":"2XMIHJU5MSOH","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"pith_short_16","alias_value":"2XMIHJU5MSOHJ4BP","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"pith_short_8","alias_value":"2XMIHJU5","created_at":"2026-07-05T04:16:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2XMIHJU5MSOHJ4BPXFA5NAIMEJ","target":"record","payload":{"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"},"canonical_sha256":"d5d883a69d649c74f02fb941d6810c2278d9ca93a95a0282c22fd6bf9df8f789","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"},"source_kind":"arxiv","source_id":"1412.3852","source_version":4,"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-07-05T04:16:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFkbcX3EycUbWlNcUMWL/KFKIES0uN91lKIOzIX63U9xgVBfyxzdLvWqPV0aOVEZ/0jkvnWnbGNfM+sLoyNsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T00:44:44.191765Z"},"content_sha256":"c755de31e12cc682b63e2d3a57f31884bfe8a1151277d9172dd158c53ff4b9ee","schema_version":"1.0","event_id":"sha256:c755de31e12cc682b63e2d3a57f31884bfe8a1151277d9172dd158c53ff4b9ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2XMIHJU5MSOHJ4BPXFA5NAIMEJ","target":"graph","payload":{"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"},"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-07-05T04:16:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfgJBDQvHXchPte4f8sEEzSlvCBtZ/GX51li7o+iZCvMqjAFY4PW53QdKvx2GvZXPYpdjNRpn6WrqgIx+amoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T00:44:44.192615Z"},"content_sha256":"31f2a8d7e35529815788363e7364dcb2eaca0cad74e9dc1403ac338325ecb01b","schema_version":"1.0","event_id":"sha256:31f2a8d7e35529815788363e7364dcb2eaca0cad74e9dc1403ac338325ecb01b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/bundle.json","state_url":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/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-08-01T00:44:44Z","links":{"resolver":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ","bundle":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/bundle.json","state":"https://pith.science/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XMIHJU5MSOHJ4BPXFA5NAIMEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2XMIHJU5MSOHJ4BPXFA5NAIMEJ","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":"2f1eb23263b65b6b5e66dcdae463ebedbd7c63627b82819fb5502fc075e7644d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T22:53:27Z","title_canon_sha256":"1e27f6c24545a7c3dabf840407e79d454a87c9019a1910b9b00baf02e3fa40da"},"schema_version":"1.0","source":{"id":"1412.3852","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3852","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3852v4","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3852","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"pith_short_12","alias_value":"2XMIHJU5MSOH","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"pith_short_16","alias_value":"2XMIHJU5MSOHJ4BP","created_at":"2026-07-05T04:16:10Z"},{"alias_kind":"pith_short_8","alias_value":"2XMIHJU5","created_at":"2026-07-05T04:16:10Z"}],"graph_snapshots":[{"event_id":"sha256:31f2a8d7e35529815788363e7364dcb2eaca0cad74e9dc1403ac338325ecb01b","target":"graph","created_at":"2026-07-05T04:16:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1412.3852/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T22:53:27Z","title":"Fully Dynamic All Pairs All Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3852","kind":"arxiv","version":4},"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:c755de31e12cc682b63e2d3a57f31884bfe8a1151277d9172dd158c53ff4b9ee","target":"record","created_at":"2026-07-05T04:16:10Z","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":"2f1eb23263b65b6b5e66dcdae463ebedbd7c63627b82819fb5502fc075e7644d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T22:53:27Z","title_canon_sha256":"1e27f6c24545a7c3dabf840407e79d454a87c9019a1910b9b00baf02e3fa40da"},"schema_version":"1.0","source":{"id":"1412.3852","kind":"arxiv","version":4}},"canonical_sha256":"d5d883a69d649c74f02fb941d6810c2278d9ca93a95a0282c22fd6bf9df8f789","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5d883a69d649c74f02fb941d6810c2278d9ca93a95a0282c22fd6bf9df8f789","first_computed_at":"2026-07-05T04:16:10.257384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:16:10.257384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ymUcxewxQ+FTGB/I5ciJE4kvL60+M3VQ1+5YKETYxugivfw6GWrb4Xi6BDqkD2H39HjScMw7S+P/4jvCIip2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:16:10.257840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3852","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c755de31e12cc682b63e2d3a57f31884bfe8a1151277d9172dd158c53ff4b9ee","sha256:31f2a8d7e35529815788363e7364dcb2eaca0cad74e9dc1403ac338325ecb01b"],"state_sha256":"db2713e9cd5ab47f4ac7b1d86c45c54e706f31071671ac9ba243278c0030a447"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7krnwAPkW5B3crmr1GS1fnfkPiUDyQRAIZqMsNWQAmlFPmtweRI4nlSKjCAadncAIE6xrHzI06THla6K02A6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T00:44:44.197145Z","bundle_sha256":"bad99fb2345b3ea2f6768ae87efb9124e456e952e17cde8ff630d1907036b535"}}