{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3Z5DCXO2OE7SVP5DXYUNOYBPOO","short_pith_number":"pith:3Z5DCXO2","canonical_record":{"source":{"id":"1209.5608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T13:42:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de9af927c8c90c732299faf68d733763598faed3ac33fb5533d23c3f4c7a0dc1","abstract_canon_sha256":"cfd6236ad28d4755ce6311e26a505700d62d7256ca36db80c393d0b10f2054cc"},"schema_version":"1.0"},"canonical_sha256":"de7a315dda713f2abfa3be28d7602f73919237bff957f3284697532ba471da72","source":{"kind":"arxiv","id":"1209.5608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5608","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5608v1","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5608","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"3Z5DCXO2OE7S","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3Z5DCXO2OE7SVP5D","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3Z5DCXO2","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3Z5DCXO2OE7SVP5DXYUNOYBPOO","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T13:42:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de9af927c8c90c732299faf68d733763598faed3ac33fb5533d23c3f4c7a0dc1","abstract_canon_sha256":"cfd6236ad28d4755ce6311e26a505700d62d7256ca36db80c393d0b10f2054cc"},"schema_version":"1.0"},"canonical_sha256":"de7a315dda713f2abfa3be28d7602f73919237bff957f3284697532ba471da72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:48.027135Z","signature_b64":"2V0ctwf7R9xILdcQ3jEhq9VGX1ER0xIf/13mcpmMJnS+WlhIhH02weI91wsSpvfhQFuCGecdm3xOSTAuomB7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7a315dda713f2abfa3be28d7602f73919237bff957f3284697532ba471da72","last_reissued_at":"2026-05-18T03:44:48.026649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:48.026649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5608","source_version":1,"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-05-18T03:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKzVHrvgBXmX8Y9pSMhtSWLZ6hSULzzi2sR5fGusBe30FmoJWSn6CaRpbVmE18+xMvMjwkywcXtT469ZNZquAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:35:24.744538Z"},"content_sha256":"024d566b226d8e5ee6f1e038adc821235c74117de4996e982efed8438f4041de","schema_version":"1.0","event_id":"sha256:024d566b226d8e5ee6f1e038adc821235c74117de4996e982efed8438f4041de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3Z5DCXO2OE7SVP5DXYUNOYBPOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Deterministic Fully-Dynamic Graph Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen","submitted_at":"2012-09-25T13:42:56Z","abstract_excerpt":"We give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports updates (edge insertions/deletions) in $O(\\log^2n/\\log\\log n)$ amortized time and connectivity queries in $O(\\log n/\\log\\log n)$ worst-case time, where $n$ is the number of vertices of the graph. This improves the deterministic data structures of Holm, de Lichtenberg, and Thorup (STOC 1998, J.ACM 2001) and Thorup (STOC 2000) which both have $O(\\log^2n)$ amortized update time and $O(\\log n/\\log\\log n)$ worst-case query time. Our model of computation is the same as that of Thorup, i.e., a pointer m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5608","kind":"arxiv","version":1},"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"},"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-05-18T03:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uiwVp5YKjtoHfgJL4N8f9ngWR1LJZNhW0MHS/NPWSpXXNP2PZj75vpj41F89KMrpPoT95X+1oa8aiTBWDBi2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:35:24.745298Z"},"content_sha256":"47026ba1213581a8dbe66430241f1d6ce76895fa1674865a2499d682ad53e7fc","schema_version":"1.0","event_id":"sha256:47026ba1213581a8dbe66430241f1d6ce76895fa1674865a2499d682ad53e7fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO/bundle.json","state_url":"https://pith.science/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO/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-06-05T19:35:24Z","links":{"resolver":"https://pith.science/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO","bundle":"https://pith.science/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO/bundle.json","state":"https://pith.science/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Z5DCXO2OE7SVP5DXYUNOYBPOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3Z5DCXO2OE7SVP5DXYUNOYBPOO","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":"cfd6236ad28d4755ce6311e26a505700d62d7256ca36db80c393d0b10f2054cc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T13:42:56Z","title_canon_sha256":"de9af927c8c90c732299faf68d733763598faed3ac33fb5533d23c3f4c7a0dc1"},"schema_version":"1.0","source":{"id":"1209.5608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5608","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5608v1","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5608","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"3Z5DCXO2OE7S","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3Z5DCXO2OE7SVP5D","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3Z5DCXO2","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:47026ba1213581a8dbe66430241f1d6ce76895fa1674865a2499d682ad53e7fc","target":"graph","created_at":"2026-05-18T03:44:48Z","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 give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports updates (edge insertions/deletions) in $O(\\log^2n/\\log\\log n)$ amortized time and connectivity queries in $O(\\log n/\\log\\log n)$ worst-case time, where $n$ is the number of vertices of the graph. This improves the deterministic data structures of Holm, de Lichtenberg, and Thorup (STOC 1998, J.ACM 2001) and Thorup (STOC 2000) which both have $O(\\log^2n)$ amortized update time and $O(\\log n/\\log\\log n)$ worst-case query time. Our model of computation is the same as that of Thorup, i.e., a pointer m","authors_text":"Christian Wulff-Nilsen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T13:42:56Z","title":"Faster Deterministic Fully-Dynamic Graph Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5608","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:024d566b226d8e5ee6f1e038adc821235c74117de4996e982efed8438f4041de","target":"record","created_at":"2026-05-18T03:44:48Z","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":"cfd6236ad28d4755ce6311e26a505700d62d7256ca36db80c393d0b10f2054cc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T13:42:56Z","title_canon_sha256":"de9af927c8c90c732299faf68d733763598faed3ac33fb5533d23c3f4c7a0dc1"},"schema_version":"1.0","source":{"id":"1209.5608","kind":"arxiv","version":1}},"canonical_sha256":"de7a315dda713f2abfa3be28d7602f73919237bff957f3284697532ba471da72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de7a315dda713f2abfa3be28d7602f73919237bff957f3284697532ba471da72","first_computed_at":"2026-05-18T03:44:48.026649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:48.026649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2V0ctwf7R9xILdcQ3jEhq9VGX1ER0xIf/13mcpmMJnS+WlhIhH02weI91wsSpvfhQFuCGecdm3xOSTAuomB7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:48.027135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:024d566b226d8e5ee6f1e038adc821235c74117de4996e982efed8438f4041de","sha256:47026ba1213581a8dbe66430241f1d6ce76895fa1674865a2499d682ad53e7fc"],"state_sha256":"7cfb362f3f242a7a1a4ddede894a8bf11246d7a74b886e6738bb7babc5a4bab5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ipg7SIU4ggL1Tpjgf0eTGh1GRs/yAvFsYNfIVE9AK4HdCHt55NeuzcgfRd0jzyDQ4ZgNfnHGFcD35shoU96Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:35:24.750651Z","bundle_sha256":"c8667092f47791d08660e221951f5b39ad26e3e00c3c8981c40d92636a06e5a1"}}