{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C44OA7AWSFU42XJMIZMYSO2SJZ","short_pith_number":"pith:C44OA7AW","schema_version":"1.0","canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","source":{"kind":"arxiv","id":"2304.01600","version":1},"attestation_state":"computed","paper":{"title":"Minimum Cost Flow in the CONGEST Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tijn de Vos","submitted_at":"2023-04-04T07:41:41Z","abstract_excerpt":"We consider the CONGEST model on a network with $n$ nodes, $m$ edges, diameter $D$, and integer costs and capacities bounded by $\\text{poly} n$. In this paper, we show how to find an exact solution to the minimum cost flow problem in $n^{1/2+o(1)}(\\sqrt{n}+D)$ rounds, improving the state of the art algorithm with running time $m^{3/7+o(1)}(\\sqrt nD^{1/4}+D)$ [Forster et al. FOCS 2021], which only holds for the special case of unit capacity graphs. For certain graphs, we achieve even better results. In particular, for planar graphs, expander graphs, $n^{o(1)}$-genus graphs, $n^{o(1)}$-treewidth"},"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":"2304.01600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-04T07:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"8782d778e7db44d2737f449b6b1a963409bd370f4c3e4c93ad092a2f74dfb15b","abstract_canon_sha256":"040182da0619980f865ee30f3c32e5925f792699550c59e5151999af59ace2ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:57:42.356649Z","signature_b64":"rWL8D/NHcK+atBNTSqpm335JPW+fVf4Mz3sgdMAJ/BqWmn8lz9aUHmQxuKI/YHSqUNXhx0skv0FYq0nbVILoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","last_reissued_at":"2026-07-05T05:57:42.356224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:57:42.356224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Cost Flow in the CONGEST Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tijn de Vos","submitted_at":"2023-04-04T07:41:41Z","abstract_excerpt":"We consider the CONGEST model on a network with $n$ nodes, $m$ edges, diameter $D$, and integer costs and capacities bounded by $\\text{poly} n$. In this paper, we show how to find an exact solution to the minimum cost flow problem in $n^{1/2+o(1)}(\\sqrt{n}+D)$ rounds, improving the state of the art algorithm with running time $m^{3/7+o(1)}(\\sqrt nD^{1/4}+D)$ [Forster et al. FOCS 2021], which only holds for the special case of unit capacity graphs. For certain graphs, we achieve even better results. In particular, for planar graphs, expander graphs, $n^{o(1)}$-genus graphs, $n^{o(1)}$-treewidth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01600","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/2304.01600/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":"2304.01600","created_at":"2026-07-05T05:57:42.356279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.01600v1","created_at":"2026-07-05T05:57:42.356279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01600","created_at":"2026-07-05T05:57:42.356279+00:00"},{"alias_kind":"pith_short_12","alias_value":"C44OA7AWSFU4","created_at":"2026-07-05T05:57:42.356279+00:00"},{"alias_kind":"pith_short_16","alias_value":"C44OA7AWSFU42XJM","created_at":"2026-07-05T05:57:42.356279+00:00"},{"alias_kind":"pith_short_8","alias_value":"C44OA7AW","created_at":"2026-07-05T05:57:42.356279+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19898","citing_title":"Distributed Sparsest Cut via Eigenvalue Estimation","ref_index":2015,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ","json":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ.json","graph_json":"https://pith.science/api/pith-number/C44OA7AWSFU42XJMIZMYSO2SJZ/graph.json","events_json":"https://pith.science/api/pith-number/C44OA7AWSFU42XJMIZMYSO2SJZ/events.json","paper":"https://pith.science/paper/C44OA7AW"},"agent_actions":{"view_html":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ","download_json":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ.json","view_paper":"https://pith.science/paper/C44OA7AW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.01600&json=true","fetch_graph":"https://pith.science/api/pith-number/C44OA7AWSFU42XJMIZMYSO2SJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/C44OA7AWSFU42XJMIZMYSO2SJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/action/storage_attestation","attest_author":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/action/author_attestation","sign_citation":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/action/citation_signature","submit_replication":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/action/replication_record"}},"created_at":"2026-07-05T05:57:42.356279+00:00","updated_at":"2026-07-05T05:57:42.356279+00:00"}