{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GSVLJKFH3K6CFP5M3NMQNLEWZ7","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":"0e6362e86a10e86060c141e0dbe8fa64a80376a9a72dd566b4dad250851240ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:35:02Z","title_canon_sha256":"d5a906756fda0eb2ff102300bcd48a081f54fa4c4b3617b5497d03e7744aa2c8"},"schema_version":"1.0","source":{"id":"1907.02274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02274","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02274v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02274","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"GSVLJKFH3K6C","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSVLJKFH3K6CFP5M","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSVLJKFH","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:1ecdd7bbe199b312d2eb7e4cbb2c57e5f063164b40cd23a7bd9a54a7f7ab0fd9","target":"graph","created_at":"2026-05-17T23:41:29Z","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":"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","authors_text":"Adam Karczmarz, Piotr Sankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:35:02Z","title":"Min-Cost Flow in Unit-Capacity Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02274","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:6a095dfc9ef562de591385e6f9501dc42dd5c265cdd497a2580212caefc195f7","target":"record","created_at":"2026-05-17T23:41:29Z","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":"0e6362e86a10e86060c141e0dbe8fa64a80376a9a72dd566b4dad250851240ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:35:02Z","title_canon_sha256":"d5a906756fda0eb2ff102300bcd48a081f54fa4c4b3617b5497d03e7744aa2c8"},"schema_version":"1.0","source":{"id":"1907.02274","kind":"arxiv","version":1}},"canonical_sha256":"34aab4a8a7dabc22bfacdb5906ac96cfe5a2dcd4f6aa57bd85ff8991f36b34b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34aab4a8a7dabc22bfacdb5906ac96cfe5a2dcd4f6aa57bd85ff8991f36b34b1","first_computed_at":"2026-05-17T23:41:29.180207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:29.180207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vubJmCKv9SM5wcP/tl9BrfqWlrBBzNJ4s1CQRCXvOF8iHRa6sJa/xfZvC3amdhm4x9pPBiJleeK2mNjCPd6oCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:29.181117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a095dfc9ef562de591385e6f9501dc42dd5c265cdd497a2580212caefc195f7","sha256:1ecdd7bbe199b312d2eb7e4cbb2c57e5f063164b40cd23a7bd9a54a7f7ab0fd9"],"state_sha256":"b200bdaf0bc78dcabd9b88893777e5e5645ebdea6391e218e55a50c1b9f720ca"}