{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OOGNU2WAHG2J7LKSW6YCXXW4J2","short_pith_number":"pith:OOGNU2WA","schema_version":"1.0","canonical_sha256":"738cda6ac039b49fad52b7b02bdedc4eb318129ac783e59d49f953c7760142b2","source":{"kind":"arxiv","id":"1612.03017","version":1},"attestation_state":"computed","paper":{"title":"Vertex Sparsification in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Harald Raecke","submitted_at":"2016-12-09T13:41:05Z","abstract_excerpt":"Given an unweighted tree $T=(V,E)$ with terminals $K \\subset V$, we show how to obtain a $2$-quality vertex flow and cut sparsifier $H$ with $V_H = K$. We prove that our result is essentially tight by providing a $2-o(1)$ lower-bound on the quality of any cut sparsifier for stars. In addition we give improved results for quasi-bipartite graphs. First, we show how to obtain a $2$-quality flow sparsifier with $V_H = K$ for such graphs. We then consider the other extreme and construct exact sparsifiers of size $O(2^{k})$, when the input graph is unweighted."},"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":"1612.03017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-09T13:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"b94390802f1173e3cb15df788f11ea37a58cb7bf005c79b50a51d41667703e34","abstract_canon_sha256":"c2e14718b48e18d7343e428a89ea1d6b7ae4edfe87d54649807812c75c128fe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:27.668947Z","signature_b64":"/UiyEQbCMFOkWiSn7UgTwzxvWDK3jIpGC17qq+oUbakAyMUIpj0ofOm257JTySpsV3y2MNz8zjS336r5NKV6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"738cda6ac039b49fad52b7b02bdedc4eb318129ac783e59d49f953c7760142b2","last_reissued_at":"2026-05-18T00:55:27.668265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:27.668265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Sparsification in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Harald Raecke","submitted_at":"2016-12-09T13:41:05Z","abstract_excerpt":"Given an unweighted tree $T=(V,E)$ with terminals $K \\subset V$, we show how to obtain a $2$-quality vertex flow and cut sparsifier $H$ with $V_H = K$. We prove that our result is essentially tight by providing a $2-o(1)$ lower-bound on the quality of any cut sparsifier for stars. In addition we give improved results for quasi-bipartite graphs. First, we show how to obtain a $2$-quality flow sparsifier with $V_H = K$ for such graphs. We then consider the other extreme and construct exact sparsifiers of size $O(2^{k})$, when the input graph is unweighted."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03017","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":""},"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":"1612.03017","created_at":"2026-05-18T00:55:27.668387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03017v1","created_at":"2026-05-18T00:55:27.668387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03017","created_at":"2026-05-18T00:55:27.668387+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOGNU2WAHG2J","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOGNU2WAHG2J7LKS","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOGNU2WA","created_at":"2026-05-18T12:30:36.002864+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/OOGNU2WAHG2J7LKSW6YCXXW4J2","json":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2.json","graph_json":"https://pith.science/api/pith-number/OOGNU2WAHG2J7LKSW6YCXXW4J2/graph.json","events_json":"https://pith.science/api/pith-number/OOGNU2WAHG2J7LKSW6YCXXW4J2/events.json","paper":"https://pith.science/paper/OOGNU2WA"},"agent_actions":{"view_html":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2","download_json":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2.json","view_paper":"https://pith.science/paper/OOGNU2WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03017&json=true","fetch_graph":"https://pith.science/api/pith-number/OOGNU2WAHG2J7LKSW6YCXXW4J2/graph.json","fetch_events":"https://pith.science/api/pith-number/OOGNU2WAHG2J7LKSW6YCXXW4J2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2/action/storage_attestation","attest_author":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2/action/author_attestation","sign_citation":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2/action/citation_signature","submit_replication":"https://pith.science/pith/OOGNU2WAHG2J7LKSW6YCXXW4J2/action/replication_record"}},"created_at":"2026-05-18T00:55:27.668387+00:00","updated_at":"2026-05-18T00:55:27.668387+00:00"}