{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2CLDU64YGTNZKTI2HJ75RLWW4Q","short_pith_number":"pith:2CLDU64Y","canonical_record":{"source":{"id":"1310.3252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-11T19:23:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"afb61485fdb8fc9e85e129e422695c3237cefe8a107352d874ccb88c1b3e96ec","abstract_canon_sha256":"69f8b3fdca1d090e5cd1a50803ebacec67cf0d83c01f3d63ee1a45c2cea5ac3e"},"schema_version":"1.0"},"canonical_sha256":"d0963a7b9834db954d1a3a7fd8aed6e4025ac70507bea1757db6df57ff5073da","source":{"kind":"arxiv","id":"1310.3252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3252","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3252v1","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3252","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"2CLDU64YGTNZ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2CLDU64YGTNZKTI2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2CLDU64Y","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2CLDU64YGTNZKTI2HJ75RLWW4Q","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-11T19:23:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"afb61485fdb8fc9e85e129e422695c3237cefe8a107352d874ccb88c1b3e96ec","abstract_canon_sha256":"69f8b3fdca1d090e5cd1a50803ebacec67cf0d83c01f3d63ee1a45c2cea5ac3e"},"schema_version":"1.0"},"canonical_sha256":"d0963a7b9834db954d1a3a7fd8aed6e4025ac70507bea1757db6df57ff5073da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:44.497049Z","signature_b64":"skRoM36MeUl3OiRpZnydSHMuO3GP/JbG7EfXR2woVVYOkJENcTuyIvauxJz0UTy/xFBO0jCdq3D1d5GvhkBKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0963a7b9834db954d1a3a7fd8aed6e4025ac70507bea1757db6df57ff5073da","last_reissued_at":"2026-05-18T03:10:44.496478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:44.496478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3252","source_version":1,"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-18T03:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lar9VSU2CPPqIwwL7moIRJJL7y1oOtO2k19pnRZGS/xRoBM1Uv7l9om1nWy8ziXfm9++ng0I2Z50zLY8wf8qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:30:31.199279Z"},"content_sha256":"ae7db3a49325dbbad040015a7cc52e71a89d0be30061b8a631ddee7bb6b9ecdb","schema_version":"1.0","event_id":"sha256:ae7db3a49325dbbad040015a7cc52e71a89d0be30061b8a631ddee7bb6b9ecdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2CLDU64YGTNZKTI2HJ75RLWW4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards (1+\\epsilon)-Approximate Flow Sparsifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Anupam Gupta, Robert Krauthgamer","submitted_at":"2013-10-11T19:23:21Z","abstract_excerpt":"A useful approach to \"compress\" a large network $G$ is to represent it with a {\\em flow-sparsifier}, i.e., a small network $H$ that supports the same flows as $G$, up to a factor $q \\geq 1$ called the quality of sparsifier. Specifically, we assume the network $G$ contains a set of $k$ terminals $T$, shared with the network $H$, i.e., $T\\subseteq V(G)\\cap V(H)$, and we want $H$ to preserve all multicommodity flows that can be routed between the terminals $T$. The challenge is to construct $H$ that is small.\n  These questions have received a lot of attention in recent years, leading to some know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3252","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"},"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-18T03:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9H8cfp+knmyIud4WUWHnQIwico8QVhWMHrUt7F0U/CSzE5F0vJWTnE1jtbuLfcSGt77B9W2WfMVisDU7ijJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:30:31.200018Z"},"content_sha256":"e533589a2a1d3a9adac002f00cf6143c1ea207f1f2f4e8e53beaf3a77452fbf5","schema_version":"1.0","event_id":"sha256:e533589a2a1d3a9adac002f00cf6143c1ea207f1f2f4e8e53beaf3a77452fbf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q/bundle.json","state_url":"https://pith.science/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q/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-06-11T05:30:31Z","links":{"resolver":"https://pith.science/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q","bundle":"https://pith.science/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q/bundle.json","state":"https://pith.science/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CLDU64YGTNZKTI2HJ75RLWW4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2CLDU64YGTNZKTI2HJ75RLWW4Q","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":"69f8b3fdca1d090e5cd1a50803ebacec67cf0d83c01f3d63ee1a45c2cea5ac3e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-11T19:23:21Z","title_canon_sha256":"afb61485fdb8fc9e85e129e422695c3237cefe8a107352d874ccb88c1b3e96ec"},"schema_version":"1.0","source":{"id":"1310.3252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3252","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3252v1","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3252","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"2CLDU64YGTNZ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2CLDU64YGTNZKTI2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2CLDU64Y","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e533589a2a1d3a9adac002f00cf6143c1ea207f1f2f4e8e53beaf3a77452fbf5","target":"graph","created_at":"2026-05-18T03:10:44Z","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":"A useful approach to \"compress\" a large network $G$ is to represent it with a {\\em flow-sparsifier}, i.e., a small network $H$ that supports the same flows as $G$, up to a factor $q \\geq 1$ called the quality of sparsifier. Specifically, we assume the network $G$ contains a set of $k$ terminals $T$, shared with the network $H$, i.e., $T\\subseteq V(G)\\cap V(H)$, and we want $H$ to preserve all multicommodity flows that can be routed between the terminals $T$. The challenge is to construct $H$ that is small.\n  These questions have received a lot of attention in recent years, leading to some know","authors_text":"Alexandr Andoni, Anupam Gupta, Robert Krauthgamer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-11T19:23:21Z","title":"Towards (1+\\epsilon)-Approximate Flow Sparsifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3252","kind":"arxiv","version":1},"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:ae7db3a49325dbbad040015a7cc52e71a89d0be30061b8a631ddee7bb6b9ecdb","target":"record","created_at":"2026-05-18T03:10:44Z","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":"69f8b3fdca1d090e5cd1a50803ebacec67cf0d83c01f3d63ee1a45c2cea5ac3e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-11T19:23:21Z","title_canon_sha256":"afb61485fdb8fc9e85e129e422695c3237cefe8a107352d874ccb88c1b3e96ec"},"schema_version":"1.0","source":{"id":"1310.3252","kind":"arxiv","version":1}},"canonical_sha256":"d0963a7b9834db954d1a3a7fd8aed6e4025ac70507bea1757db6df57ff5073da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0963a7b9834db954d1a3a7fd8aed6e4025ac70507bea1757db6df57ff5073da","first_computed_at":"2026-05-18T03:10:44.496478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:44.496478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"skRoM36MeUl3OiRpZnydSHMuO3GP/JbG7EfXR2woVVYOkJENcTuyIvauxJz0UTy/xFBO0jCdq3D1d5GvhkBKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:44.497049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae7db3a49325dbbad040015a7cc52e71a89d0be30061b8a631ddee7bb6b9ecdb","sha256:e533589a2a1d3a9adac002f00cf6143c1ea207f1f2f4e8e53beaf3a77452fbf5"],"state_sha256":"30324064d6ef80bfaa776bacf877c59c19f291881851ff9ec7a9da0ef05dba1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eG1QjpiuOy2yrXvhEw3F2vn/qRyYQM8SBD4iQ0+cpnQ+CQH4tVyE+MjeSbSWQ7QDNyLHI6jc7Jm2M8cxvbnVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:30:31.203796Z","bundle_sha256":"9ba1094a64d04274d1ef87f33e3204bef51639cf66dfc906de9475e653b86c87"}}