{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3UTHZV3IO4H6CXVIYPE3X45T2V","short_pith_number":"pith:3UTHZV3I","schema_version":"1.0","canonical_sha256":"dd267cd768770fe15ea8c3c9bbf3b3d55031728671b409831a9d3d8054fbe9eb","source":{"kind":"arxiv","id":"2211.04217","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.04217","created_at":"2026-07-05T05:54:55.862327+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04217v2","created_at":"2026-07-05T05:54:55.862327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04217","created_at":"2026-07-05T05:54:55.862327+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UTHZV3IO4H6","created_at":"2026-07-05T05:54:55.862327+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UTHZV3IO4H6CXVI","created_at":"2026-07-05T05:54:55.862327+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UTHZV3I","created_at":"2026-07-05T05:54:55.862327+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/3UTHZV3IO4H6CXVIYPE3X45T2V","json":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V.json","graph_json":"https://pith.science/api/pith-number/3UTHZV3IO4H6CXVIYPE3X45T2V/graph.json","events_json":"https://pith.science/api/pith-number/3UTHZV3IO4H6CXVIYPE3X45T2V/events.json","paper":"https://pith.science/paper/3UTHZV3I"},"agent_actions":{"view_html":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V","download_json":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V.json","view_paper":"https://pith.science/paper/3UTHZV3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04217&json=true","fetch_graph":"https://pith.science/api/pith-number/3UTHZV3IO4H6CXVIYPE3X45T2V/graph.json","fetch_events":"https://pith.science/api/pith-number/3UTHZV3IO4H6CXVIYPE3X45T2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/action/storage_attestation","attest_author":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/action/author_attestation","sign_citation":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/action/citation_signature","submit_replication":"https://pith.science/pith/3UTHZV3IO4H6CXVIYPE3X45T2V/action/replication_record"}},"created_at":"2026-07-05T05:54:55.862327+00:00","updated_at":"2026-07-05T05:54:55.862327+00:00"}