{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XF7GXYJI4NB7ZEXWPC6WU3THD3","short_pith_number":"pith:XF7GXYJI","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"},"canonical_sha256":"b97e6be128e343fc92f678bd6a6e671eea7f41b91e55ce76f982bc5937851ec3","source":{"kind":"arxiv","id":"1006.4586","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4586","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4586v3","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4586","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"XF7GXYJI4NB7","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XF7GXYJI4NB7ZEXW","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XF7GXYJI","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XF7GXYJI4NB7ZEXWPC6WU3THD3","target":"record","payload":{"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"},"canonical_sha256":"b97e6be128e343fc92f678bd6a6e671eea7f41b91e55ce76f982bc5937851ec3","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"},"source_kind":"arxiv","source_id":"1006.4586","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"St5fGzwBr53o8fSYUrDe4kY+6aICIwat6iA42KxRQ4omBMhpzljkMKjsOHhcGX2nFJ3QZAXJ45Fcb3mtbiZODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:27:05.196605Z"},"content_sha256":"92b65426d3dc0195ffbf812d643c321a8fc6c794f123cf139fec73e4ad82127b","schema_version":"1.0","event_id":"sha256:92b65426d3dc0195ffbf812d643c321a8fc6c794f123cf139fec73e4ad82127b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XF7GXYJI4NB7ZEXWPC6WU3THD3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lEVa1ks8FUteTa/aTrbkyckLKDxAKqK6o04qMQ/Apq3BBFF+aN1Ei7ZVAlp8J5RcSBCHJUFcxw90rfZwu79DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:27:05.196947Z"},"content_sha256":"43441bca0b42f8e7c08f5c71e4d2cb39a7915347f845a957cffbd1f07d277807","schema_version":"1.0","event_id":"sha256:43441bca0b42f8e7c08f5c71e4d2cb39a7915347f845a957cffbd1f07d277807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/bundle.json","state_url":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T04:27:05Z","links":{"resolver":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3","bundle":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/bundle.json","state":"https://pith.science/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XF7GXYJI4NB7ZEXWPC6WU3THD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XF7GXYJI4NB7ZEXWPC6WU3THD3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0b85199943b2b35507be3b7ce35ac282ce9af55e86783c5d56947e468864dbad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T16:43:47Z","title_canon_sha256":"ece54cbd01e6bac02a84075dbe62b5ef55a4f7c639dbde61f20d86989ab7d3b9"},"schema_version":"1.0","source":{"id":"1006.4586","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4586","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4586v3","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4586","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"XF7GXYJI4NB7","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XF7GXYJI4NB7ZEXW","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XF7GXYJI","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:43441bca0b42f8e7c08f5c71e4d2cb39a7915347f845a957cffbd1f07d277807","target":"graph","created_at":"2026-05-18T01:21:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anupam Gupta, Harald Raecke, Inbal Talgam, Kunal Talwar, Matthias Englert, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T16:43:47Z","title":"Vertex Sparsifiers: New Results from Old Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4586","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:92b65426d3dc0195ffbf812d643c321a8fc6c794f123cf139fec73e4ad82127b","target":"record","created_at":"2026-05-18T01:21:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0b85199943b2b35507be3b7ce35ac282ce9af55e86783c5d56947e468864dbad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T16:43:47Z","title_canon_sha256":"ece54cbd01e6bac02a84075dbe62b5ef55a4f7c639dbde61f20d86989ab7d3b9"},"schema_version":"1.0","source":{"id":"1006.4586","kind":"arxiv","version":3}},"canonical_sha256":"b97e6be128e343fc92f678bd6a6e671eea7f41b91e55ce76f982bc5937851ec3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b97e6be128e343fc92f678bd6a6e671eea7f41b91e55ce76f982bc5937851ec3","first_computed_at":"2026-05-18T01:21:23.411207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:23.411207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOJGRqexfrFVhhz0pFQZfJtcmbKTggXTLs/fjmwVQQ+MZ/fzSAVWUnreQusgtx01UCpz8K3Ak6y+Rk0lr/dMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:23.411734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.4586","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92b65426d3dc0195ffbf812d643c321a8fc6c794f123cf139fec73e4ad82127b","sha256:43441bca0b42f8e7c08f5c71e4d2cb39a7915347f845a957cffbd1f07d277807"],"state_sha256":"2c90681fa048de00023d1582ac8dd4f1ed70f8cb56f127f7e864b2eba8697966"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6AkwYMRYH4C1K2L+Zvn9mqcvlqiFbeh+6hJtPj6MIX04JAdvDbcl6M3N/+bK7+1yIRoIh4Od1aAwVPWu+nLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:27:05.198858Z","bundle_sha256":"5fab640b14a2adf41e0da0fde7cadec92de9f14dde39e07065a9c550692f00d1"}}