{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UL3BKJ4XDS7SBZHBRERWUCYCK5","short_pith_number":"pith:UL3BKJ4X","schema_version":"1.0","canonical_sha256":"a2f61527971cbf20e4e189236a0b02574b12c8f9a0f948b38b63de0fd5866e57","source":{"kind":"arxiv","id":"1611.03745","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-\\epsilon})$-Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Thatchaphol Saranurak","submitted_at":"2016-11-11T15:33:46Z","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"},"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":"1611.03745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T15:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"f1eee4ad6e483037872e89df86dcbd9edea3ca39253f5d90e96a026fe20c61e5","abstract_canon_sha256":"f50232ec9316637e0918f571402088d7769edc9dcda8f4af03abbdb4fa953b7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:13.879660Z","signature_b64":"Rf1o1HC3jMu2Ct2bY9xY/JWVpcqsXjCgZA0aLeSMG0POoyGHwjHIAhsIoxJ8TSJbO4z1KPPVniM9f/pVf59RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2f61527971cbf20e4e189236a0b02574b12c8f9a0f948b38b63de0fd5866e57","last_reissued_at":"2026-05-18T00:46:13.879151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:13.879151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-\\epsilon})$-Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Thatchaphol Saranurak","submitted_at":"2016-11-11T15:33:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03745","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.03745","created_at":"2026-05-18T00:46:13.879247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03745v2","created_at":"2026-05-18T00:46:13.879247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03745","created_at":"2026-05-18T00:46:13.879247+00:00"},{"alias_kind":"pith_short_12","alias_value":"UL3BKJ4XDS7S","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UL3BKJ4XDS7SBZHB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UL3BKJ4X","created_at":"2026-05-18T12:30:46.583412+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/UL3BKJ4XDS7SBZHBRERWUCYCK5","json":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5.json","graph_json":"https://pith.science/api/pith-number/UL3BKJ4XDS7SBZHBRERWUCYCK5/graph.json","events_json":"https://pith.science/api/pith-number/UL3BKJ4XDS7SBZHBRERWUCYCK5/events.json","paper":"https://pith.science/paper/UL3BKJ4X"},"agent_actions":{"view_html":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5","download_json":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5.json","view_paper":"https://pith.science/paper/UL3BKJ4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03745&json=true","fetch_graph":"https://pith.science/api/pith-number/UL3BKJ4XDS7SBZHBRERWUCYCK5/graph.json","fetch_events":"https://pith.science/api/pith-number/UL3BKJ4XDS7SBZHBRERWUCYCK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5/action/storage_attestation","attest_author":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5/action/author_attestation","sign_citation":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5/action/citation_signature","submit_replication":"https://pith.science/pith/UL3BKJ4XDS7SBZHBRERWUCYCK5/action/replication_record"}},"created_at":"2026-05-18T00:46:13.879247+00:00","updated_at":"2026-05-18T00:46:13.879247+00:00"}