{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CCZYEPSVNWUU6PCMR7OBCRS6QC","short_pith_number":"pith:CCZYEPSV","canonical_record":{"source":{"id":"1708.03962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-13T19:59:20Z","cross_cats_sorted":[],"title_canon_sha256":"8d3785ce9cc6a12105411b56fa1e1dc28bef62c288a82f22142a08ce58b27b20","abstract_canon_sha256":"78a6a20174a769aa41dbceb9cb850d42fc0dc012104281f27f72ad026d277b43"},"schema_version":"1.0"},"canonical_sha256":"10b3823e556da94f3c4c8fdc11465e80b91f8cde251df4fc81f1cb6392107249","source":{"kind":"arxiv","id":"1708.03962","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03962","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03962v2","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03962","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"CCZYEPSVNWUU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CCZYEPSVNWUU6PCM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CCZYEPSV","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CCZYEPSVNWUU6PCMR7OBCRS6QC","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-13T19:59:20Z","cross_cats_sorted":[],"title_canon_sha256":"8d3785ce9cc6a12105411b56fa1e1dc28bef62c288a82f22142a08ce58b27b20","abstract_canon_sha256":"78a6a20174a769aa41dbceb9cb850d42fc0dc012104281f27f72ad026d277b43"},"schema_version":"1.0"},"canonical_sha256":"10b3823e556da94f3c4c8fdc11465e80b91f8cde251df4fc81f1cb6392107249","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.912483Z","signature_b64":"ddNYKUTi6J1AOESUU+Avcr3TY0cAH4vgR5+qWfpSROPEdUrj6QQLrpBpomcJIpbPtFP5NpW2lORiu5dqkJ0bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10b3823e556da94f3c4c8fdc11465e80b91f8cde251df4fc81f1cb6392107249","last_reissued_at":"2026-05-18T00:37:59.911949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.911949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03962","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:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ue/Ihm1/k03c04B7HXUcoU/ehfk9oTUEbJHG5vzPMBYR/uOfuNS37sb7nslb9HuACaNKq9i3vpv5d5RdcuOcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:33:04.095769Z"},"content_sha256":"bbfb47239ca7bf068e252ed95d4ca0ca35ecb9c390410ded8af70282c4da568f","schema_version":"1.0","event_id":"sha256:bbfb47239ca7bf068e252ed95d4ca0ca35ecb9c390410ded8af70282c4da568f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CCZYEPSVNWUU6PCMR7OBCRS6QC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Minimum Spanning Forest with Subpolynomial 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, Danupon Nanongkai, Thatchaphol Saranurak","submitted_at":"2017-08-13T19:59:20Z","abstract_excerpt":"We present a Las Vegas algorithm for dynamically maintaining a minimum spanning forest of an $n$-node graph undergoing edge insertions and deletions. Our algorithm guarantees an $O(n^{o(1)})$ worst-case update time with high probability. This significantly improves the two recent Las Vegas algorithms by Wulff-Nilsen [STOC'17] with update time $O(n^{0.5-\\epsilon})$ for some constant $\\epsilon>0$ and, independently, by Nanongkai and Saranurak [STOC'17] with update time $O(n^{0.494})$ (the latter works only for maintaining a spanning forest).\n  Our result is obtained by identifying the common fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03962","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:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE8IIug70dE8Pt16Y9rVw+5qzNPj5GCQM40hsGnDhrXgtURkkek9Uw13Q5rI2NQTpThAMn+V7aAzUzA9VOijCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:33:04.096405Z"},"content_sha256":"58b1d6d5f98e030b1d9f2ae947844571e16986af69ec9e8a9ef97283fe4cafe6","schema_version":"1.0","event_id":"sha256:58b1d6d5f98e030b1d9f2ae947844571e16986af69ec9e8a9ef97283fe4cafe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC/bundle.json","state_url":"https://pith.science/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC/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-05-28T06:33:04Z","links":{"resolver":"https://pith.science/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC","bundle":"https://pith.science/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC/bundle.json","state":"https://pith.science/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCZYEPSVNWUU6PCMR7OBCRS6QC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CCZYEPSVNWUU6PCMR7OBCRS6QC","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":"78a6a20174a769aa41dbceb9cb850d42fc0dc012104281f27f72ad026d277b43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-13T19:59:20Z","title_canon_sha256":"8d3785ce9cc6a12105411b56fa1e1dc28bef62c288a82f22142a08ce58b27b20"},"schema_version":"1.0","source":{"id":"1708.03962","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03962","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03962v2","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03962","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"CCZYEPSVNWUU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CCZYEPSVNWUU6PCM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CCZYEPSV","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:58b1d6d5f98e030b1d9f2ae947844571e16986af69ec9e8a9ef97283fe4cafe6","target":"graph","created_at":"2026-05-18T00:37:59Z","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 Las Vegas algorithm for dynamically maintaining a minimum spanning forest of an $n$-node graph undergoing edge insertions and deletions. Our algorithm guarantees an $O(n^{o(1)})$ worst-case update time with high probability. This significantly improves the two recent Las Vegas algorithms by Wulff-Nilsen [STOC'17] with update time $O(n^{0.5-\\epsilon})$ for some constant $\\epsilon>0$ and, independently, by Nanongkai and Saranurak [STOC'17] with update time $O(n^{0.494})$ (the latter works only for maintaining a spanning forest).\n  Our result is obtained by identifying the common fra","authors_text":"Christian Wulff-Nilsen, Danupon Nanongkai, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-13T19:59:20Z","title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03962","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:bbfb47239ca7bf068e252ed95d4ca0ca35ecb9c390410ded8af70282c4da568f","target":"record","created_at":"2026-05-18T00:37:59Z","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":"78a6a20174a769aa41dbceb9cb850d42fc0dc012104281f27f72ad026d277b43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-13T19:59:20Z","title_canon_sha256":"8d3785ce9cc6a12105411b56fa1e1dc28bef62c288a82f22142a08ce58b27b20"},"schema_version":"1.0","source":{"id":"1708.03962","kind":"arxiv","version":2}},"canonical_sha256":"10b3823e556da94f3c4c8fdc11465e80b91f8cde251df4fc81f1cb6392107249","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10b3823e556da94f3c4c8fdc11465e80b91f8cde251df4fc81f1cb6392107249","first_computed_at":"2026-05-18T00:37:59.911949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.911949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddNYKUTi6J1AOESUU+Avcr3TY0cAH4vgR5+qWfpSROPEdUrj6QQLrpBpomcJIpbPtFP5NpW2lORiu5dqkJ0bBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.912483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03962","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbfb47239ca7bf068e252ed95d4ca0ca35ecb9c390410ded8af70282c4da568f","sha256:58b1d6d5f98e030b1d9f2ae947844571e16986af69ec9e8a9ef97283fe4cafe6"],"state_sha256":"66317b7839adf736b804ece7e1fe50a3dd01042e72d78b13362a6a9216063f39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYViY1wD6huP5/M16DoCVHQECK6xxLgcmGSDuf74ln7bapdKBKmdk75P9c9Tl8Scx7qDLcVCGc53YMQh41+QDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:33:04.099329Z","bundle_sha256":"b4d87294f2652efc0a8aa88142f98b706f60fc01cbe291b3144d8568345bfaad"}}