{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DQWTNCUX6HXYWO7DLHZKYIFWQU","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":"1af7c0e61cda1055648f7167a1b7078d2270f3a4502db62e48a10582b66415e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T17:31:44Z","title_canon_sha256":"9b8a01f336a4c6def7673d3faef4a78ca61fb075bf6afd397f3fc73d1a9b861d"},"schema_version":"1.0","source":{"id":"2007.07862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07862","created_at":"2026-07-05T01:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07862v1","created_at":"2026-07-05T01:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07862","created_at":"2026-07-05T01:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"DQWTNCUX6HXY","created_at":"2026-07-05T01:19:32Z"},{"alias_kind":"pith_short_16","alias_value":"DQWTNCUX6HXYWO7D","created_at":"2026-07-05T01:19:32Z"},{"alias_kind":"pith_short_8","alias_value":"DQWTNCUX","created_at":"2026-07-05T01:19:32Z"}],"graph_snapshots":[{"event_id":"sha256:937bdde8f7f51cf3c4f2dc169a79a7961a4a454c12337b836fa0bf400cfb0dea","target":"graph","created_at":"2026-07-05T01:19:32Z","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/2007.07862/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether $(1+\\epsilon)$-approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. As a step towards this goal, we study a thresholded version of the problem: for a given parameter $c$, find a smaller graph, which we call connectivity-$c$ mimicking network, which preserves connectivity among $k$ terminals exactly up to the value of $c$. We show that connectivity-$c$ mimicking networks with $O(kc^4)$ edges exist and ca","authors_text":"Bundit Laekhanukit, Daniel Vaz, Mark Sellke, Parinya Chalermsook, Richard Peng, Syamantak Das, Yang P. Liu, Yunbum Kook","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T17:31:44Z","title":"Vertex Sparsification for Edge Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07862","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:0c59f2518bb541a607b9718b3666d72a49214d874ebb799bd7cad3b0f8eb3ee6","target":"record","created_at":"2026-07-05T01:19:32Z","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":"1af7c0e61cda1055648f7167a1b7078d2270f3a4502db62e48a10582b66415e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T17:31:44Z","title_canon_sha256":"9b8a01f336a4c6def7673d3faef4a78ca61fb075bf6afd397f3fc73d1a9b861d"},"schema_version":"1.0","source":{"id":"2007.07862","kind":"arxiv","version":1}},"canonical_sha256":"1c2d368a97f1ef8b3be359f2ac20b68504fb2dab2a6ce546d6bb9d155d53e574","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c2d368a97f1ef8b3be359f2ac20b68504fb2dab2a6ce546d6bb9d155d53e574","first_computed_at":"2026-07-05T01:19:32.864208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:32.864208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3LjHhfx9TKOl+hBvW2dGmtoc/ZxH9vCG8G32wqpLNU8fAbAlEf8ShxJ3KiecjsmcYhqwjmosOPBbZ7BA0Z4Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:32.864619Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.07862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c59f2518bb541a607b9718b3666d72a49214d874ebb799bd7cad3b0f8eb3ee6","sha256:937bdde8f7f51cf3c4f2dc169a79a7961a4a454c12337b836fa0bf400cfb0dea"],"state_sha256":"f4dd8406fa8461f4c4b38e8a9846458131ac46f17b21d2f1e32e054ac2bfe301"}