{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NSZMOQFT3I7UHPAHH4AD6BZ4BO","short_pith_number":"pith:NSZMOQFT","schema_version":"1.0","canonical_sha256":"6cb2c740b3da3f43bc073f003f073c0b95b61e656abccaf5be772a2ebcf5e52e","source":{"kind":"arxiv","id":"2310.07857","version":1},"attestation_state":"computed","paper":{"title":"On $(1+\\varepsilon)$-Approximate Flow Sparsifiers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yu Chen, Zihan Tan","submitted_at":"2023-10-11T19:59:44Z","abstract_excerpt":"Given a large graph $G$ with a subset $|T|=k$ of its vertices called terminals, a quality-$q$ flow sparsifier is a small graph $G'$ that contains $T$ and preserves all multicommodity flows that can be routed between terminals in $T$, to within factor $q$. The problem of constructing flow sparsifiers with good (small) quality and (small) size has been a central problem in graph compression for decades.\n  A natural approach of constructing $O(1)$-quality flow sparsifiers, which was adopted in most previous constructions, is contraction. Andoni, Krauthgamer, and Gupta constructed a sketch of size"},"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":"2310.07857","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-11T19:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"1e042deb46adba9bc11f1e04641022782f55efb87caa1f0bf4706037dbac6dad","abstract_canon_sha256":"9939399dd1e02d047fbca66792a39cf84a75a2da7e6f34e807c95e6d092019f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:57.458789Z","signature_b64":"Xh6O1E1GlpON5cQ5BfE9qwAIBQqkX8HYiM+LrJo9VI2+oz6URmXZWB65CuhT0PTKZCLhQT5hrWj7OtTf1KHsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb2c740b3da3f43bc073f003f073c0b95b61e656abccaf5be772a2ebcf5e52e","last_reissued_at":"2026-07-05T06:59:57.458294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:57.458294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $(1+\\varepsilon)$-Approximate Flow Sparsifiers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yu Chen, Zihan Tan","submitted_at":"2023-10-11T19:59:44Z","abstract_excerpt":"Given a large graph $G$ with a subset $|T|=k$ of its vertices called terminals, a quality-$q$ flow sparsifier is a small graph $G'$ that contains $T$ and preserves all multicommodity flows that can be routed between terminals in $T$, to within factor $q$. The problem of constructing flow sparsifiers with good (small) quality and (small) size has been a central problem in graph compression for decades.\n  A natural approach of constructing $O(1)$-quality flow sparsifiers, which was adopted in most previous constructions, is contraction. Andoni, Krauthgamer, and Gupta constructed a sketch of size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07857","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.07857/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2310.07857","created_at":"2026-07-05T06:59:57.458365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07857v1","created_at":"2026-07-05T06:59:57.458365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07857","created_at":"2026-07-05T06:59:57.458365+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSZMOQFT3I7U","created_at":"2026-07-05T06:59:57.458365+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSZMOQFT3I7UHPAH","created_at":"2026-07-05T06:59:57.458365+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSZMOQFT","created_at":"2026-07-05T06:59:57.458365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25827","citing_title":"Paths and Intersections: Recognizing Outerplanar Metrics","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO","json":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO.json","graph_json":"https://pith.science/api/pith-number/NSZMOQFT3I7UHPAHH4AD6BZ4BO/graph.json","events_json":"https://pith.science/api/pith-number/NSZMOQFT3I7UHPAHH4AD6BZ4BO/events.json","paper":"https://pith.science/paper/NSZMOQFT"},"agent_actions":{"view_html":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO","download_json":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO.json","view_paper":"https://pith.science/paper/NSZMOQFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07857&json=true","fetch_graph":"https://pith.science/api/pith-number/NSZMOQFT3I7UHPAHH4AD6BZ4BO/graph.json","fetch_events":"https://pith.science/api/pith-number/NSZMOQFT3I7UHPAHH4AD6BZ4BO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO/action/storage_attestation","attest_author":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO/action/author_attestation","sign_citation":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO/action/citation_signature","submit_replication":"https://pith.science/pith/NSZMOQFT3I7UHPAHH4AD6BZ4BO/action/replication_record"}},"created_at":"2026-07-05T06:59:57.458365+00:00","updated_at":"2026-07-05T06:59:57.458365+00:00"}