{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RUWZK2LJG7DE7N4K3EU7BNB2GH","short_pith_number":"pith:RUWZK2LJ","canonical_record":{"source":{"id":"1604.02094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T18:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"f3a7dee4e8006b3612b2fd4e56b74f3b93e058794acc20a78a279b80304095d5","abstract_canon_sha256":"dca62ebda4dbbbf9e51e0f12d76cbe1656c539ecda81335b404a4be13f87ad0f"},"schema_version":"1.0"},"canonical_sha256":"8d2d95696937c64fb78ad929f0b43a31f541d1121db51ab6c2a8d7541be7f2dc","source":{"kind":"arxiv","id":"1604.02094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02094","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02094v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02094","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"RUWZK2LJG7DE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RUWZK2LJG7DE7N4K","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RUWZK2LJ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RUWZK2LJG7DE7N4K3EU7BNB2GH","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T18:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"f3a7dee4e8006b3612b2fd4e56b74f3b93e058794acc20a78a279b80304095d5","abstract_canon_sha256":"dca62ebda4dbbbf9e51e0f12d76cbe1656c539ecda81335b404a4be13f87ad0f"},"schema_version":"1.0"},"canonical_sha256":"8d2d95696937c64fb78ad929f0b43a31f541d1121db51ab6c2a8d7541be7f2dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.490510Z","signature_b64":"clrAxzdfuKqsCF2jhmn+1plm5Wr6XKs/6/2ZWry03/ylS3GnVVvpo6NGJ1R2o5VOWJ8LnJAnVMnD7cyO+lRHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d2d95696937c64fb78ad929f0b43a31f541d1121db51ab6c2a8d7541be7f2dc","last_reissued_at":"2026-05-18T00:22:16.489772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.489772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02094","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2Nj6LkKiCA2QM/rnDxhKhNAD7k32pIbmbBLXr8yPA8oG3LFFFx/vTNKxpcU5YrWZCjlnH+Y9s2kd2wD12UUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:08:38.099001Z"},"content_sha256":"6675c34b179f5ce717cafb97de17a448a21d0b7bced63c8ad447f06ef7ff5b7d","schema_version":"1.0","event_id":"sha256:6675c34b179f5ce717cafb97de17a448a21d0b7bced63c8ad447f06ef7ff5b7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RUWZK2LJG7DE7N4K3EU7BNB2GH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Fully Dynamic Graph Sparsifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Durfee, Ioannis Koutis, Ittai Abraham, Richard Peng, Sebastian Krinninger","submitted_at":"2016-04-07T18:06:49Z","abstract_excerpt":"We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic time after each update in the graph. Our three main results are as follows. First, we give a fully dynamic algorithm for maintaining a $ (1 \\pm \\epsilon) $-spectral sparsifier with amortized update time $poly(\\log{n}, \\epsilon^{-1})$. Second, we give a fully dynamic algorithm for maintaining a $ (1 \\pm \\epsilon) $-cut sparsifier with \\emph{worst-case} update time $poly(\\log{n}, \\epsilon^{-1})$. Both sparsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02094","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IeGtgWx42ucDRTEyk/vLGnfpS3gPAQgrlcp9yb2OkxjZn+e5eQBLA/eoPmKTmnSPTqH/Oyb3e8hwvXXJspwbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:08:38.099356Z"},"content_sha256":"0a2ecdb0968244606c3b1e143447714c3a868efb3feaf023dd2f087948b650e9","schema_version":"1.0","event_id":"sha256:0a2ecdb0968244606c3b1e143447714c3a868efb3feaf023dd2f087948b650e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH/bundle.json","state_url":"https://pith.science/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH/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-30T18:08:38Z","links":{"resolver":"https://pith.science/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH","bundle":"https://pith.science/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH/bundle.json","state":"https://pith.science/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUWZK2LJG7DE7N4K3EU7BNB2GH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RUWZK2LJG7DE7N4K3EU7BNB2GH","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":"dca62ebda4dbbbf9e51e0f12d76cbe1656c539ecda81335b404a4be13f87ad0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T18:06:49Z","title_canon_sha256":"f3a7dee4e8006b3612b2fd4e56b74f3b93e058794acc20a78a279b80304095d5"},"schema_version":"1.0","source":{"id":"1604.02094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02094","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02094v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02094","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"RUWZK2LJG7DE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RUWZK2LJG7DE7N4K","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RUWZK2LJ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:0a2ecdb0968244606c3b1e143447714c3a868efb3feaf023dd2f087948b650e9","target":"graph","created_at":"2026-05-18T00:22:16Z","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 initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic time after each update in the graph. Our three main results are as follows. First, we give a fully dynamic algorithm for maintaining a $ (1 \\pm \\epsilon) $-spectral sparsifier with amortized update time $poly(\\log{n}, \\epsilon^{-1})$. Second, we give a fully dynamic algorithm for maintaining a $ (1 \\pm \\epsilon) $-cut sparsifier with \\emph{worst-case} update time $poly(\\log{n}, \\epsilon^{-1})$. Both sparsi","authors_text":"David Durfee, Ioannis Koutis, Ittai Abraham, Richard Peng, Sebastian Krinninger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T18:06:49Z","title":"On Fully Dynamic Graph Sparsifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02094","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:6675c34b179f5ce717cafb97de17a448a21d0b7bced63c8ad447f06ef7ff5b7d","target":"record","created_at":"2026-05-18T00:22:16Z","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":"dca62ebda4dbbbf9e51e0f12d76cbe1656c539ecda81335b404a4be13f87ad0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T18:06:49Z","title_canon_sha256":"f3a7dee4e8006b3612b2fd4e56b74f3b93e058794acc20a78a279b80304095d5"},"schema_version":"1.0","source":{"id":"1604.02094","kind":"arxiv","version":2}},"canonical_sha256":"8d2d95696937c64fb78ad929f0b43a31f541d1121db51ab6c2a8d7541be7f2dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d2d95696937c64fb78ad929f0b43a31f541d1121db51ab6c2a8d7541be7f2dc","first_computed_at":"2026-05-18T00:22:16.489772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.489772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"clrAxzdfuKqsCF2jhmn+1plm5Wr6XKs/6/2ZWry03/ylS3GnVVvpo6NGJ1R2o5VOWJ8LnJAnVMnD7cyO+lRHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.490510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6675c34b179f5ce717cafb97de17a448a21d0b7bced63c8ad447f06ef7ff5b7d","sha256:0a2ecdb0968244606c3b1e143447714c3a868efb3feaf023dd2f087948b650e9"],"state_sha256":"9edca9a066defed7d2197f3236717601ee99e66fae6c1d58ea00e825bf8a98ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxB2d/hca+Pi0MiRYvz7nky53hfaVeGoflPgYnQJzjwVpRCg0RdHgPKDnzDZyaCGTSu8fjCHT3PrLmkrETWyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:08:38.101942Z","bundle_sha256":"be9093128d910cda4ab491cf79a0fbfad3116fd5efc354a677c44fc038b41a2b"}}