{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DLW7JX6GN3DAJ3Y3RZ6EDSNFM5","short_pith_number":"pith:DLW7JX6G","canonical_record":{"source":{"id":"1711.10147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-28T06:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"33f2774b91ab2447724d768e065140b25cc79c95933185b0791326e0cd85fc85","abstract_canon_sha256":"3342c3e75170a48f43bf1903d3ddc675e0edb5e374fe0560d507b1d351c25dcb"},"schema_version":"1.0"},"canonical_sha256":"1aedf4dfc66ec604ef1b8e7c41c9a5676ee65448560e822f46a39c27c9af7304","source":{"kind":"arxiv","id":"1711.10147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10147","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10147v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10147","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"DLW7JX6GN3DA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLW7JX6GN3DAJ3Y3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLW7JX6G","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DLW7JX6GN3DAJ3Y3RZ6EDSNFM5","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-28T06:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"33f2774b91ab2447724d768e065140b25cc79c95933185b0791326e0cd85fc85","abstract_canon_sha256":"3342c3e75170a48f43bf1903d3ddc675e0edb5e374fe0560d507b1d351c25dcb"},"schema_version":"1.0"},"canonical_sha256":"1aedf4dfc66ec604ef1b8e7c41c9a5676ee65448560e822f46a39c27c9af7304","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:23.220149Z","signature_b64":"Nf1UEEbMAhv2QjiespXM9y8wBIouBR3AJECAy9uOqxDPsM2FQDJGyPKTyisR8ckRkmRl/fMoSaznlOj7e0ZFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aedf4dfc66ec604ef1b8e7c41c9a5676ee65448560e822f46a39c27c9af7304","last_reissued_at":"2026-05-18T00:29:23.219331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:23.219331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10147","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-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40XUTWWynwiPoHCPUeTrRG6vRYbaqBt1V6OKxWNVigsIy8jQx7X0K4UuH/IoV6FhRiRYvX6rhV8mittlfoqwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:36:42.443259Z"},"content_sha256":"19c3d929106d97f239da633b3c75e4eadb919895f451ad1bfecad40649e413db","schema_version":"1.0","event_id":"sha256:19c3d929106d97f239da633b3c75e4eadb919895f451ad1bfecad40649e413db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DLW7JX6GN3DAJ3Y3RZ6EDSNFM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Capacity Models for Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Oktay Gunluk","submitted_at":"2017-11-28T06:43:00Z","abstract_excerpt":"In network design problems capacity constraints are modeled in three different ways depending on the application and the underlying technology for installing capacity: directed, bidirected, and undirected. In the literature, polyhedral investigations for strengthening mixed-integer formulations are done separately for each model. In this paper, we examine the relationship between these models to provide a unifying approach and show that one can indeed translate valid inequalities from one to the others. In particular, we show that the projections of the undirected and bidirected models onto th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10147","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-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3sfGGZkL3HSjyRGu1+1Q/ejvMvdusGUPlRDkLvUVDeLs5m2tDBGPyTuGm3ka7VcXKw3ccdPCnW4uzCJN9FYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:36:42.444034Z"},"content_sha256":"357c882b0d4adf66fc727db2cbc848d7f11b4e8bb016035f1b5707163fa5f4b3","schema_version":"1.0","event_id":"sha256:357c882b0d4adf66fc727db2cbc848d7f11b4e8bb016035f1b5707163fa5f4b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5/bundle.json","state_url":"https://pith.science/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5/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-05-31T06:36:42Z","links":{"resolver":"https://pith.science/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5","bundle":"https://pith.science/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5/bundle.json","state":"https://pith.science/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLW7JX6GN3DAJ3Y3RZ6EDSNFM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DLW7JX6GN3DAJ3Y3RZ6EDSNFM5","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":"3342c3e75170a48f43bf1903d3ddc675e0edb5e374fe0560d507b1d351c25dcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-28T06:43:00Z","title_canon_sha256":"33f2774b91ab2447724d768e065140b25cc79c95933185b0791326e0cd85fc85"},"schema_version":"1.0","source":{"id":"1711.10147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10147","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10147v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10147","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"DLW7JX6GN3DA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLW7JX6GN3DAJ3Y3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLW7JX6G","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:357c882b0d4adf66fc727db2cbc848d7f11b4e8bb016035f1b5707163fa5f4b3","target":"graph","created_at":"2026-05-18T00:29:23Z","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 network design problems capacity constraints are modeled in three different ways depending on the application and the underlying technology for installing capacity: directed, bidirected, and undirected. In the literature, polyhedral investigations for strengthening mixed-integer formulations are done separately for each model. In this paper, we examine the relationship between these models to provide a unifying approach and show that one can indeed translate valid inequalities from one to the others. In particular, we show that the projections of the undirected and bidirected models onto th","authors_text":"Alper Atamturk, Oktay Gunluk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-28T06:43:00Z","title":"On Capacity Models for Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10147","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:19c3d929106d97f239da633b3c75e4eadb919895f451ad1bfecad40649e413db","target":"record","created_at":"2026-05-18T00:29:23Z","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":"3342c3e75170a48f43bf1903d3ddc675e0edb5e374fe0560d507b1d351c25dcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-28T06:43:00Z","title_canon_sha256":"33f2774b91ab2447724d768e065140b25cc79c95933185b0791326e0cd85fc85"},"schema_version":"1.0","source":{"id":"1711.10147","kind":"arxiv","version":1}},"canonical_sha256":"1aedf4dfc66ec604ef1b8e7c41c9a5676ee65448560e822f46a39c27c9af7304","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aedf4dfc66ec604ef1b8e7c41c9a5676ee65448560e822f46a39c27c9af7304","first_computed_at":"2026-05-18T00:29:23.219331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:23.219331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nf1UEEbMAhv2QjiespXM9y8wBIouBR3AJECAy9uOqxDPsM2FQDJGyPKTyisR8ckRkmRl/fMoSaznlOj7e0ZFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:23.220149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19c3d929106d97f239da633b3c75e4eadb919895f451ad1bfecad40649e413db","sha256:357c882b0d4adf66fc727db2cbc848d7f11b4e8bb016035f1b5707163fa5f4b3"],"state_sha256":"af2a703639d0ada5a78c4dbd853b953e1f0f06ed177c3cd00de15ac66e313631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"755viT60JQw2x0nTa9LpWARt7pJEWCYr8EAJl9BrwbOAKa/RmwQPQZMKVmYRXw8tXL21APPMoMxUExXnCa0CCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:36:42.447840Z","bundle_sha256":"9fe5a97cc59c41cca271aaad04230f3a35570cb4ecc5975a965965f59dd23a81"}}