{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","short_pith_number":"pith:Q3SUYW5G","schema_version":"1.0","canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","source":{"kind":"arxiv","id":"1305.5823","version":1},"attestation_state":"computed","paper":{"title":"Maximum st-flow in directed planar graphs via shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Anna Harutyunyan, Glencora Borradaile","submitted_at":"2013-05-24T18:42:49Z","abstract_excerpt":"Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink. We believe this a promising avenue for developing algorithms that are more practical than the current asymptotically best algorithms for maximum st-flow."},"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":"1305.5823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-24T18:42:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"74d90c1a23149c43092a3716a4185bebeb0b9cabbeb75d9f748744c569ef4f7b","abstract_canon_sha256":"248dc955f960fc3914e4b0c179e7cc7a6503846d216c4046a8989be4f871b43a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:54.715109Z","signature_b64":"ZqwWzSoqiWxSVQa04/xHAuEBfacKwGPjhxYl/J2sE3YuxB3NSQsVdRGNCJBQqW9o7ejOxCAfBZ8JgMEZ+u1iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","last_reissued_at":"2026-05-18T03:24:54.714338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:54.714338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum st-flow in directed planar graphs via shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Anna Harutyunyan, Glencora Borradaile","submitted_at":"2013-05-24T18:42:49Z","abstract_excerpt":"Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink. We believe this a promising avenue for developing algorithms that are more practical than the current asymptotically best algorithms for maximum st-flow."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5823","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":"1305.5823","created_at":"2026-05-18T03:24:54.714464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5823v1","created_at":"2026-05-18T03:24:54.714464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5823","created_at":"2026-05-18T03:24:54.714464+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3SUYW5GVVNF","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3SUYW5GVVNFZ3ZJ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3SUYW5G","created_at":"2026-05-18T12:27:57.521954+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/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","json":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4.json","graph_json":"https://pith.science/api/pith-number/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/graph.json","events_json":"https://pith.science/api/pith-number/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/events.json","paper":"https://pith.science/paper/Q3SUYW5G"},"agent_actions":{"view_html":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","download_json":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4.json","view_paper":"https://pith.science/paper/Q3SUYW5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5823&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/action/storage_attestation","attest_author":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/action/author_attestation","sign_citation":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/action/citation_signature","submit_replication":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/action/replication_record"}},"created_at":"2026-05-18T03:24:54.714464+00:00","updated_at":"2026-05-18T03:24:54.714464+00:00"}