{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5VQAND26BT5E27V7F4ZM3C63DW","short_pith_number":"pith:5VQAND26","schema_version":"1.0","canonical_sha256":"ed60068f5e0cfa4d7ebf2f32cd8bdb1d8797116d01ddcb6d3361a9bff6a4d861","source":{"kind":"arxiv","id":"1603.08997","version":1},"attestation_state":"computed","paper":{"title":"Shortest path and maximum flow problems in planar flow networks with additive gains and losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Assaf Kfoury, Saber Mirzaei","submitted_at":"2016-03-29T23:24:39Z","abstract_excerpt":"In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e. Hence, if a flow f(e) enters the edge e and f(e) is less than the designated capacity of e, then f(e) + g(e) = 0 units of flow reach the end point of e, provided e is used, i.e., provided f(e) != 0. In this report we study the maximum flow problem in additive flow networks, which we prove to be NP-hard even when the underlying graphs of additive flow networks are planar. We also investigate the shortest path proble"},"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":"1603.08997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-29T23:24:39Z","cross_cats_sorted":[],"title_canon_sha256":"21848f246d642f75efb1c722039245becddb52587e9f57839966d68a0337dcec","abstract_canon_sha256":"0bc6864090b36d6fe6d24738c64d35456ac5000f6e6f2fdcb9e5ef26e31d1803"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:04.064808Z","signature_b64":"c2DATFeFOnNdufB4x1ulfdv4pQWk18yxp6D3zPWj3C3+Oig9EKtHF20fB0eKKioMUW9ds+C1CaRolvv+f9sUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed60068f5e0cfa4d7ebf2f32cd8bdb1d8797116d01ddcb6d3361a9bff6a4d861","last_reissued_at":"2026-05-18T01:18:04.064160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:04.064160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest path and maximum flow problems in planar flow networks with additive gains and losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Assaf Kfoury, Saber Mirzaei","submitted_at":"2016-03-29T23:24:39Z","abstract_excerpt":"In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e. Hence, if a flow f(e) enters the edge e and f(e) is less than the designated capacity of e, then f(e) + g(e) = 0 units of flow reach the end point of e, provided e is used, i.e., provided f(e) != 0. In this report we study the maximum flow problem in additive flow networks, which we prove to be NP-hard even when the underlying graphs of additive flow networks are planar. We also investigate the shortest path proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08997","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":"1603.08997","created_at":"2026-05-18T01:18:04.064259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08997v1","created_at":"2026-05-18T01:18:04.064259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08997","created_at":"2026-05-18T01:18:04.064259+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VQAND26BT5E","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VQAND26BT5E27V7","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VQAND26","created_at":"2026-05-18T12:30:01.593930+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/5VQAND26BT5E27V7F4ZM3C63DW","json":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW.json","graph_json":"https://pith.science/api/pith-number/5VQAND26BT5E27V7F4ZM3C63DW/graph.json","events_json":"https://pith.science/api/pith-number/5VQAND26BT5E27V7F4ZM3C63DW/events.json","paper":"https://pith.science/paper/5VQAND26"},"agent_actions":{"view_html":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW","download_json":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW.json","view_paper":"https://pith.science/paper/5VQAND26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08997&json=true","fetch_graph":"https://pith.science/api/pith-number/5VQAND26BT5E27V7F4ZM3C63DW/graph.json","fetch_events":"https://pith.science/api/pith-number/5VQAND26BT5E27V7F4ZM3C63DW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW/action/storage_attestation","attest_author":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW/action/author_attestation","sign_citation":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW/action/citation_signature","submit_replication":"https://pith.science/pith/5VQAND26BT5E27V7F4ZM3C63DW/action/replication_record"}},"created_at":"2026-05-18T01:18:04.064259+00:00","updated_at":"2026-05-18T01:18:04.064259+00:00"}