{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3XAW5DILC7YDYXJZRXFXPF4EEW","short_pith_number":"pith:3XAW5DIL","canonical_record":{"source":{"id":"1312.6447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T00:26:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"906c6fdd7185248df3041cddd93e528ae4afb2dfdac17d2cec51f671ccf22ce9","abstract_canon_sha256":"d452f20ddbc3b0faaca7b38b031686a0d5f8ac3c5a6b3b65a2138921bff8bb5d"},"schema_version":"1.0"},"canonical_sha256":"ddc16e8d0b17f03c5d398dcb779784258c61f2d4daa28ae5c5daa22889bf72c1","source":{"kind":"arxiv","id":"1312.6447","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6447","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6447v2","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6447","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"3XAW5DILC7YD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3XAW5DILC7YDYXJZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3XAW5DIL","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3XAW5DILC7YDYXJZRXFXPF4EEW","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T00:26:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"906c6fdd7185248df3041cddd93e528ae4afb2dfdac17d2cec51f671ccf22ce9","abstract_canon_sha256":"d452f20ddbc3b0faaca7b38b031686a0d5f8ac3c5a6b3b65a2138921bff8bb5d"},"schema_version":"1.0"},"canonical_sha256":"ddc16e8d0b17f03c5d398dcb779784258c61f2d4daa28ae5c5daa22889bf72c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.646444Z","signature_b64":"sd9sUK+3trN5qi63f0xGHdFmMVty0SsvJ2CjHRvbRG/wUgM+GGwxfo7ZuGVYrI3MQoOGnVTbzaHtytgV3fntCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc16e8d0b17f03c5d398dcb779784258c61f2d4daa28ae5c5daa22889bf72c1","last_reissued_at":"2026-05-18T02:31:36.645870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.645870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6447","source_version":2,"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-18T02:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXPzcoeITCoJtxaVuVJxeNoKuXER49J2pdVClYSU2gnhF7xOOWnkbcfkeDrzKr+FDqHYyDNvsECeojuICQRuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:11:44.041989Z"},"content_sha256":"54d480664d5dadbe29b16b4a9d8ab862ed03dc9a01369365938f966f819b433e","schema_version":"1.0","event_id":"sha256:54d480664d5dadbe29b16b4a9d8ab862ed03dc9a01369365938f966f819b433e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3XAW5DILC7YDYXJZRXFXPF4EEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Network Design with Maximum Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Dmytro Matsypura, Martin W.P. Savelsbergh, Thomas Kalinowski","submitted_at":"2013-12-23T00:26:00Z","abstract_excerpt":"We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6447","kind":"arxiv","version":2},"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-18T02:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9prGMImGhiydmhWJm30YDZPF3Ckoglu0qHEXQQdu47riHY8Pm082ewRLHAl7gcjQ5owSNm4SicQjiWInRuNfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:11:44.042799Z"},"content_sha256":"d17835bff64c57623bf518b4eb83d48688538b456f5768733dfbb59ff98a6ea7","schema_version":"1.0","event_id":"sha256:d17835bff64c57623bf518b4eb83d48688538b456f5768733dfbb59ff98a6ea7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XAW5DILC7YDYXJZRXFXPF4EEW/bundle.json","state_url":"https://pith.science/pith/3XAW5DILC7YDYXJZRXFXPF4EEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XAW5DILC7YDYXJZRXFXPF4EEW/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-07T19:11:44Z","links":{"resolver":"https://pith.science/pith/3XAW5DILC7YDYXJZRXFXPF4EEW","bundle":"https://pith.science/pith/3XAW5DILC7YDYXJZRXFXPF4EEW/bundle.json","state":"https://pith.science/pith/3XAW5DILC7YDYXJZRXFXPF4EEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XAW5DILC7YDYXJZRXFXPF4EEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3XAW5DILC7YDYXJZRXFXPF4EEW","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":"d452f20ddbc3b0faaca7b38b031686a0d5f8ac3c5a6b3b65a2138921bff8bb5d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T00:26:00Z","title_canon_sha256":"906c6fdd7185248df3041cddd93e528ae4afb2dfdac17d2cec51f671ccf22ce9"},"schema_version":"1.0","source":{"id":"1312.6447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6447","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6447v2","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6447","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"3XAW5DILC7YD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3XAW5DILC7YDYXJZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3XAW5DIL","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:d17835bff64c57623bf518b4eb83d48688538b456f5768733dfbb59ff98a6ea7","target":"graph","created_at":"2026-05-18T02:31:36Z","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 an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics.","authors_text":"Dmytro Matsypura, Martin W.P. Savelsbergh, Thomas Kalinowski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T00:26:00Z","title":"Incremental Network Design with Maximum Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6447","kind":"arxiv","version":2},"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:54d480664d5dadbe29b16b4a9d8ab862ed03dc9a01369365938f966f819b433e","target":"record","created_at":"2026-05-18T02:31:36Z","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":"d452f20ddbc3b0faaca7b38b031686a0d5f8ac3c5a6b3b65a2138921bff8bb5d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T00:26:00Z","title_canon_sha256":"906c6fdd7185248df3041cddd93e528ae4afb2dfdac17d2cec51f671ccf22ce9"},"schema_version":"1.0","source":{"id":"1312.6447","kind":"arxiv","version":2}},"canonical_sha256":"ddc16e8d0b17f03c5d398dcb779784258c61f2d4daa28ae5c5daa22889bf72c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddc16e8d0b17f03c5d398dcb779784258c61f2d4daa28ae5c5daa22889bf72c1","first_computed_at":"2026-05-18T02:31:36.645870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:36.645870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sd9sUK+3trN5qi63f0xGHdFmMVty0SsvJ2CjHRvbRG/wUgM+GGwxfo7ZuGVYrI3MQoOGnVTbzaHtytgV3fntCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:36.646444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54d480664d5dadbe29b16b4a9d8ab862ed03dc9a01369365938f966f819b433e","sha256:d17835bff64c57623bf518b4eb83d48688538b456f5768733dfbb59ff98a6ea7"],"state_sha256":"28e67fb7c5a001c4f778e24d46582f821c9e5bf5f0a927bc8722fe2361fc9357"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tMoZaAKTEhWXmEURbRosJfUS/4grL8ZmkoqvuJf0XvpILsdJ08omPlZfr1meheM2skzfNYeZ28BT7pRK4xTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:11:44.046205Z","bundle_sha256":"77662c8aec31dc08f1172271048b665773c96760a65552e61a6eeb07219ce303"}}