{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3UTHZV3IO4H6CXVIYPE3X45T2V","short_pith_number":"pith:3UTHZV3I","canonical_record":{"source":{"id":"2211.04217","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-08T13:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"627b809c80f8120234f0371a296b914eaf4be7b7d02ba606d589e4da979e79a8","abstract_canon_sha256":"c8ad72502ecd3020abbf73fab3b6fca870e87dec6e015653c4c560fb28053f28"},"schema_version":"1.0"},"canonical_sha256":"dd267cd768770fe15ea8c3c9bbf3b3d55031728671b409831a9d3d8054fbe9eb","source":{"kind":"arxiv","id":"2211.04217","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04217","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04217v2","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04217","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"3UTHZV3IO4H6","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"pith_short_16","alias_value":"3UTHZV3IO4H6CXVI","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"pith_short_8","alias_value":"3UTHZV3I","created_at":"2026-07-05T05:54:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3UTHZV3IO4H6CXVIYPE3X45T2V","target":"record","payload":{"canonical_record":{"source":{"id":"2211.04217","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-08T13:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"627b809c80f8120234f0371a296b914eaf4be7b7d02ba606d589e4da979e79a8","abstract_canon_sha256":"c8ad72502ecd3020abbf73fab3b6fca870e87dec6e015653c4c560fb28053f28"},"schema_version":"1.0"},"canonical_sha256":"dd267cd768770fe15ea8c3c9bbf3b3d55031728671b409831a9d3d8054fbe9eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:55.862672Z","signature_b64":"0jIP/eoQx1eTn6y/5FjdDePMJtADWIqCVuQ/flJigGnblF4r3XrksVQN463Cmn9ls2hkY649slU/ldsKI4b1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd267cd768770fe15ea8c3c9bbf3b3d55031728671b409831a9d3d8054fbe9eb","last_reissued_at":"2026-07-05T05:54:55.862259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:55.862259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.04217","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-07-05T05:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhbdeP9LJbvddTgJbtPgN2xnY8WmqpUwdFhNoBhJAGHE4LJTMNc9mVTtk6CRHqdkRgWT+7uKidG3HERiNPV/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:29:28.583149Z"},"content_sha256":"c3c95fed5cd1ff971dc3678422bd0268c4e4f4d509b481fbe601d8e987d15f3a","schema_version":"1.0","event_id":"sha256:c3c95fed5cd1ff971dc3678422bd0268c4e4f4d509b481fbe601d8e987d15f3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3UTHZV3IO4H6CXVIYPE3X45T2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst Gutenberg, Sebastian Forster, Yasamin Nazari","submitted_at":"2022-11-08T13:03:53Z","abstract_excerpt":"We provide the first deterministic data structure that given a weighted undirected graph undergoing edge insertions, processes each update with polylogarithmic amortized update time and answers queries for the distance between any pair of vertices in the current graph with a polylogarithmic approximation in $O(\\log \\log n)$ time.\n  Prior to this work, no data structure was known for partially dynamic graphs, i.e., graphs undergoing either edge insertions or deletions, with less than $n^{o(1)}$ update time except for dense graphs, even when allowing randomization against oblivious adversaries o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04217","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.04217/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-05T05:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Qup5Gnlqnv4/hg2785CcUWL6X9MfqDxKPkf0SuyQIqsQv4ffbheoCfYnK5YeZOX8eYjch6nzF12Plk3P3HGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:29:28.583626Z"},"content_sha256":"55c2fec1bbf52ae0a50a9778a1fae416524aa683c2e682d33747d5aaa0516f41","schema_version":"1.0","event_id":"sha256:55c2fec1bbf52ae0a50a9778a1fae416524aa683c2e682d33747d5aaa0516f41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/bundle.json","state_url":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/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-15T11:29:28Z","links":{"resolver":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V","bundle":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/bundle.json","state":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3UTHZV3IO4H6CXVIYPE3X45T2V","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":"c8ad72502ecd3020abbf73fab3b6fca870e87dec6e015653c4c560fb28053f28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-08T13:03:53Z","title_canon_sha256":"627b809c80f8120234f0371a296b914eaf4be7b7d02ba606d589e4da979e79a8"},"schema_version":"1.0","source":{"id":"2211.04217","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04217","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04217v2","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04217","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"3UTHZV3IO4H6","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"pith_short_16","alias_value":"3UTHZV3IO4H6CXVI","created_at":"2026-07-05T05:54:55Z"},{"alias_kind":"pith_short_8","alias_value":"3UTHZV3I","created_at":"2026-07-05T05:54:55Z"}],"graph_snapshots":[{"event_id":"sha256:55c2fec1bbf52ae0a50a9778a1fae416524aa683c2e682d33747d5aaa0516f41","target":"graph","created_at":"2026-07-05T05:54:55Z","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/2211.04217/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide the first deterministic data structure that given a weighted undirected graph undergoing edge insertions, processes each update with polylogarithmic amortized update time and answers queries for the distance between any pair of vertices in the current graph with a polylogarithmic approximation in $O(\\log \\log n)$ time.\n  Prior to this work, no data structure was known for partially dynamic graphs, i.e., graphs undergoing either edge insertions or deletions, with less than $n^{o(1)}$ update time except for dense graphs, even when allowing randomization against oblivious adversaries o","authors_text":"Maximilian Probst Gutenberg, Sebastian Forster, Yasamin Nazari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-08T13:03:53Z","title":"Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04217","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:c3c95fed5cd1ff971dc3678422bd0268c4e4f4d509b481fbe601d8e987d15f3a","target":"record","created_at":"2026-07-05T05:54:55Z","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":"c8ad72502ecd3020abbf73fab3b6fca870e87dec6e015653c4c560fb28053f28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-08T13:03:53Z","title_canon_sha256":"627b809c80f8120234f0371a296b914eaf4be7b7d02ba606d589e4da979e79a8"},"schema_version":"1.0","source":{"id":"2211.04217","kind":"arxiv","version":2}},"canonical_sha256":"dd267cd768770fe15ea8c3c9bbf3b3d55031728671b409831a9d3d8054fbe9eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd267cd768770fe15ea8c3c9bbf3b3d55031728671b409831a9d3d8054fbe9eb","first_computed_at":"2026-07-05T05:54:55.862259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:54:55.862259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0jIP/eoQx1eTn6y/5FjdDePMJtADWIqCVuQ/flJigGnblF4r3XrksVQN463Cmn9ls2hkY649slU/ldsKI4b1Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:54:55.862672Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04217","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3c95fed5cd1ff971dc3678422bd0268c4e4f4d509b481fbe601d8e987d15f3a","sha256:55c2fec1bbf52ae0a50a9778a1fae416524aa683c2e682d33747d5aaa0516f41"],"state_sha256":"5042a778135cc6f58e125cad631cf3c3ca1e18c9ce4d839433a3aa60c957637c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtGUYBUtpUS4rajtlojMZK7dzZJvwrA2JDLvgiuC4P6u/92617xCKGGNERDlHhEADxDaGBboXQYi6YW5FRSuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T11:29:28.587707Z","bundle_sha256":"96758062608e29c52b11be36eecf6e9f23e1ad1c5ee15654575fd4ad96f69760"}}