{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5VQAND26BT5E27V7F4ZM3C63DW","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":"0bc6864090b36d6fe6d24738c64d35456ac5000f6e6f2fdcb9e5ef26e31d1803","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-29T23:24:39Z","title_canon_sha256":"21848f246d642f75efb1c722039245becddb52587e9f57839966d68a0337dcec"},"schema_version":"1.0","source":{"id":"1603.08997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08997","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08997v1","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08997","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"5VQAND26BT5E","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5VQAND26BT5E27V7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5VQAND26","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:06ea64e7ced91080206fe20291e0409e9353d4bb510c21d6093548a1b7bc2358","target":"graph","created_at":"2026-05-18T01:18:04Z","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 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","authors_text":"Assaf Kfoury, Saber Mirzaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-29T23:24:39Z","title":"Shortest path and maximum flow problems in planar flow networks with additive gains and losses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08997","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:4fb692c4c166b7d8d150a5904673ac679bd2039ede051b4d12c9ed76ea833533","target":"record","created_at":"2026-05-18T01:18:04Z","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":"0bc6864090b36d6fe6d24738c64d35456ac5000f6e6f2fdcb9e5ef26e31d1803","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-29T23:24:39Z","title_canon_sha256":"21848f246d642f75efb1c722039245becddb52587e9f57839966d68a0337dcec"},"schema_version":"1.0","source":{"id":"1603.08997","kind":"arxiv","version":1}},"canonical_sha256":"ed60068f5e0cfa4d7ebf2f32cd8bdb1d8797116d01ddcb6d3361a9bff6a4d861","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed60068f5e0cfa4d7ebf2f32cd8bdb1d8797116d01ddcb6d3361a9bff6a4d861","first_computed_at":"2026-05-18T01:18:04.064160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:04.064160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2DATFeFOnNdufB4x1ulfdv4pQWk18yxp6D3zPWj3C3+Oig9EKtHF20fB0eKKioMUW9ds+C1CaRolvv+f9sUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:04.064808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fb692c4c166b7d8d150a5904673ac679bd2039ede051b4d12c9ed76ea833533","sha256:06ea64e7ced91080206fe20291e0409e9353d4bb510c21d6093548a1b7bc2358"],"state_sha256":"18aa23c009687d97a638bc66638bbcceccc89800be31b84be049defb55b772ab"}