{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XMDBY7HULAHU5RPTLRKUAZY6LX","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":"659c5202b41e63993844ebd9dad149b73ac17864c684983c59c1ea349cfba891","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:41:36Z","title_canon_sha256":"d7b24a93a57518170da5e55ed3679c1ea5abb55c50893dfb0355ce8f4e935e68"},"schema_version":"1.0","source":{"id":"1510.04590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04590","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04590v1","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04590","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"pith_short_12","alias_value":"XMDBY7HULAHU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XMDBY7HULAHU5RPT","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XMDBY7HU","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:aec5756bd1823805b1fed4c40b548c3df4b9dcc4d33c24945b4f091e5ba25d43","target":"graph","created_at":"2026-05-18T01:30:02Z","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 a randomized algorithm for dynamic graph connectivity. With failure probability less than $1/n^c$ (for any constant $c$ we choose), our solution has worst case running time $O(\\log^3 n)$ per edge insertion, $O(\\log^4 n)$ per edge deletion, and $O(\\log n/\\log\\log n)$ per query, where $n$ is the number of vertices. The previous best algorithm has worst case running time $O(\\log^4 n)$ per edge insertion and $O(\\log^5 n)$ per edge deletion. The improvement is made by reducing the randomness used in the previous result, so that we save a $\\log n$ factor in update time.\n  Specifically, \\c","authors_text":"Zhengyu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:41:36Z","title":"An Improved Randomized Data Structure for Dynamic Graph Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04590","kind":"arxiv","version":1},"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:f7817806cc519c85e3135e28ae63300e554d9a0b66bc9d56bed87e2a09e86e64","target":"record","created_at":"2026-05-18T01:30:02Z","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":"659c5202b41e63993844ebd9dad149b73ac17864c684983c59c1ea349cfba891","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:41:36Z","title_canon_sha256":"d7b24a93a57518170da5e55ed3679c1ea5abb55c50893dfb0355ce8f4e935e68"},"schema_version":"1.0","source":{"id":"1510.04590","kind":"arxiv","version":1}},"canonical_sha256":"bb061c7cf4580f4ec5f35c5540671e5dc2a2004ada483365b18c0eeb532bae39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb061c7cf4580f4ec5f35c5540671e5dc2a2004ada483365b18c0eeb532bae39","first_computed_at":"2026-05-18T01:30:02.188911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:02.188911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Us3+IEYH7d3Hq3igMtgETlYuboKZujs8fRokHMzlKjtfz9EyARRbDCNrLQ1ZsZ6H41ayWGjGFC61nFsK2p5xAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:02.189632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7817806cc519c85e3135e28ae63300e554d9a0b66bc9d56bed87e2a09e86e64","sha256:aec5756bd1823805b1fed4c40b548c3df4b9dcc4d33c24945b4f091e5ba25d43"],"state_sha256":"fe93b674a34bec6bde44bcce1397f8000b81530f5013be5cd1ee057fcaf07482"}