{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BIBPIPMPW4LM6DJJQJ46DBXCZL","short_pith_number":"pith:BIBPIPMP","schema_version":"1.0","canonical_sha256":"0a02f43d8fb716cf0d298279e186e2cafa86383d091ee3ea40966da94c045953","source":{"kind":"arxiv","id":"1410.7208","version":1},"attestation_state":"computed","paper":{"title":"A combinatorial algorithm for the planar multiflow problem with demands located on three holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Karzanov, Maxim A. Babenko","submitted_at":"2014-10-27T12:45:39Z","abstract_excerpt":"We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian. It is known that such a problem has a solution if the cut and (2,3)-metric conditions hold, and that the solvability implies the existence of an integer solution. We develop a purely combinatorial strongly polynomial solution algorithm."},"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":"1410.7208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T12:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"551a122a152b9db7dd4afbf14d968c4f26eee203de037d4530343947d99aa369","abstract_canon_sha256":"81aab313e6149f8311f71ac6bade1ac3d78793aaa4a60c2e38bb8fefc203e7ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.827341Z","signature_b64":"GkAHizwAnHAu9VEi87PLA70ZlY8ECd9I63gtjZ0vecobhf7QTluSYgYviqSvY6XnSioxWWPzgDvraEJfXonlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a02f43d8fb716cf0d298279e186e2cafa86383d091ee3ea40966da94c045953","last_reissued_at":"2026-05-18T02:39:17.826949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.826949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial algorithm for the planar multiflow problem with demands located on three holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Karzanov, Maxim A. Babenko","submitted_at":"2014-10-27T12:45:39Z","abstract_excerpt":"We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian. It is known that such a problem has a solution if the cut and (2,3)-metric conditions hold, and that the solvability implies the existence of an integer solution. We develop a purely combinatorial strongly polynomial solution algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7208","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":"1410.7208","created_at":"2026-05-18T02:39:17.826998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7208v1","created_at":"2026-05-18T02:39:17.826998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7208","created_at":"2026-05-18T02:39:17.826998+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIBPIPMPW4LM","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIBPIPMPW4LM6DJJ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIBPIPMP","created_at":"2026-05-18T12:28:22.404517+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/BIBPIPMPW4LM6DJJQJ46DBXCZL","json":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL.json","graph_json":"https://pith.science/api/pith-number/BIBPIPMPW4LM6DJJQJ46DBXCZL/graph.json","events_json":"https://pith.science/api/pith-number/BIBPIPMPW4LM6DJJQJ46DBXCZL/events.json","paper":"https://pith.science/paper/BIBPIPMP"},"agent_actions":{"view_html":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL","download_json":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL.json","view_paper":"https://pith.science/paper/BIBPIPMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7208&json=true","fetch_graph":"https://pith.science/api/pith-number/BIBPIPMPW4LM6DJJQJ46DBXCZL/graph.json","fetch_events":"https://pith.science/api/pith-number/BIBPIPMPW4LM6DJJQJ46DBXCZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL/action/storage_attestation","attest_author":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL/action/author_attestation","sign_citation":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL/action/citation_signature","submit_replication":"https://pith.science/pith/BIBPIPMPW4LM6DJJQJ46DBXCZL/action/replication_record"}},"created_at":"2026-05-18T02:39:17.826998+00:00","updated_at":"2026-05-18T02:39:17.826998+00:00"}