{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NHAEB6JR2FWV5LDEFJSBKYMDFB","short_pith_number":"pith:NHAEB6JR","canonical_record":{"source":{"id":"1611.02864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-09T09:34:37Z","cross_cats_sorted":[],"title_canon_sha256":"6d7f15092a5ee413883da99e2e0c267eac2d6d084e3ed1b8a780395c935f8979","abstract_canon_sha256":"ff3fda6cb8564dfd5b40d52b49093ead9adbcb9703b1a4db67e23220838370a1"},"schema_version":"1.0"},"canonical_sha256":"69c040f931d16d5eac642a641561832871e574c6d2a29b24d84e164e6839a5a8","source":{"kind":"arxiv","id":"1611.02864","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02864","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02864v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02864","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"NHAEB6JR2FWV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHAEB6JR2FWV5LDE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHAEB6JR","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NHAEB6JR2FWV5LDEFJSBKYMDFB","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-09T09:34:37Z","cross_cats_sorted":[],"title_canon_sha256":"6d7f15092a5ee413883da99e2e0c267eac2d6d084e3ed1b8a780395c935f8979","abstract_canon_sha256":"ff3fda6cb8564dfd5b40d52b49093ead9adbcb9703b1a4db67e23220838370a1"},"schema_version":"1.0"},"canonical_sha256":"69c040f931d16d5eac642a641561832871e574c6d2a29b24d84e164e6839a5a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.505177Z","signature_b64":"Gsukah5U/fg0CLaZ5ylxmhQXVNAwI5/Y3TRkD5lDAiS20rasjbG5X5WjwkL0Ej1J4OIBKZPmcUSXVVDVH24UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c040f931d16d5eac642a641561832871e574c6d2a29b24d84e164e6839a5a8","last_reissued_at":"2026-05-18T00:56:37.504544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.504544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02864","source_version":2,"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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9QDValAmkwTomhwBb7Nj4i7qmtFVbpoZPUBClAAaB0sPW5Shw2do/859Xc71/yGIUrVUliwrXukGi9wxcrLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:38:34.091002Z"},"content_sha256":"8b2be8988d6a3396568b64a9cc156bcec646156518324d600ed2b63bcd484e1d","schema_version":"1.0","event_id":"sha256:8b2be8988d6a3396568b64a9cc156bcec646156518324d600ed2b63bcd484e1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NHAEB6JR2FWV5LDEFJSBKYMDFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen","submitted_at":"2016-11-09T09:34:37Z","abstract_excerpt":"We give a Las Vegas data structure which maintains a minimum spanning forest in an n-vertex edge-weighted dynamic graph undergoing updates consisting of any mixture of edge insertions and deletions. Each update is supported in O(n^{1/2 - c}) expected worst-case time for some constant c > 0 and this worst-case bound holds with probability at least 1 - n^{-d} where d is a constant that can be made arbitrarily large. This is the first data structure achieving an improvement over the O(n^{1/2}) deterministic worst-case update time of Eppstein et al., a bound that has been standing for nearly 25 ye"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02864","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"},"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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64OKGxyJ7B1Cr9WnFB0m02gSNkHHMcrkG/bZfnwB/z7N8sghIOGwEM+xM5kqfVAuvB9xu6Looi2rq6DhiERzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:38:34.091360Z"},"content_sha256":"ba2ec00b710db4c12f9cf362ba0a7ae1b1e0cdcba477be62bdf293481eaeb927","schema_version":"1.0","event_id":"sha256:ba2ec00b710db4c12f9cf362ba0a7ae1b1e0cdcba477be62bdf293481eaeb927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB/bundle.json","state_url":"https://pith.science/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB/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-05T17:38:34Z","links":{"resolver":"https://pith.science/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB","bundle":"https://pith.science/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB/bundle.json","state":"https://pith.science/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHAEB6JR2FWV5LDEFJSBKYMDFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NHAEB6JR2FWV5LDEFJSBKYMDFB","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":"ff3fda6cb8564dfd5b40d52b49093ead9adbcb9703b1a4db67e23220838370a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-09T09:34:37Z","title_canon_sha256":"6d7f15092a5ee413883da99e2e0c267eac2d6d084e3ed1b8a780395c935f8979"},"schema_version":"1.0","source":{"id":"1611.02864","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02864","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02864v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02864","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"NHAEB6JR2FWV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHAEB6JR2FWV5LDE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHAEB6JR","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:ba2ec00b710db4c12f9cf362ba0a7ae1b1e0cdcba477be62bdf293481eaeb927","target":"graph","created_at":"2026-05-18T00:56: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"},"paper":{"abstract_excerpt":"We give a Las Vegas data structure which maintains a minimum spanning forest in an n-vertex edge-weighted dynamic graph undergoing updates consisting of any mixture of edge insertions and deletions. Each update is supported in O(n^{1/2 - c}) expected worst-case time for some constant c > 0 and this worst-case bound holds with probability at least 1 - n^{-d} where d is a constant that can be made arbitrarily large. This is the first data structure achieving an improvement over the O(n^{1/2}) deterministic worst-case update time of Eppstein et al., a bound that has been standing for nearly 25 ye","authors_text":"Christian Wulff-Nilsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-09T09:34:37Z","title":"Fully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02864","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:8b2be8988d6a3396568b64a9cc156bcec646156518324d600ed2b63bcd484e1d","target":"record","created_at":"2026-05-18T00:56: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":"ff3fda6cb8564dfd5b40d52b49093ead9adbcb9703b1a4db67e23220838370a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-09T09:34:37Z","title_canon_sha256":"6d7f15092a5ee413883da99e2e0c267eac2d6d084e3ed1b8a780395c935f8979"},"schema_version":"1.0","source":{"id":"1611.02864","kind":"arxiv","version":2}},"canonical_sha256":"69c040f931d16d5eac642a641561832871e574c6d2a29b24d84e164e6839a5a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c040f931d16d5eac642a641561832871e574c6d2a29b24d84e164e6839a5a8","first_computed_at":"2026-05-18T00:56:37.504544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.504544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gsukah5U/fg0CLaZ5ylxmhQXVNAwI5/Y3TRkD5lDAiS20rasjbG5X5WjwkL0Ej1J4OIBKZPmcUSXVVDVH24UCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.505177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02864","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b2be8988d6a3396568b64a9cc156bcec646156518324d600ed2b63bcd484e1d","sha256:ba2ec00b710db4c12f9cf362ba0a7ae1b1e0cdcba477be62bdf293481eaeb927"],"state_sha256":"253a277e79b6af90488bff4022338ca5b4bd64fda2f997806e099733c79fb685"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQbl93y4rk8iQq2J2vUSvefRVzC7O2nP4u2ZH6Te0mMyZwkOJOSYhrF7imoMKIk8vMGEzEhdmTsXBV6C/lM/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:38:34.093290Z","bundle_sha256":"13b43e2926105d4949cf4871c7656bee0a60ede828b35dd3147bf7ce58234e39"}}