{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GSVLJKFH3K6CFP5M3NMQNLEWZ7","short_pith_number":"pith:GSVLJKFH","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"},"canonical_sha256":"34aab4a8a7dabc22bfacdb5906ac96cfe5a2dcd4f6aa57bd85ff8991f36b34b1","source":{"kind":"arxiv","id":"1907.02274","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GSVLJKFH3K6CFP5M3NMQNLEWZ7","target":"record","payload":{"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"},"canonical_sha256":"34aab4a8a7dabc22bfacdb5906ac96cfe5a2dcd4f6aa57bd85ff8991f36b34b1","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"},"source_kind":"arxiv","source_id":"1907.02274","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/Kdh162FkBqQASTvBKhzqGBjHLh7sobsfEObrd/ThBYeqeBie6z8hqnk9wFet3Xe0ZpQ/U4fczByZzkSEbRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:50.697802Z"},"content_sha256":"6a095dfc9ef562de591385e6f9501dc42dd5c265cdd497a2580212caefc195f7","schema_version":"1.0","event_id":"sha256:6a095dfc9ef562de591385e6f9501dc42dd5c265cdd497a2580212caefc195f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GSVLJKFH3K6CFP5M3NMQNLEWZ7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PbCGBGDHoDKhLxMlQOX8kc6wW1YUXvLRc8T9SOgqiALDAdtINtm+0INvPh4wjDdBjfFUnH4fOnn4p0I5VIxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:50.698410Z"},"content_sha256":"1ecdd7bbe199b312d2eb7e4cbb2c57e5f063164b40cd23a7bd9a54a7f7ab0fd9","schema_version":"1.0","event_id":"sha256:1ecdd7bbe199b312d2eb7e4cbb2c57e5f063164b40cd23a7bd9a54a7f7ab0fd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/bundle.json","state_url":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T10:33:50Z","links":{"resolver":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7","bundle":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/bundle.json","state":"https://pith.science/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSVLJKFH3K6CFP5M3NMQNLEWZ7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g06M1WTYWW9fCclE0r9XxOJ/VoYRweGyPbSBIKJfyNSDf/TgCpe4N2hAOow7RQyfA/d869kb/Zo+4hZcAu+AAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:33:50.701994Z","bundle_sha256":"01661f19c5fe2717ffd427d8661ae61068f55ceb997406cc1713be58d1c18499"}}