{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UL3BKJ4XDS7SBZHBRERWUCYCK5","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":"f50232ec9316637e0918f571402088d7769edc9dcda8f4af03abbdb4fa953b7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T15:33:46Z","title_canon_sha256":"f1eee4ad6e483037872e89df86dcbd9edea3ca39253f5d90e96a026fe20c61e5"},"schema_version":"1.0","source":{"id":"1611.03745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03745","created_at":"2026-05-18T00:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03745v2","created_at":"2026-05-18T00:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03745","created_at":"2026-05-18T00:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"UL3BKJ4XDS7S","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UL3BKJ4XDS7SBZHB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UL3BKJ4X","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:be02f92169c7e28cee5a85f84205513896c4df7da0fcbf7e2fccfe7415124acf","target":"graph","created_at":"2026-05-18T00:46:13Z","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 present two algorithms for dynamically maintaining a spanning forest of a graph undergoing edge insertions and deletions. Our algorithms guarantee {\\em worst-case update time} and work against an adaptive adversary, meaning that an edge update can depend on previous outputs of the algorithms. We provide the first polynomial improvement over the long-standing $O(\\sqrt{n})$ bound of [Frederickson STOC'83, Eppstein, Galil, Italiano and Nissenzweig FOCS'92] for such type of algorithms. The previously best improvement was $O(\\sqrt{n (\\log\\log n)^2/\\log n})$ [Kejlberg-Rasmussen, Kopelowitz, Petti","authors_text":"Danupon Nanongkai, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T15:33:46Z","title":"Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-\\epsilon})$-Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03745","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:b804b19f59931c1975760584139bd129e0f31fcb3534906574967ab566bf058e","target":"record","created_at":"2026-05-18T00:46:13Z","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":"f50232ec9316637e0918f571402088d7769edc9dcda8f4af03abbdb4fa953b7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T15:33:46Z","title_canon_sha256":"f1eee4ad6e483037872e89df86dcbd9edea3ca39253f5d90e96a026fe20c61e5"},"schema_version":"1.0","source":{"id":"1611.03745","kind":"arxiv","version":2}},"canonical_sha256":"a2f61527971cbf20e4e189236a0b02574b12c8f9a0f948b38b63de0fd5866e57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2f61527971cbf20e4e189236a0b02574b12c8f9a0f948b38b63de0fd5866e57","first_computed_at":"2026-05-18T00:46:13.879151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:13.879151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rf1o1HC3jMu2Ct2bY9xY/JWVpcqsXjCgZA0aLeSMG0POoyGHwjHIAhsIoxJ8TSJbO4z1KPPVniM9f/pVf59RDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:13.879660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b804b19f59931c1975760584139bd129e0f31fcb3534906574967ab566bf058e","sha256:be02f92169c7e28cee5a85f84205513896c4df7da0fcbf7e2fccfe7415124acf"],"state_sha256":"da4b0d862c032f094e8cf07b80c2c4da1e813ba12026b35764825c1fb7d1e5a9"}