{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VGWSJZUTYD6246JUIU6KFJPL33","short_pith_number":"pith:VGWSJZUT","canonical_record":{"source":{"id":"1306.3437","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-14T16:01:59Z","cross_cats_sorted":["q-fin.CP","q-fin.PM"],"title_canon_sha256":"0297653d31005c1bc08e6241f16e7252322fe0ef85fcdf3e6310903c7f32b506","abstract_canon_sha256":"c45bdf56234a485310557137f65beefaa7c3cf876ca243d3344fdbee15a76725"},"schema_version":"1.0"},"canonical_sha256":"a9ad24e693c0fdae7934453ca2a5ebdef204a3b5b3f3661c79d0f9999a5e0115","source":{"kind":"arxiv","id":"1306.3437","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3437","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3437v3","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3437","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"VGWSJZUTYD62","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VGWSJZUTYD6246JU","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VGWSJZUT","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VGWSJZUTYD6246JUIU6KFJPL33","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3437","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-14T16:01:59Z","cross_cats_sorted":["q-fin.CP","q-fin.PM"],"title_canon_sha256":"0297653d31005c1bc08e6241f16e7252322fe0ef85fcdf3e6310903c7f32b506","abstract_canon_sha256":"c45bdf56234a485310557137f65beefaa7c3cf876ca243d3344fdbee15a76725"},"schema_version":"1.0"},"canonical_sha256":"a9ad24e693c0fdae7934453ca2a5ebdef204a3b5b3f3661c79d0f9999a5e0115","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:21.675029Z","signature_b64":"jgYfuET3CoIBwjEM4H2ZMkTDNA46Ff4HZGRECymJILxzkrX2b+Va8XshlVzVpf2nhPQcQ7kKBpyqbFZcew0oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ad24e693c0fdae7934453ca2a5ebdef204a3b5b3f3661c79d0f9999a5e0115","last_reissued_at":"2026-05-18T02:45:21.674427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:21.674427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3437","source_version":3,"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:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGe2AWABCuU8Hwy9wp0vhPelemUf2g3bwOKexOk6NHxoFAmJNjn6VRr2smVG4/d23tyc1q6r9I/uty2RAL93CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:52:03.543567Z"},"content_sha256":"963aeee9d780e0f025b34f10330c856217da08806c4f30682111a70411b0c0a6","schema_version":"1.0","event_id":"sha256:963aeee9d780e0f025b34f10330c856217da08806c4f30682111a70411b0c0a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VGWSJZUTYD6246JUIU6KFJPL33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.CP","q-fin.PM"],"primary_cat":"math.OC","authors_text":"David Papp, Sanjay Mehrotra","submitted_at":"2013-06-14T16:01:59Z","abstract_excerpt":"We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as non-polynomial moments can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum, and stochastic programm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3437","kind":"arxiv","version":3},"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:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpeZ6aaBYyYkuCbb6JiYHagFQQKNM3OEb+HdE635KaxY2Q2sIm8D6OUMiesFaYwa4S8Ki4pImIBfuAGlProaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:52:03.543919Z"},"content_sha256":"21d856a9868ff69e573586e9a795754ee3c5cda6ed92d41779d5b1493f59eaef","schema_version":"1.0","event_id":"sha256:21d856a9868ff69e573586e9a795754ee3c5cda6ed92d41779d5b1493f59eaef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/bundle.json","state_url":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGWSJZUTYD6246JUIU6KFJPL33/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-24T23:52:03Z","links":{"resolver":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33","bundle":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/bundle.json","state":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGWSJZUTYD6246JUIU6KFJPL33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VGWSJZUTYD6246JUIU6KFJPL33","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":"c45bdf56234a485310557137f65beefaa7c3cf876ca243d3344fdbee15a76725","cross_cats_sorted":["q-fin.CP","q-fin.PM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-14T16:01:59Z","title_canon_sha256":"0297653d31005c1bc08e6241f16e7252322fe0ef85fcdf3e6310903c7f32b506"},"schema_version":"1.0","source":{"id":"1306.3437","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3437","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3437v3","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3437","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"VGWSJZUTYD62","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VGWSJZUTYD6246JU","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VGWSJZUT","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:21d856a9868ff69e573586e9a795754ee3c5cda6ed92d41779d5b1493f59eaef","target":"graph","created_at":"2026-05-18T02:45:21Z","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 present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as non-polynomial moments can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum, and stochastic programm","authors_text":"David Papp, Sanjay Mehrotra","cross_cats":["q-fin.CP","q-fin.PM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-14T16:01:59Z","title":"A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3437","kind":"arxiv","version":3},"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:963aeee9d780e0f025b34f10330c856217da08806c4f30682111a70411b0c0a6","target":"record","created_at":"2026-05-18T02:45:21Z","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":"c45bdf56234a485310557137f65beefaa7c3cf876ca243d3344fdbee15a76725","cross_cats_sorted":["q-fin.CP","q-fin.PM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-14T16:01:59Z","title_canon_sha256":"0297653d31005c1bc08e6241f16e7252322fe0ef85fcdf3e6310903c7f32b506"},"schema_version":"1.0","source":{"id":"1306.3437","kind":"arxiv","version":3}},"canonical_sha256":"a9ad24e693c0fdae7934453ca2a5ebdef204a3b5b3f3661c79d0f9999a5e0115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ad24e693c0fdae7934453ca2a5ebdef204a3b5b3f3661c79d0f9999a5e0115","first_computed_at":"2026-05-18T02:45:21.674427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:21.674427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jgYfuET3CoIBwjEM4H2ZMkTDNA46Ff4HZGRECymJILxzkrX2b+Va8XshlVzVpf2nhPQcQ7kKBpyqbFZcew0oBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:21.675029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3437","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:963aeee9d780e0f025b34f10330c856217da08806c4f30682111a70411b0c0a6","sha256:21d856a9868ff69e573586e9a795754ee3c5cda6ed92d41779d5b1493f59eaef"],"state_sha256":"37ba94b1316d3d8018f8d677f813a5a264acd3c545fb4799e6643271b177a056"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21xbmQXNzYZh12+tUGVipWrIUw6zeep8WabUCjpX3FYjrT4zgcUzXZE6/hWz6W5PT5mBpKmmR80ePaG+tihYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:52:03.545911Z","bundle_sha256":"9fa6f417ba130642b3c93c85ca5206a0bf291bff7f439c608d94053dc8f60ed2"}}