{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3BYVEFR54MXE5FV2TLYDFSJBFF","short_pith_number":"pith:3BYVEFR5","schema_version":"1.0","canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","source":{"kind":"arxiv","id":"1711.01370","version":1},"attestation_state":"computed","paper":{"title":"On constant multi-commodity flow-cut gaps for directed minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ario Salmasi, Vijay Sridhar","submitted_at":"2017-11-04T00:38:57Z","abstract_excerpt":"The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \\& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London and Rabinovich \\cite{linial1994geometry} and by Aumann and Rabani \\cite{aumann1998log} that for general $n$-vertex graphs it is bounded by $O(\\log n)$ and the Gupta-Newman-Rabinovich-Sinclair conjecture \\cite{gupta2004cuts} asserts that it is $O(1)$ for any family of graphs that excludes some fixed minor.\n  The flow-cut gap is poorly understood for the case"},"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":"1711.01370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-04T00:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"8346cee66cc9c86fa9f61e7d074bad82025ad4cb64e89ceebfcbbf59c1ea552f","abstract_canon_sha256":"c6723b7be2aa8e84356d5299e81f3fceaf09f0b79206e10ed701f47939de21de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:18.037789Z","signature_b64":"6bRI7vTGn5djr95FsDl3g/nF7mXHON5wFWj8WiWN4FbY34pGe8zFzUCn15GGDxu/Kbgz4J+n+EnAWfCnCI/KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","last_reissued_at":"2026-05-18T00:31:18.037211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:18.037211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On constant multi-commodity flow-cut gaps for directed minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ario Salmasi, Vijay Sridhar","submitted_at":"2017-11-04T00:38:57Z","abstract_excerpt":"The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \\& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London and Rabinovich \\cite{linial1994geometry} and by Aumann and Rabani \\cite{aumann1998log} that for general $n$-vertex graphs it is bounded by $O(\\log n)$ and the Gupta-Newman-Rabinovich-Sinclair conjecture \\cite{gupta2004cuts} asserts that it is $O(1)$ for any family of graphs that excludes some fixed minor.\n  The flow-cut gap is poorly understood for the case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01370","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":"1711.01370","created_at":"2026-05-18T00:31:18.037300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01370v1","created_at":"2026-05-18T00:31:18.037300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01370","created_at":"2026-05-18T00:31:18.037300+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BYVEFR54MXE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BYVEFR54MXE5FV2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BYVEFR5","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03412","citing_title":"Improved Upper Bounds for the Directed Flow-Cut Gap","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF","json":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF.json","graph_json":"https://pith.science/api/pith-number/3BYVEFR54MXE5FV2TLYDFSJBFF/graph.json","events_json":"https://pith.science/api/pith-number/3BYVEFR54MXE5FV2TLYDFSJBFF/events.json","paper":"https://pith.science/paper/3BYVEFR5"},"agent_actions":{"view_html":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF","download_json":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF.json","view_paper":"https://pith.science/paper/3BYVEFR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01370&json=true","fetch_graph":"https://pith.science/api/pith-number/3BYVEFR54MXE5FV2TLYDFSJBFF/graph.json","fetch_events":"https://pith.science/api/pith-number/3BYVEFR54MXE5FV2TLYDFSJBFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/action/storage_attestation","attest_author":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/action/author_attestation","sign_citation":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/action/citation_signature","submit_replication":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/action/replication_record"}},"created_at":"2026-05-18T00:31:18.037300+00:00","updated_at":"2026-05-18T00:31:18.037300+00:00"}