{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PJAB6F4ISOB7Q5DQMBKXAEDZIR","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":"97dbe4905a58a0a81b612e7034563a2fb2d45645ef6f2473b1589b6d6d2fa41b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-05T17:52:01Z","title_canon_sha256":"c4e29be21b9605662103bc94d7e2fb708bd0a7409a6200bca6d3faabdb0f238a"},"schema_version":"1.0","source":{"id":"2005.02368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.02368","created_at":"2026-07-05T01:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"2005.02368v1","created_at":"2026-07-05T01:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.02368","created_at":"2026-07-05T01:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"PJAB6F4ISOB7","created_at":"2026-07-05T01:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"PJAB6F4ISOB7Q5DQ","created_at":"2026-07-05T01:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"PJAB6F4I","created_at":"2026-07-05T01:00:25Z"}],"graph_snapshots":[{"event_id":"sha256:2ee26058c3ee9fa77e8dae58112a84ed0236d91a6028593226052e4dd289a2a2","target":"graph","created_at":"2026-07-05T01:00:25Z","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/2005.02368/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a general framework of designing efficient dynamic approximate algorithms for optimization on undirected graphs. In particular, we develop a technique that, given any problem that admits a certain notion of vertex sparsifiers, gives data structures that maintain approximate solutions in sub-linear update and query time. We illustrate the applicability of our paradigm to the following problems.\n  (1) A fully-dynamic algorithm that approximates all-pair maximum-flows/minimum-cuts up to a nearly logarithmic factor in $\\tilde{O}(n^{2/3})$ amortized time against an oblivious adversary, a","authors_text":"Gramoz Goranci, Li Chen, Monika Henzinger, Richard Peng, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-05T17:52:01Z","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.02368","kind":"arxiv","version":1},"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:4dc9190cf40848cc24739cdc32b2cb9733a1f6dd76217a2688ddc1347c46ec70","target":"record","created_at":"2026-07-05T01:00:25Z","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":"97dbe4905a58a0a81b612e7034563a2fb2d45645ef6f2473b1589b6d6d2fa41b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-05T17:52:01Z","title_canon_sha256":"c4e29be21b9605662103bc94d7e2fb708bd0a7409a6200bca6d3faabdb0f238a"},"schema_version":"1.0","source":{"id":"2005.02368","kind":"arxiv","version":1}},"canonical_sha256":"7a401f17889383f87470605570107944706f184d5e8d78fda43e93329a65fab4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a401f17889383f87470605570107944706f184d5e8d78fda43e93329a65fab4","first_computed_at":"2026-07-05T01:00:25.220601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:00:25.220601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qettHKWMIeVTYhZwzlvSAOOWnuJSJKUbIslDjG5tDw6Zx0XBkBOJ8QOkGlsDGfot2HYE/SrxF2CL0hg6hUVnAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:00:25.220992Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.02368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc9190cf40848cc24739cdc32b2cb9733a1f6dd76217a2688ddc1347c46ec70","sha256:2ee26058c3ee9fa77e8dae58112a84ed0236d91a6028593226052e4dd289a2a2"],"state_sha256":"66516ea1bdd3e63db70ce94eb268ddfe737d4a2fa2f63fd03f2b1321ac183ff9"}