{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:I3X5PLRKMCFZP6YGNWKSMHLTL6","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":"5905c295fd5da0372bccb2c53d86edc52678dae6366ed8044f3dcd7d47f77404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-17T19:51:47Z","title_canon_sha256":"7752b9351bcfa5bd9d53caff8f1ee8eb61af21595d52d2e4fa9386a3910a3cf2"},"schema_version":"1.0","source":{"id":"2004.08432","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08432","created_at":"2026-07-05T01:50:20Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08432v3","created_at":"2026-07-05T01:50:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08432","created_at":"2026-07-05T01:50:20Z"},{"alias_kind":"pith_short_12","alias_value":"I3X5PLRKMCFZ","created_at":"2026-07-05T01:50:20Z"},{"alias_kind":"pith_short_16","alias_value":"I3X5PLRKMCFZP6YG","created_at":"2026-07-05T01:50:20Z"},{"alias_kind":"pith_short_8","alias_value":"I3X5PLRK","created_at":"2026-07-05T01:50:20Z"}],"graph_snapshots":[{"event_id":"sha256:6cb31d71303bfa0f7f86ebd6db4d262d5cbb9ba09ace7704ad2708c7bf91ba9f","target":"graph","created_at":"2026-07-05T01:50:20Z","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/2004.08432/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Designing dynamic graph algorithms against an adaptive adversary is a major goal in the field of dynamic graph algorithms. While a few such algorithms are known for spanning trees, matchings, and single-source shortest paths, very little was known for an important primitive like graph sparsifiers. The challenge is how to approximately preserve so much information about the graph (e.g., all-pairs distances and all cuts) without revealing the algorithms' underlying randomness to the adaptive adversary.\n  In this paper we present the first non-trivial efficient adaptive algorithms for maintaining","authors_text":"Aaron Bernstein, Aaron Sidford, Danupon Nanongkai, He Sun, Jan van den Brand, Maximilian Probst Gutenberg, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08432","kind":"arxiv","version":3},"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:d6f7eb425567fe3d882f2f87f9e784d9bcca65405dc12a87d09c0eae3f19554d","target":"record","created_at":"2026-07-05T01:50:20Z","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":"5905c295fd5da0372bccb2c53d86edc52678dae6366ed8044f3dcd7d47f77404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-17T19:51:47Z","title_canon_sha256":"7752b9351bcfa5bd9d53caff8f1ee8eb61af21595d52d2e4fa9386a3910a3cf2"},"schema_version":"1.0","source":{"id":"2004.08432","kind":"arxiv","version":3}},"canonical_sha256":"46efd7ae2a608b97fb066d95261d735f8615f4d3ce9318ee004208ead968a019","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46efd7ae2a608b97fb066d95261d735f8615f4d3ce9318ee004208ead968a019","first_computed_at":"2026-07-05T01:50:20.602464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:50:20.602464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PHqW7qe0uh8rBNeaBaflJ2mxBXTc4PqGDUBhnLhTWv/JT9IIR/f59Qg+l4A1DuNJjb0nEadHfrTnolfQ1qmpDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:50:20.602860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08432","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6f7eb425567fe3d882f2f87f9e784d9bcca65405dc12a87d09c0eae3f19554d","sha256:6cb31d71303bfa0f7f86ebd6db4d262d5cbb9ba09ace7704ad2708c7bf91ba9f"],"state_sha256":"bf51575748ae53aa356c580a43877a7b02ec5fb43f423372e9914fdf3c065c3f"}