{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GZBV7WEV62QEQ7DKASMPCCUW32","short_pith_number":"pith:GZBV7WEV","schema_version":"1.0","canonical_sha256":"36435fd895f6a0487c6a0498f10a96deacc2a1a0f47d0aa97c4f87e2e2bc9d70","source":{"kind":"arxiv","id":"1702.01136","version":2},"attestation_state":"computed","paper":{"title":"Improved Guarantees for Vertex Sparsification in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Monika Henzinger, Pan Peng","submitted_at":"2017-02-03T19:35:00Z","abstract_excerpt":"Graph Sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. We focus on the following notions:\n  (1) Given a digraph $G=(V,E)$ and terminal vertices $K \\subset V$ with $|K| = k$, a (vertex) reachability sparsifier of $G$ is a digraph $H=(V_H,E_H)$, $K \\subset V_H$ that preserves all reachability information among terminal pairs. In this work we introduce the notion of reachability-preserving minors (RPMs) , i.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.01136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-03T19:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"b7cb8d75854c14e17a0857559e2888fe7474cdb2c06e18d64c594a67e117f305","abstract_canon_sha256":"e0a7a9bf235f7e1d9b50eae431957bd01b6fa6efd2dab87c1b8eb796cc47ce34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:09.695905Z","signature_b64":"jNpAtdRjiyDJitxS3BbxkjYgnwtRpM8jjdgkJ+f4jHLa4YF2YqMpFZpFIkjDLR7uacftJJV3zqWpoaO7+CZABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36435fd895f6a0487c6a0498f10a96deacc2a1a0f47d0aa97c4f87e2e2bc9d70","last_reissued_at":"2026-05-18T00:27:09.695151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:09.695151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Guarantees for Vertex Sparsification in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Monika Henzinger, Pan Peng","submitted_at":"2017-02-03T19:35:00Z","abstract_excerpt":"Graph Sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. We focus on the following notions:\n  (1) Given a digraph $G=(V,E)$ and terminal vertices $K \\subset V$ with $|K| = k$, a (vertex) reachability sparsifier of $G$ is a digraph $H=(V_H,E_H)$, $K \\subset V_H$ that preserves all reachability information among terminal pairs. In this work we introduce the notion of reachability-preserving minors (RPMs) , i.e., "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01136","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":""},"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.01136","created_at":"2026-05-18T00:27:09.695269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01136v2","created_at":"2026-05-18T00:27:09.695269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01136","created_at":"2026-05-18T00:27:09.695269+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZBV7WEV62QE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZBV7WEV62QEQ7DK","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZBV7WEV","created_at":"2026-05-18T12:31:18.294218+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/GZBV7WEV62QEQ7DKASMPCCUW32","json":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32.json","graph_json":"https://pith.science/api/pith-number/GZBV7WEV62QEQ7DKASMPCCUW32/graph.json","events_json":"https://pith.science/api/pith-number/GZBV7WEV62QEQ7DKASMPCCUW32/events.json","paper":"https://pith.science/paper/GZBV7WEV"},"agent_actions":{"view_html":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32","download_json":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32.json","view_paper":"https://pith.science/paper/GZBV7WEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01136&json=true","fetch_graph":"https://pith.science/api/pith-number/GZBV7WEV62QEQ7DKASMPCCUW32/graph.json","fetch_events":"https://pith.science/api/pith-number/GZBV7WEV62QEQ7DKASMPCCUW32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32/action/storage_attestation","attest_author":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32/action/author_attestation","sign_citation":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32/action/citation_signature","submit_replication":"https://pith.science/pith/GZBV7WEV62QEQ7DKASMPCCUW32/action/replication_record"}},"created_at":"2026-05-18T00:27:09.695269+00:00","updated_at":"2026-05-18T00:27:09.695269+00:00"}