{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DHXH6LKZNATVOL7QQQH4ADBRWK","short_pith_number":"pith:DHXH6LKZ","canonical_record":{"source":{"id":"1609.05867","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-19T18:56:06Z","cross_cats_sorted":[],"title_canon_sha256":"49b064efda555243c11b9c114dc9f79dbf6d38800ad4577dec8f6bc61d9e4025","abstract_canon_sha256":"a99380e4efa9fdaecb82d4d747e281dfe8c73e3165e3f21b48228e2d1e14c210"},"schema_version":"1.0"},"canonical_sha256":"19ee7f2d596827572ff0840fc00c31b29001ca23ce01048adaf8bb3298b86dd8","source":{"kind":"arxiv","id":"1609.05867","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05867","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05867v4","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05867","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"DHXH6LKZNATV","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"pith_short_16","alias_value":"DHXH6LKZNATVOL7Q","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"pith_short_8","alias_value":"DHXH6LKZ","created_at":"2026-07-05T07:44:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DHXH6LKZNATVOL7QQQH4ADBRWK","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05867","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-19T18:56:06Z","cross_cats_sorted":[],"title_canon_sha256":"49b064efda555243c11b9c114dc9f79dbf6d38800ad4577dec8f6bc61d9e4025","abstract_canon_sha256":"a99380e4efa9fdaecb82d4d747e281dfe8c73e3165e3f21b48228e2d1e14c210"},"schema_version":"1.0"},"canonical_sha256":"19ee7f2d596827572ff0840fc00c31b29001ca23ce01048adaf8bb3298b86dd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:37.638671Z","signature_b64":"EBtCwQIux1oq7l5S/nFiJAkfkyhAMUngWSjyhlTmnjoAsIn2NyY7TRMsggJ3fY22m32T3huR6i9Fg9BAoX7ZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19ee7f2d596827572ff0840fc00c31b29001ca23ce01048adaf8bb3298b86dd8","last_reissued_at":"2026-07-05T07:44:37.638215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:37.638215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05867","source_version":4,"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-07-05T07:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FOuEx4P/rcdQIVNiRocWZa0ZtO8NBosR2H55KgQy/D6fxu/oHN/aUGtnsLFF4cddGTQfh6yr5lHL+14xnWaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T08:10:26.027782Z"},"content_sha256":"85efaf91c2f2761d81500275b4f754c401b3ab574c97c46d78324ef2dcd47839","schema_version":"1.0","event_id":"sha256:85efaf91c2f2761d81500275b4f754c401b3ab574c97c46d78324ef2dcd47839"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DHXH6LKZNATVOL7QQQH4ADBRWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Connectivity in $O(\\log n(\\log\\log n)^2)$ Amortized Expected Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dawei Huang, Mikkel Thorup, Seth Pettie, Shang-En Huang, Tsvi Kopelowitz","submitted_at":"2016-09-19T18:56:06Z","abstract_excerpt":"Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\\log n(\\log\\log n)^2)$ amortized expected update time and $O(\\log n/\\log\\log\\log n)$ worst case query time, which comes very close to the cell probe lower bounds of Patrascu and Demaine (2006) and Patrascu and Thorup (2011)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05867","kind":"arxiv","version":4},"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/1609.05867/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"},"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-07-05T07:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUAjNbvW4b/gVugyMhrh6ervDsYlTi9HKRKGpQxJ/WSbfa4Xy0LtjlAvMGgvJmA1VpYndC0HtBNJTzVVGBysBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T08:10:26.028153Z"},"content_sha256":"1e8bca769802beedfbaa8392c8c7cb15e1094ccf6c3ceba528d6f2b7bdc4572d","schema_version":"1.0","event_id":"sha256:1e8bca769802beedfbaa8392c8c7cb15e1094ccf6c3ceba528d6f2b7bdc4572d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHXH6LKZNATVOL7QQQH4ADBRWK/bundle.json","state_url":"https://pith.science/pith/DHXH6LKZNATVOL7QQQH4ADBRWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHXH6LKZNATVOL7QQQH4ADBRWK/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-07-24T08:10:26Z","links":{"resolver":"https://pith.science/pith/DHXH6LKZNATVOL7QQQH4ADBRWK","bundle":"https://pith.science/pith/DHXH6LKZNATVOL7QQQH4ADBRWK/bundle.json","state":"https://pith.science/pith/DHXH6LKZNATVOL7QQQH4ADBRWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHXH6LKZNATVOL7QQQH4ADBRWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DHXH6LKZNATVOL7QQQH4ADBRWK","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":"a99380e4efa9fdaecb82d4d747e281dfe8c73e3165e3f21b48228e2d1e14c210","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-19T18:56:06Z","title_canon_sha256":"49b064efda555243c11b9c114dc9f79dbf6d38800ad4577dec8f6bc61d9e4025"},"schema_version":"1.0","source":{"id":"1609.05867","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05867","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05867v4","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05867","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"DHXH6LKZNATV","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"pith_short_16","alias_value":"DHXH6LKZNATVOL7Q","created_at":"2026-07-05T07:44:37Z"},{"alias_kind":"pith_short_8","alias_value":"DHXH6LKZ","created_at":"2026-07-05T07:44:37Z"}],"graph_snapshots":[{"event_id":"sha256:1e8bca769802beedfbaa8392c8c7cb15e1094ccf6c3ceba528d6f2b7bdc4572d","target":"graph","created_at":"2026-07-05T07:44:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1609.05867/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\\log n(\\log\\log n)^2)$ amortized expected update time and $O(\\log n/\\log\\log\\log n)$ worst case query time, which comes very close to the cell probe lower bounds of Patrascu and Demaine (2006) and Patrascu and Thorup (2011).","authors_text":"Dawei Huang, Mikkel Thorup, Seth Pettie, Shang-En Huang, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-19T18:56:06Z","title":"Fully Dynamic Connectivity in $O(\\log n(\\log\\log n)^2)$ Amortized Expected Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05867","kind":"arxiv","version":4},"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:85efaf91c2f2761d81500275b4f754c401b3ab574c97c46d78324ef2dcd47839","target":"record","created_at":"2026-07-05T07:44:37Z","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":"a99380e4efa9fdaecb82d4d747e281dfe8c73e3165e3f21b48228e2d1e14c210","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-19T18:56:06Z","title_canon_sha256":"49b064efda555243c11b9c114dc9f79dbf6d38800ad4577dec8f6bc61d9e4025"},"schema_version":"1.0","source":{"id":"1609.05867","kind":"arxiv","version":4}},"canonical_sha256":"19ee7f2d596827572ff0840fc00c31b29001ca23ce01048adaf8bb3298b86dd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19ee7f2d596827572ff0840fc00c31b29001ca23ce01048adaf8bb3298b86dd8","first_computed_at":"2026-07-05T07:44:37.638215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:37.638215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EBtCwQIux1oq7l5S/nFiJAkfkyhAMUngWSjyhlTmnjoAsIn2NyY7TRMsggJ3fY22m32T3huR6i9Fg9BAoX7ZBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:37.638671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05867","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85efaf91c2f2761d81500275b4f754c401b3ab574c97c46d78324ef2dcd47839","sha256:1e8bca769802beedfbaa8392c8c7cb15e1094ccf6c3ceba528d6f2b7bdc4572d"],"state_sha256":"8e0656d6cd11740fc9a6c2e347b33f34ee05c262cdc09b17e2299107bbd98f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMhZeoZqpSas66s2kc398fd0yPTH9RFudx4VxA1JU/2O9flLqi0ph0LuqMDQqomJxGjNigKr2Ks70lVbOnOrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T08:10:26.030372Z","bundle_sha256":"5fb33c1e46d67aab6c7bd4d145a625b16200d33d72cc045da63450837864c005"}}