{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LFMLSWA6MVDBYO3NTQWL4GFQSR","short_pith_number":"pith:LFMLSWA6","canonical_record":{"source":{"id":"1607.05132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"66ac3327b79b72fe994d8e0f29bc6b63fb83179dcf176d65357ac3992faa9abd","abstract_canon_sha256":"d532df4ee11cb2444e111e199c6062e75da2860c8e103ec4c598dc556b8c4c19"},"schema_version":"1.0"},"canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","source":{"kind":"arxiv","id":"1607.05132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05132","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05132v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05132","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"LFMLSWA6MVDB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFMLSWA6MVDBYO3N","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFMLSWA6","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LFMLSWA6MVDBYO3NTQWL4GFQSR","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"66ac3327b79b72fe994d8e0f29bc6b63fb83179dcf176d65357ac3992faa9abd","abstract_canon_sha256":"d532df4ee11cb2444e111e199c6062e75da2860c8e103ec4c598dc556b8c4c19"},"schema_version":"1.0"},"canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.434505Z","signature_b64":"7Fjctqat2oi++R5k9tTS+KBkZpsSJnmAsLSSjA5onD2X9rlRyl4lacVqmdQaF8wv/N4X7dri8cpSkcyymGtRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","last_reissued_at":"2026-05-18T00:22:16.433825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.433825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05132","source_version":2,"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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XvLpZrDqrnacoNJJncyXoZ1b/+Dj+O9zH8SfLRbc35MU6zJHxxY8xS26m7bMPTlIoJBCH3EJeJurEVphUkQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:30:28.324440Z"},"content_sha256":"e6c573f49a7d429e05c50eec7c5107403481550a1520024a802c97e9ae722ba5","schema_version":"1.0","event_id":"sha256:e6c573f49a7d429e05c50eec7c5107403481550a1520024a802c97e9ae722ba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LFMLSWA6MVDBYO3NTQWL4GFQSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully dynamic all-pairs shortest paths with worst-case update-time revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ittai Abraham, Sebastian Krinninger, Shiri Chechik","submitted_at":"2016-07-18T15:35:39Z","abstract_excerpt":"We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case guarantees on the time needed to process a single update (in contrast to related results, the update time is not amortized over a sequence of updates).\n  Our main result is a simple randomized algorithm that for any parameter $c>1$ has a worst-case update time of $O(cn^{2+2/3} \\log^{4/3}{n})$ and answers distance queries correctly with probability $1-1/n^c$, agains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05132","kind":"arxiv","version":2},"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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUYM57tAQEvLqNk2SQc2KNSIdJXgh3huF89iB5BM4IxUfo8ck6CSMybKwahYgWkBNM+RVqvaT3H6+PRpVtOHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:30:28.325145Z"},"content_sha256":"20b2a2714bac587fad2ab97ef39baf7d1127997a25f20f941ad8356d013ba719","schema_version":"1.0","event_id":"sha256:20b2a2714bac587fad2ab97ef39baf7d1127997a25f20f941ad8356d013ba719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/bundle.json","state_url":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/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-05-28T16:30:28Z","links":{"resolver":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR","bundle":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/bundle.json","state":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LFMLSWA6MVDBYO3NTQWL4GFQSR","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":"d532df4ee11cb2444e111e199c6062e75da2860c8e103ec4c598dc556b8c4c19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:35:39Z","title_canon_sha256":"66ac3327b79b72fe994d8e0f29bc6b63fb83179dcf176d65357ac3992faa9abd"},"schema_version":"1.0","source":{"id":"1607.05132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05132","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05132v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05132","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"LFMLSWA6MVDB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFMLSWA6MVDBYO3N","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFMLSWA6","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:20b2a2714bac587fad2ab97ef39baf7d1127997a25f20f941ad8356d013ba719","target":"graph","created_at":"2026-05-18T00:22:16Z","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 revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case guarantees on the time needed to process a single update (in contrast to related results, the update time is not amortized over a sequence of updates).\n  Our main result is a simple randomized algorithm that for any parameter $c>1$ has a worst-case update time of $O(cn^{2+2/3} \\log^{4/3}{n})$ and answers distance queries correctly with probability $1-1/n^c$, agains","authors_text":"Ittai Abraham, Sebastian Krinninger, Shiri Chechik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:35:39Z","title":"Fully dynamic all-pairs shortest paths with worst-case update-time revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05132","kind":"arxiv","version":2},"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:e6c573f49a7d429e05c50eec7c5107403481550a1520024a802c97e9ae722ba5","target":"record","created_at":"2026-05-18T00:22:16Z","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":"d532df4ee11cb2444e111e199c6062e75da2860c8e103ec4c598dc556b8c4c19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:35:39Z","title_canon_sha256":"66ac3327b79b72fe994d8e0f29bc6b63fb83179dcf176d65357ac3992faa9abd"},"schema_version":"1.0","source":{"id":"1607.05132","kind":"arxiv","version":2}},"canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","first_computed_at":"2026-05-18T00:22:16.433825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.433825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Fjctqat2oi++R5k9tTS+KBkZpsSJnmAsLSSjA5onD2X9rlRyl4lacVqmdQaF8wv/N4X7dri8cpSkcyymGtRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.434505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6c573f49a7d429e05c50eec7c5107403481550a1520024a802c97e9ae722ba5","sha256:20b2a2714bac587fad2ab97ef39baf7d1127997a25f20f941ad8356d013ba719"],"state_sha256":"b74e0cd94df8ac1c1b9417480d21caa27ddfa1f7396e86a91610ab07a9af31eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wzLrYWZ0LNXitb5SY9veTNh4PhZemaaL+Run30luNO9Lta9anmlQqywu9iXYcy7o/2bL5LMtqzgOiiwhUyNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:30:28.328910Z","bundle_sha256":"9175a3dda2acdf0302ec909c2d7b98b939c7fe4678cf7e86735884eb382d54c9"}}