{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PBCRLUTBTVEIU3AP44IQBI5NA3","short_pith_number":"pith:PBCRLUTB","schema_version":"1.0","canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","source":{"kind":"arxiv","id":"1702.05951","version":3},"attestation_state":"computed","paper":{"title":"Refined Vertex Sparsifiers of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Havana (Inbal) Rika, Robert Krauthgamer","submitted_at":"2017-02-20T12:42:07Z","abstract_excerpt":"We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$ approximates the corresponding one in $G$, up to a factor $q\\geq 1$ that is called the quality. (The case $q=1$ is known also as a mimicking network). We provide new insights about the structure of minimum terminal cuts, leading to new results for cut sparsifiers of planar graphs. Our first contribution identifies a subset of the minimum terminal cuts, which we call e"},"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":"1702.05951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T12:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"c97b895acbf89b8b6a8ef684f1c4a9da8561361d18a2bda01179f36305d37b9b","abstract_canon_sha256":"8f298817ba780b1bcf409868f5fa1acfebabaf06067c0ade5a906644e1b99966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:57.389121Z","signature_b64":"3uXcW6FMaEbaMBgrM/ZUHvi1aLKC5o7oEr5UPr3YNWW9i7XczGxHISXZaNn0pHw5/WkThmmf2cl1wQtQ6/afAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","last_reissued_at":"2026-07-05T00:09:57.388690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:57.388690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refined Vertex Sparsifiers of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Havana (Inbal) Rika, Robert Krauthgamer","submitted_at":"2017-02-20T12:42:07Z","abstract_excerpt":"We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$ approximates the corresponding one in $G$, up to a factor $q\\geq 1$ that is called the quality. (The case $q=1$ is known also as a mimicking network). We provide new insights about the structure of minimum terminal cuts, leading to new results for cut sparsifiers of planar graphs. Our first contribution identifies a subset of the minimum terminal cuts, which we call e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05951","kind":"arxiv","version":3},"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/1702.05951/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":"1702.05951","created_at":"2026-07-05T00:09:57.388750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05951v3","created_at":"2026-07-05T00:09:57.388750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05951","created_at":"2026-07-05T00:09:57.388750+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBCRLUTBTVEI","created_at":"2026-07-05T00:09:57.388750+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBCRLUTBTVEIU3AP","created_at":"2026-07-05T00:09:57.388750+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBCRLUTB","created_at":"2026-07-05T00:09:57.388750+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":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3","json":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3.json","graph_json":"https://pith.science/api/pith-number/PBCRLUTBTVEIU3AP44IQBI5NA3/graph.json","events_json":"https://pith.science/api/pith-number/PBCRLUTBTVEIU3AP44IQBI5NA3/events.json","paper":"https://pith.science/paper/PBCRLUTB"},"agent_actions":{"view_html":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3","download_json":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3.json","view_paper":"https://pith.science/paper/PBCRLUTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05951&json=true","fetch_graph":"https://pith.science/api/pith-number/PBCRLUTBTVEIU3AP44IQBI5NA3/graph.json","fetch_events":"https://pith.science/api/pith-number/PBCRLUTBTVEIU3AP44IQBI5NA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/action/storage_attestation","attest_author":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/action/author_attestation","sign_citation":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/action/citation_signature","submit_replication":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/action/replication_record"}},"created_at":"2026-07-05T00:09:57.388750+00:00","updated_at":"2026-07-05T00:09:57.388750+00:00"}