{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KMUDJ536K7FTKENM5CTTWNN4WJ","short_pith_number":"pith:KMUDJ536","canonical_record":{"source":{"id":"1602.08515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T21:52:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3ec49815179dcc01b40d6e32dc56604907104ce2ea27cfe8ee41a535467a39a0","abstract_canon_sha256":"e45b33a6f7a11ad1a04b30f7848f82bd3ead638d469156f807525ef5a2b456f2"},"schema_version":"1.0"},"canonical_sha256":"532834f77e57cb3511ace8a73b35bcb2455dda88ad4bef0798990e4c4937ec36","source":{"kind":"arxiv","id":"1602.08515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08515","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08515v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08515","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"KMUDJ536K7FT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KMUDJ536K7FTKENM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KMUDJ536","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KMUDJ536K7FTKENM5CTTWNN4WJ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T21:52:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3ec49815179dcc01b40d6e32dc56604907104ce2ea27cfe8ee41a535467a39a0","abstract_canon_sha256":"e45b33a6f7a11ad1a04b30f7848f82bd3ead638d469156f807525ef5a2b456f2"},"schema_version":"1.0"},"canonical_sha256":"532834f77e57cb3511ace8a73b35bcb2455dda88ad4bef0798990e4c4937ec36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.649008Z","signature_b64":"LFR/npzDHHYQKkH5gsjU/JuB+x7GPAkn72lLFoXXXEmNVfUQ9Zgqf3kysFqbarAspGB6sG/O+oWbsYiIiTzpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"532834f77e57cb3511ace8a73b35bcb2455dda88ad4bef0798990e4c4937ec36","last_reissued_at":"2026-05-18T01:19:52.648539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.648539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08515","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7zj/UAhaToDY7gJaCt9EAq37vB/k/Fg7523i3fZb3SFfw6sq4xpRypMFpiPWGrGuI456uh6hVqLILV2PcydBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:09:32.751403Z"},"content_sha256":"67472e31bfe58a897630e70fcac9eb040f210aab6bd41f1a9af05f79b4a051f4","schema_version":"1.0","event_id":"sha256:67472e31bfe58a897630e70fcac9eb040f210aab6bd41f1a9af05f79b4a051f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KMUDJ536K7FTKENM5CTTWNN4WJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the computational complexity of minimum-concave-cost flow in a two-dimensional grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"George Nemhauser, Qie He, Shabbir Ahmed, Shi Li","submitted_at":"2016-02-26T21:52:10Z","abstract_excerpt":"We study the minimum-concave-cost flow problem on a two-dimensional grid. We characterize the computational complexity of this problem based on the number of rows and columns of the grid, the number of different capacities over all arcs, and the location of sources and sinks. The concave cost over each arc is assumed to be evaluated through an oracle machine, i.e., the oracle machine returns the cost over an arc in a single computational step, given the flow value and the arc index. We propose an algorithm whose running time is polynomial in the number of columns of the grid, for the following"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08515","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfldZCKD4FkINFM5ojFm/p1URqiki2+qBoR/CDtlvGdn1KfnPzIb1dcpTSjzzIEzpqXgnM8nQYecRgvwO9y/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:09:32.752060Z"},"content_sha256":"7a902f9c2ce0bfe280ac4b765cd06b48d8a9b4910baa016a4e8e87292231b237","schema_version":"1.0","event_id":"sha256:7a902f9c2ce0bfe280ac4b765cd06b48d8a9b4910baa016a4e8e87292231b237"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMUDJ536K7FTKENM5CTTWNN4WJ/bundle.json","state_url":"https://pith.science/pith/KMUDJ536K7FTKENM5CTTWNN4WJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMUDJ536K7FTKENM5CTTWNN4WJ/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-06-11T13:09:32Z","links":{"resolver":"https://pith.science/pith/KMUDJ536K7FTKENM5CTTWNN4WJ","bundle":"https://pith.science/pith/KMUDJ536K7FTKENM5CTTWNN4WJ/bundle.json","state":"https://pith.science/pith/KMUDJ536K7FTKENM5CTTWNN4WJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMUDJ536K7FTKENM5CTTWNN4WJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KMUDJ536K7FTKENM5CTTWNN4WJ","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":"e45b33a6f7a11ad1a04b30f7848f82bd3ead638d469156f807525ef5a2b456f2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T21:52:10Z","title_canon_sha256":"3ec49815179dcc01b40d6e32dc56604907104ce2ea27cfe8ee41a535467a39a0"},"schema_version":"1.0","source":{"id":"1602.08515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08515","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08515v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08515","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"KMUDJ536K7FT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KMUDJ536K7FTKENM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KMUDJ536","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:7a902f9c2ce0bfe280ac4b765cd06b48d8a9b4910baa016a4e8e87292231b237","target":"graph","created_at":"2026-05-18T01:19:52Z","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":"We study the minimum-concave-cost flow problem on a two-dimensional grid. We characterize the computational complexity of this problem based on the number of rows and columns of the grid, the number of different capacities over all arcs, and the location of sources and sinks. The concave cost over each arc is assumed to be evaluated through an oracle machine, i.e., the oracle machine returns the cost over an arc in a single computational step, given the flow value and the arc index. We propose an algorithm whose running time is polynomial in the number of columns of the grid, for the following","authors_text":"George Nemhauser, Qie He, Shabbir Ahmed, Shi Li","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T21:52:10Z","title":"On the computational complexity of minimum-concave-cost flow in a two-dimensional grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08515","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:67472e31bfe58a897630e70fcac9eb040f210aab6bd41f1a9af05f79b4a051f4","target":"record","created_at":"2026-05-18T01:19:52Z","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":"e45b33a6f7a11ad1a04b30f7848f82bd3ead638d469156f807525ef5a2b456f2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T21:52:10Z","title_canon_sha256":"3ec49815179dcc01b40d6e32dc56604907104ce2ea27cfe8ee41a535467a39a0"},"schema_version":"1.0","source":{"id":"1602.08515","kind":"arxiv","version":1}},"canonical_sha256":"532834f77e57cb3511ace8a73b35bcb2455dda88ad4bef0798990e4c4937ec36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"532834f77e57cb3511ace8a73b35bcb2455dda88ad4bef0798990e4c4937ec36","first_computed_at":"2026-05-18T01:19:52.648539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:52.648539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFR/npzDHHYQKkH5gsjU/JuB+x7GPAkn72lLFoXXXEmNVfUQ9Zgqf3kysFqbarAspGB6sG/O+oWbsYiIiTzpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:52.649008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67472e31bfe58a897630e70fcac9eb040f210aab6bd41f1a9af05f79b4a051f4","sha256:7a902f9c2ce0bfe280ac4b765cd06b48d8a9b4910baa016a4e8e87292231b237"],"state_sha256":"a3d06b1455f15b434d7d4cde67bb5dcf321aa630f747ab1b7138ed9e76dd864f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1u0TJ41+RAHXX4FtmMo5NAgJ8JYe4lCOGC28x/nODQwfg1afSse5chs3kagJZjCKbKKsIPjXrusm5H3wIdhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:09:32.755112Z","bundle_sha256":"fb57ea68a9dd7d2e421afe38ac782267a377b64d954dbffa657e635b79e45d16"}}