{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QLMNHGFAW2P3M6X6XZIU5R5JVK","short_pith_number":"pith:QLMNHGFA","canonical_record":{"source":{"id":"1705.05916","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-16T20:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"695afd0efdc387edeb38e2f525af2aba86a5264fd0cbc5147503657dcdfafc05","abstract_canon_sha256":"6fcd2cdc1ad862a9b45a609eae5d1a5d1bf739c2c863fa59c6f7a1e0b9ab36c5"},"schema_version":"1.0"},"canonical_sha256":"82d8d398a0b69fb67afebe514ec7a9aaa1b1f7cf9b20d2c27ef5f1960c89e71e","source":{"kind":"arxiv","id":"1705.05916","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05916","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05916v4","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05916","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"pith_short_12","alias_value":"QLMNHGFAW2P3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QLMNHGFAW2P3M6X6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QLMNHGFA","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QLMNHGFAW2P3M6X6XZIU5R5JVK","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05916","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-16T20:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"695afd0efdc387edeb38e2f525af2aba86a5264fd0cbc5147503657dcdfafc05","abstract_canon_sha256":"6fcd2cdc1ad862a9b45a609eae5d1a5d1bf739c2c863fa59c6f7a1e0b9ab36c5"},"schema_version":"1.0"},"canonical_sha256":"82d8d398a0b69fb67afebe514ec7a9aaa1b1f7cf9b20d2c27ef5f1960c89e71e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:15.678212Z","signature_b64":"l7eC7PmTJJzxA/RMf4CrMP79amlBkkhcIQf8c+3L9Z1Nk6npEF9aRgSkHWi/dg2+eabvMTqp/phaDOc7uBSpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82d8d398a0b69fb67afebe514ec7a9aaa1b1f7cf9b20d2c27ef5f1960c89e71e","last_reissued_at":"2026-05-18T00:28:15.677536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:15.677536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05916","source_version":4,"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:28:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8p3i5FwPvv9Hx+wWnvA6rhyltSKFRAW5L5VBGZkr6FgiWZB8FINpSOKCCCn9gCKfoMZxjmyf7066MuYdQknOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:37:40.279820Z"},"content_sha256":"7019519be53888ac4fdd4ef42c9f54b83e9b66735f47a4a5eae1d8b01928ddda","schema_version":"1.0","event_id":"sha256:7019519be53888ac4fdd4ef42c9f54b83e9b66735f47a4a5eae1d8b01928ddda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QLMNHGFAW2P3M6X6XZIU5R5JVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Design with Probabilistic Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Avinash Bhardwaj","submitted_at":"2017-05-16T20:57:38Z","abstract_excerpt":"We consider a network design problem with random arc capacities and give a formulation with a probabilistic capacity constraint on each cut of the network. To handle the exponentially-many probabilistic constraints a separation procedure that solves a nonlinear minimum cut problem is introduced. For the case with independent arc capacities, we exploit the supermodularity of the set function defining the constraints and generate cutting planes based on the supermodular covering knapsack polytope. For the general correlated case, we give a reformulation of the constraints that allows to uncover "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05916","kind":"arxiv","version":4},"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:28:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srEO5SH3lD+azjr5n0Ta+k38wa/qaFl0MA64avPjPyurWZhf4EbjAU5IEX4Wq8IoItVe7OOckZLDE9nxj9g0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:37:40.280249Z"},"content_sha256":"b0bcc164c66b19fa3b9f6485bcdd59cc1aec8f7b926a89d27daa4d57c62a7e35","schema_version":"1.0","event_id":"sha256:b0bcc164c66b19fa3b9f6485bcdd59cc1aec8f7b926a89d27daa4d57c62a7e35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK/bundle.json","state_url":"https://pith.science/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK/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-31T18:37:40Z","links":{"resolver":"https://pith.science/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK","bundle":"https://pith.science/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK/bundle.json","state":"https://pith.science/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLMNHGFAW2P3M6X6XZIU5R5JVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QLMNHGFAW2P3M6X6XZIU5R5JVK","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":"6fcd2cdc1ad862a9b45a609eae5d1a5d1bf739c2c863fa59c6f7a1e0b9ab36c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-16T20:57:38Z","title_canon_sha256":"695afd0efdc387edeb38e2f525af2aba86a5264fd0cbc5147503657dcdfafc05"},"schema_version":"1.0","source":{"id":"1705.05916","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05916","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05916v4","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05916","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"pith_short_12","alias_value":"QLMNHGFAW2P3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QLMNHGFAW2P3M6X6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QLMNHGFA","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b0bcc164c66b19fa3b9f6485bcdd59cc1aec8f7b926a89d27daa4d57c62a7e35","target":"graph","created_at":"2026-05-18T00:28:15Z","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 consider a network design problem with random arc capacities and give a formulation with a probabilistic capacity constraint on each cut of the network. To handle the exponentially-many probabilistic constraints a separation procedure that solves a nonlinear minimum cut problem is introduced. For the case with independent arc capacities, we exploit the supermodularity of the set function defining the constraints and generate cutting planes based on the supermodular covering knapsack polytope. For the general correlated case, we give a reformulation of the constraints that allows to uncover ","authors_text":"Alper Atamturk, Avinash Bhardwaj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-16T20:57:38Z","title":"Network Design with Probabilistic Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05916","kind":"arxiv","version":4},"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:7019519be53888ac4fdd4ef42c9f54b83e9b66735f47a4a5eae1d8b01928ddda","target":"record","created_at":"2026-05-18T00:28:15Z","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":"6fcd2cdc1ad862a9b45a609eae5d1a5d1bf739c2c863fa59c6f7a1e0b9ab36c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-16T20:57:38Z","title_canon_sha256":"695afd0efdc387edeb38e2f525af2aba86a5264fd0cbc5147503657dcdfafc05"},"schema_version":"1.0","source":{"id":"1705.05916","kind":"arxiv","version":4}},"canonical_sha256":"82d8d398a0b69fb67afebe514ec7a9aaa1b1f7cf9b20d2c27ef5f1960c89e71e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82d8d398a0b69fb67afebe514ec7a9aaa1b1f7cf9b20d2c27ef5f1960c89e71e","first_computed_at":"2026-05-18T00:28:15.677536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:15.677536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l7eC7PmTJJzxA/RMf4CrMP79amlBkkhcIQf8c+3L9Z1Nk6npEF9aRgSkHWi/dg2+eabvMTqp/phaDOc7uBSpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:15.678212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05916","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7019519be53888ac4fdd4ef42c9f54b83e9b66735f47a4a5eae1d8b01928ddda","sha256:b0bcc164c66b19fa3b9f6485bcdd59cc1aec8f7b926a89d27daa4d57c62a7e35"],"state_sha256":"eaa403b59889c5dbf1dd920b56ab271662e705e9a3ba013e2916e5f362a6bbdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJMxtzxKlK3lQ/H9RQ5fR0YFNiFxTQnk0FFpNMWFs8mvdT+Y77EEDmnTJmqsjeOgNytAFHMWzIPNAfwKZ+5cDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:37:40.284034Z","bundle_sha256":"976fb14b65e06e69b7e2199b6ee60b3503466b621805c3486decefed9598fc4f"}}