{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GSVLJKFH3K6CFP5M3NMQNLEWZ7","short_pith_number":"pith:GSVLJKFH","schema_version":"1.0","canonical_sha256":"34aab4a8a7dabc22bfacdb5906ac96cfe5a2dcd4f6aa57bd85ff8991f36b34b1","source":{"kind":"arxiv","id":"1907.02274","version":1},"attestation_state":"computed","paper":{"title":"Min-Cost Flow in Unit-Capacity Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Piotr Sankowski","submitted_at":"2019-07-04T08:35:02Z","abstract_excerpt":"In this paper we give an $\\widetilde{O}((nm)^{2/3}\\log C)$ time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity planar multigraphs where edge costs are integers bounded by $C$. For planar multigraphs, this improves upon the best known algorithms for general graphs: the $\\widetilde{O}(m^{10/7}\\log C)$ time algorithm of Cohen et al. [SODA 2017], the $O(m^{3/2}\\log(nC))$ time algorithm of Gabow and Tarjan [SIAM J. Comput. 1989] and the $\\widetilde{O}(\\sqrt{n}m \\log C)$ time algorithm of Lee and Sidford [FOCS 2014]. In particular, our result constitutes the first k"},"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":"1907.02274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"d5a906756fda0eb2ff102300bcd48a081f54fa4c4b3617b5497d03e7744aa2c8","abstract_canon_sha256":"0e6362e86a10e86060c141e0dbe8fa64a80376a9a72dd566b4dad250851240ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.181117Z","signature_b64":"vubJmCKv9SM5wcP/tl9BrfqWlrBBzNJ4s1CQRCXvOF8iHRa6sJa/xfZvC3amdhm4x9pPBiJleeK2mNjCPd6oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34aab4a8a7dabc22bfacdb5906ac96cfe5a2dcd4f6aa57bd85ff8991f36b34b1","last_reissued_at":"2026-05-17T23:41:29.180207Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.180207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Min-Cost Flow in Unit-Capacity Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Piotr Sankowski","submitted_at":"2019-07-04T08:35:02Z","abstract_excerpt":"In this paper we give an $\\widetilde{O}((nm)^{2/3}\\log C)$ time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity planar multigraphs where edge costs are integers bounded by $C$. For planar multigraphs, this improves upon the best known algorithms for general graphs: the $\\widetilde{O}(m^{10/7}\\log C)$ time algorithm of Cohen et al. [SODA 2017], the $O(m^{3/2}\\log(nC))$ time algorithm of Gabow and Tarjan [SIAM J. Comput. 1989] and the $\\widetilde{O}(\\sqrt{n}m \\log C)$ time algorithm of Lee and Sidford [FOCS 2014]. In particular, our result constitutes the first k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02274","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":"1907.02274","created_at":"2026-05-17T23:41:29.180327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02274v1","created_at":"2026-05-17T23:41:29.180327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02274","created_at":"2026-05-17T23:41:29.180327+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSVLJKFH3K6C","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSVLJKFH3K6CFP5M","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSVLJKFH","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7","json":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7.json","graph_json":"https://pith.science/api/pith-number/GSVLJKFH3K6CFP5M3NMQNLEWZ7/graph.json","events_json":"https://pith.science/api/pith-number/GSVLJKFH3K6CFP5M3NMQNLEWZ7/events.json","paper":"https://pith.science/paper/GSVLJKFH"},"agent_actions":{"view_html":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7","download_json":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7.json","view_paper":"https://pith.science/paper/GSVLJKFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02274&json=true","fetch_graph":"https://pith.science/api/pith-number/GSVLJKFH3K6CFP5M3NMQNLEWZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/GSVLJKFH3K6CFP5M3NMQNLEWZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/action/storage_attestation","attest_author":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/action/author_attestation","sign_citation":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/action/citation_signature","submit_replication":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/action/replication_record"}},"created_at":"2026-05-17T23:41:29.180327+00:00","updated_at":"2026-05-17T23:41:29.180327+00:00"}