{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XF7GXYJI4NB7ZEXWPC6WU3THD3","short_pith_number":"pith:XF7GXYJI","schema_version":"1.0","canonical_sha256":"b97e6be128e343fc92f678bd6a6e671eea7f41b91e55ce76f982bc5937851ec3","source":{"kind":"arxiv","id":"1006.4586","version":3},"attestation_state":"computed","paper":{"title":"Vertex Sparsifiers: New Results from Old Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Harald Raecke, Inbal Talgam, Kunal Talwar, Matthias Englert, Robert Krauthgamer","submitted_at":"2010-06-23T16:43:47Z","abstract_excerpt":"Given a capacitated graph $G = (V,E)$ and a set of terminals $K \\subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and vice versa? (Such a graph $H$ is called a flow-sparsifier for $G$.) What if we want $H$ to be a \"simple\" graph? What if we allow $H$ to be a convex combination of simple graphs?\n  Improving on results of Moitra [FOCS 2009] and Leighton and Moitra [STOC 2010], we give efficient algorithms for constructing: (a) a flow-sparsifier $H$ that maintain"},"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":"1006.4586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T16:43:47Z","cross_cats_sorted":[],"title_canon_sha256":"ece54cbd01e6bac02a84075dbe62b5ef55a4f7c639dbde61f20d86989ab7d3b9","abstract_canon_sha256":"0b85199943b2b35507be3b7ce35ac282ce9af55e86783c5d56947e468864dbad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:23.411734Z","signature_b64":"ZOJGRqexfrFVhhz0pFQZfJtcmbKTggXTLs/fjmwVQQ+MZ/fzSAVWUnreQusgtx01UCpz8K3Ak6y+Rk0lr/dMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b97e6be128e343fc92f678bd6a6e671eea7f41b91e55ce76f982bc5937851ec3","last_reissued_at":"2026-05-18T01:21:23.411207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:23.411207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Sparsifiers: New Results from Old Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Harald Raecke, Inbal Talgam, Kunal Talwar, Matthias Englert, Robert Krauthgamer","submitted_at":"2010-06-23T16:43:47Z","abstract_excerpt":"Given a capacitated graph $G = (V,E)$ and a set of terminals $K \\subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and vice versa? (Such a graph $H$ is called a flow-sparsifier for $G$.) What if we want $H$ to be a \"simple\" graph? What if we allow $H$ to be a convex combination of simple graphs?\n  Improving on results of Moitra [FOCS 2009] and Leighton and Moitra [STOC 2010], we give efficient algorithms for constructing: (a) a flow-sparsifier $H$ that maintain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4586","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":""},"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":"1006.4586","created_at":"2026-05-18T01:21:23.411294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.4586v3","created_at":"2026-05-18T01:21:23.411294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4586","created_at":"2026-05-18T01:21:23.411294+00:00"},{"alias_kind":"pith_short_12","alias_value":"XF7GXYJI4NB7","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XF7GXYJI4NB7ZEXW","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XF7GXYJI","created_at":"2026-05-18T12:26:17.028572+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/XF7GXYJI4NB7ZEXWPC6WU3THD3","json":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3.json","graph_json":"https://pith.science/api/pith-number/XF7GXYJI4NB7ZEXWPC6WU3THD3/graph.json","events_json":"https://pith.science/api/pith-number/XF7GXYJI4NB7ZEXWPC6WU3THD3/events.json","paper":"https://pith.science/paper/XF7GXYJI"},"agent_actions":{"view_html":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3","download_json":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3.json","view_paper":"https://pith.science/paper/XF7GXYJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.4586&json=true","fetch_graph":"https://pith.science/api/pith-number/XF7GXYJI4NB7ZEXWPC6WU3THD3/graph.json","fetch_events":"https://pith.science/api/pith-number/XF7GXYJI4NB7ZEXWPC6WU3THD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/action/storage_attestation","attest_author":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/action/author_attestation","sign_citation":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/action/citation_signature","submit_replication":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/action/replication_record"}},"created_at":"2026-05-18T01:21:23.411294+00:00","updated_at":"2026-05-18T01:21:23.411294+00:00"}