{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VGWSJZUTYD6246JUIU6KFJPL33","short_pith_number":"pith:VGWSJZUT","schema_version":"1.0","canonical_sha256":"a9ad24e693c0fdae7934453ca2a5ebdef204a3b5b3f3661c79d0f9999a5e0115","source":{"kind":"arxiv","id":"1306.3437","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.3437","created_at":"2026-05-18T02:45:21.674496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3437v3","created_at":"2026-05-18T02:45:21.674496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3437","created_at":"2026-05-18T02:45:21.674496+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGWSJZUTYD62","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGWSJZUTYD6246JU","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGWSJZUT","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33","json":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33.json","graph_json":"https://pith.science/api/pith-number/VGWSJZUTYD6246JUIU6KFJPL33/graph.json","events_json":"https://pith.science/api/pith-number/VGWSJZUTYD6246JUIU6KFJPL33/events.json","paper":"https://pith.science/paper/VGWSJZUT"},"agent_actions":{"view_html":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33","download_json":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33.json","view_paper":"https://pith.science/paper/VGWSJZUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3437&json=true","fetch_graph":"https://pith.science/api/pith-number/VGWSJZUTYD6246JUIU6KFJPL33/graph.json","fetch_events":"https://pith.science/api/pith-number/VGWSJZUTYD6246JUIU6KFJPL33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/action/storage_attestation","attest_author":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/action/author_attestation","sign_citation":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/action/citation_signature","submit_replication":"https://pith.science/pith/VGWSJZUTYD6246JUIU6KFJPL33/action/replication_record"}},"created_at":"2026-05-18T02:45:21.674496+00:00","updated_at":"2026-05-18T02:45:21.674496+00:00"}