{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:E74HMYSOKKITL3736AEGVFNXRD","short_pith_number":"pith:E74HMYSO","schema_version":"1.0","canonical_sha256":"27f876624e529135effbf0086a95b788d0360bb3b269c23c97cfbe4c526d97ac","source":{"kind":"arxiv","id":"2011.15101","version":2},"attestation_state":"computed","paper":{"title":"Vertex Sparsification for Edge Connectivity in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yang P. Liu","submitted_at":"2020-11-30T18:33:16Z","abstract_excerpt":"An important open question in the area of vertex sparsification is whether $(1+\\epsilon)$-approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. The work Chalermsook et al. (SODA 2021) introduced a relaxation called connectivity-$c$ mimicking networks, which asks to construct a vertex sparsifier which preserves connectivity among $k$ terminals exactly up to the value of $c$, and showed applications to dynamic connectivity data structures and survivable network design. We show that connectivity-$c$ mimicking networks with $\\widetilde{O}(kc^3)$ edges exis"},"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":"2011.15101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-30T18:33:16Z","cross_cats_sorted":[],"title_canon_sha256":"ed59b1c19826160b38c4497f2e5545d3f021143320a98f47136cdd0ebdad3ed6","abstract_canon_sha256":"b91dd5aad6862e49eee7fff7924e6e5ecd50f600cbf929ac2bf9106ccb1e8b3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:53.277448Z","signature_b64":"fPC6xtPrLnT70lZnKS4A12nhy2koIWXnLil8+Mb1r2Kjxht7TFdypkMOry3XZ1//Qv9a4kXZwMkcm+G6F1scAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27f876624e529135effbf0086a95b788d0360bb3b269c23c97cfbe4c526d97ac","last_reissued_at":"2026-07-05T02:06:53.277001Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:53.277001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Sparsification for Edge Connectivity in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yang P. Liu","submitted_at":"2020-11-30T18:33:16Z","abstract_excerpt":"An important open question in the area of vertex sparsification is whether $(1+\\epsilon)$-approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. The work Chalermsook et al. (SODA 2021) introduced a relaxation called connectivity-$c$ mimicking networks, which asks to construct a vertex sparsifier which preserves connectivity among $k$ terminals exactly up to the value of $c$, and showed applications to dynamic connectivity data structures and survivable network design. We show that connectivity-$c$ mimicking networks with $\\widetilde{O}(kc^3)$ edges exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.15101","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.15101/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":"2011.15101","created_at":"2026-07-05T02:06:53.277058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.15101v2","created_at":"2026-07-05T02:06:53.277058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.15101","created_at":"2026-07-05T02:06:53.277058+00:00"},{"alias_kind":"pith_short_12","alias_value":"E74HMYSOKKIT","created_at":"2026-07-05T02:06:53.277058+00:00"},{"alias_kind":"pith_short_16","alias_value":"E74HMYSOKKITL373","created_at":"2026-07-05T02:06:53.277058+00:00"},{"alias_kind":"pith_short_8","alias_value":"E74HMYSO","created_at":"2026-07-05T02:06:53.277058+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25827","citing_title":"Paths and Intersections: Recognizing Outerplanar Metrics","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD","json":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD.json","graph_json":"https://pith.science/api/pith-number/E74HMYSOKKITL3736AEGVFNXRD/graph.json","events_json":"https://pith.science/api/pith-number/E74HMYSOKKITL3736AEGVFNXRD/events.json","paper":"https://pith.science/paper/E74HMYSO"},"agent_actions":{"view_html":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD","download_json":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD.json","view_paper":"https://pith.science/paper/E74HMYSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.15101&json=true","fetch_graph":"https://pith.science/api/pith-number/E74HMYSOKKITL3736AEGVFNXRD/graph.json","fetch_events":"https://pith.science/api/pith-number/E74HMYSOKKITL3736AEGVFNXRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD/action/storage_attestation","attest_author":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD/action/author_attestation","sign_citation":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD/action/citation_signature","submit_replication":"https://pith.science/pith/E74HMYSOKKITL3736AEGVFNXRD/action/replication_record"}},"created_at":"2026-07-05T02:06:53.277058+00:00","updated_at":"2026-07-05T02:06:53.277058+00:00"}