{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DPWQYJGMPOCQWSG6DKLFNUUNMB","short_pith_number":"pith:DPWQYJGM","canonical_record":{"source":{"id":"1708.02371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-08T04:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"74890828f347624ed703cef302e10253ab024ae0783985ea1943da36747072d3","abstract_canon_sha256":"e77c49e5306568e630cfafa1081fcb0838cf7a52c643f053575be24f605b3eeb"},"schema_version":"1.0"},"canonical_sha256":"1bed0c24cc7b850b48de1a9656d28d607980427f74a7db529b72a068fa9ed529","source":{"kind":"arxiv","id":"1708.02371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02371","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02371v2","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02371","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"DPWQYJGMPOCQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPWQYJGMPOCQWSG6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPWQYJGM","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DPWQYJGMPOCQWSG6DKLFNUUNMB","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-08T04:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"74890828f347624ed703cef302e10253ab024ae0783985ea1943da36747072d3","abstract_canon_sha256":"e77c49e5306568e630cfafa1081fcb0838cf7a52c643f053575be24f605b3eeb"},"schema_version":"1.0"},"canonical_sha256":"1bed0c24cc7b850b48de1a9656d28d607980427f74a7db529b72a068fa9ed529","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.529845Z","signature_b64":"Mf6fAJuE8AjBco6WPG1Tshvj9J7kPMXDIvSLi35xBYb38NUOaiZD4VGqqX2UtdE9+CS5kn6A/4WCrK8od5mTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bed0c24cc7b850b48de1a9656d28d607980427f74a7db529b72a068fa9ed529","last_reissued_at":"2026-05-18T00:07:18.529212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.529212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02371","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-18T00:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qpzg3jWk+2ADNTtjslzoYXKg37CnH5EmGSmzklSON9FxolxTNsf8O/WAvmx7fMPa+k0K/CXGzwSOa5PkT1MVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:13:18.221360Z"},"content_sha256":"a148bb8c392d8a4379ab2a00c235f9af75b7aad37db3b356ad97f5834fc59548","schema_version":"1.0","event_id":"sha256:a148bb8c392d8a4379ab2a00c235f9af75b7aad37db3b356ad97f5834fc59548"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DPWQYJGMPOCQWSG6DKLFNUUNMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Carlos Deck, Hyemin Jeon","submitted_at":"2017-08-08T04:54:37Z","abstract_excerpt":"The advances in conic optimization have led to its increased utilization for modeling data uncertainty. In particular, conic mean-risk optimization gained prominence in probabilistic and robust optimization. Whereas the corresponding conic models are solved efficiently over convex sets, their discrete counterparts are intractable. In this paper, we give a highly effective successive quadratic upper-bounding procedure for discrete mean-risk minimization problems. The procedure is based on a reformulation of the mean-risk problem through the perspective of its convex quadratic term. Computationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02371","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-18T00:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dl7vEzDXj7tvgY12upTDyeqWM+7F7D+aiYrvIRpE4gEbIHGjn9pfXP0RDqVlzJqqmNcjONiGQnHNmq3OKjfrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:13:18.222173Z"},"content_sha256":"812870e4380033534191a0449f66ef3918736b896adfb8954c4656049bca4a5f","schema_version":"1.0","event_id":"sha256:812870e4380033534191a0449f66ef3918736b896adfb8954c4656049bca4a5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB/bundle.json","state_url":"https://pith.science/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB/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-31T22:13:18Z","links":{"resolver":"https://pith.science/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB","bundle":"https://pith.science/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB/bundle.json","state":"https://pith.science/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPWQYJGMPOCQWSG6DKLFNUUNMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DPWQYJGMPOCQWSG6DKLFNUUNMB","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":"e77c49e5306568e630cfafa1081fcb0838cf7a52c643f053575be24f605b3eeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-08T04:54:37Z","title_canon_sha256":"74890828f347624ed703cef302e10253ab024ae0783985ea1943da36747072d3"},"schema_version":"1.0","source":{"id":"1708.02371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02371","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02371v2","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02371","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"DPWQYJGMPOCQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPWQYJGMPOCQWSG6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPWQYJGM","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:812870e4380033534191a0449f66ef3918736b896adfb8954c4656049bca4a5f","target":"graph","created_at":"2026-05-18T00:07:18Z","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":"The advances in conic optimization have led to its increased utilization for modeling data uncertainty. In particular, conic mean-risk optimization gained prominence in probabilistic and robust optimization. Whereas the corresponding conic models are solved efficiently over convex sets, their discrete counterparts are intractable. In this paper, we give a highly effective successive quadratic upper-bounding procedure for discrete mean-risk minimization problems. The procedure is based on a reformulation of the mean-risk problem through the perspective of its convex quadratic term. Computationa","authors_text":"Alper Atamturk, Carlos Deck, Hyemin Jeon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-08T04:54:37Z","title":"Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02371","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:a148bb8c392d8a4379ab2a00c235f9af75b7aad37db3b356ad97f5834fc59548","target":"record","created_at":"2026-05-18T00:07:18Z","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":"e77c49e5306568e630cfafa1081fcb0838cf7a52c643f053575be24f605b3eeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-08T04:54:37Z","title_canon_sha256":"74890828f347624ed703cef302e10253ab024ae0783985ea1943da36747072d3"},"schema_version":"1.0","source":{"id":"1708.02371","kind":"arxiv","version":2}},"canonical_sha256":"1bed0c24cc7b850b48de1a9656d28d607980427f74a7db529b72a068fa9ed529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bed0c24cc7b850b48de1a9656d28d607980427f74a7db529b72a068fa9ed529","first_computed_at":"2026-05-18T00:07:18.529212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:18.529212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mf6fAJuE8AjBco6WPG1Tshvj9J7kPMXDIvSLi35xBYb38NUOaiZD4VGqqX2UtdE9+CS5kn6A/4WCrK8od5mTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:18.529845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a148bb8c392d8a4379ab2a00c235f9af75b7aad37db3b356ad97f5834fc59548","sha256:812870e4380033534191a0449f66ef3918736b896adfb8954c4656049bca4a5f"],"state_sha256":"68a0491510b38f3437f61fbbfa7ef5fa55e78d13fa6337e0455a7607500713a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ens41M1q7pI47LYpuFierQfVfOOECAfuyxMuMjdzwXwnLXLslIpBwg5F9pDAGp/k4D7Mnn+iOXVle8ZNA41vCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:13:18.226476Z","bundle_sha256":"4c89ff5232c27ac4a50456620a928fc70f46984fc18e7f5a5f7a9fc5c96222a6"}}