{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DQWTNCUX6HXYWO7DLHZKYIFWQU","short_pith_number":"pith:DQWTNCUX","schema_version":"1.0","canonical_sha256":"1c2d368a97f1ef8b3be359f2ac20b68504fb2dab2a6ce546d6bb9d155d53e574","source":{"kind":"arxiv","id":"2007.07862","version":1},"attestation_state":"computed","paper":{"title":"Vertex Sparsification for Edge Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Mark Sellke, Parinya Chalermsook, Richard Peng, Syamantak Das, Yang P. Liu, Yunbum Kook","submitted_at":"2020-07-15T17:31:44Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2007.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T17:31:44Z","cross_cats_sorted":[],"title_canon_sha256":"9b8a01f336a4c6def7673d3faef4a78ca61fb075bf6afd397f3fc73d1a9b861d","abstract_canon_sha256":"1af7c0e61cda1055648f7167a1b7078d2270f3a4502db62e48a10582b66415e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:32.864619Z","signature_b64":"m3LjHhfx9TKOl+hBvW2dGmtoc/ZxH9vCG8G32wqpLNU8fAbAlEf8ShxJ3KiecjsmcYhqwjmosOPBbZ7BA0Z4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c2d368a97f1ef8b3be359f2ac20b68504fb2dab2a6ce546d6bb9d155d53e574","last_reissued_at":"2026-07-05T01:19:32.864208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:32.864208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Sparsification for Edge Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Mark Sellke, Parinya Chalermsook, Richard Peng, Syamantak Das, Yang P. Liu, Yunbum Kook","submitted_at":"2020-07-15T17:31:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07862","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.07862/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.07862","created_at":"2026-07-05T01:19:32.864270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.07862v1","created_at":"2026-07-05T01:19:32.864270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07862","created_at":"2026-07-05T01:19:32.864270+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQWTNCUX6HXY","created_at":"2026-07-05T01:19:32.864270+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQWTNCUX6HXYWO7D","created_at":"2026-07-05T01:19:32.864270+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQWTNCUX","created_at":"2026-07-05T01:19:32.864270+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU","json":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU.json","graph_json":"https://pith.science/api/pith-number/DQWTNCUX6HXYWO7DLHZKYIFWQU/graph.json","events_json":"https://pith.science/api/pith-number/DQWTNCUX6HXYWO7DLHZKYIFWQU/events.json","paper":"https://pith.science/paper/DQWTNCUX"},"agent_actions":{"view_html":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU","download_json":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU.json","view_paper":"https://pith.science/paper/DQWTNCUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.07862&json=true","fetch_graph":"https://pith.science/api/pith-number/DQWTNCUX6HXYWO7DLHZKYIFWQU/graph.json","fetch_events":"https://pith.science/api/pith-number/DQWTNCUX6HXYWO7DLHZKYIFWQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU/action/storage_attestation","attest_author":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU/action/author_attestation","sign_citation":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU/action/citation_signature","submit_replication":"https://pith.science/pith/DQWTNCUX6HXYWO7DLHZKYIFWQU/action/replication_record"}},"created_at":"2026-07-05T01:19:32.864270+00:00","updated_at":"2026-07-05T01:19:32.864270+00:00"}