{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KB4XFEURALUJE6MQNJIB3TMI6A","short_pith_number":"pith:KB4XFEUR","schema_version":"1.0","canonical_sha256":"507972929102e89279906a501dcd88f02b9b4088755eac14cd4349c68b50e3ce","source":{"kind":"arxiv","id":"1711.06403","version":1},"attestation_state":"computed","paper":{"title":"Multi-objective risk-averse two-stage stochastic programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"math.OC","authors_text":"Ali \\.Irfan Mahmuto\\u{g}ullar{\\i}, \\c{C}a\\u{g}{\\i}n Ararat, \\\"Ozlem \\c{C}avu\\c{s}","submitted_at":"2017-11-17T04:48:37Z","abstract_excerpt":"We consider a multi-objective risk-averse two-stage stochastic programming problem with a multivariate convex risk measure. We suggest a convex vector optimization formulation with set-valued constraints and propose an extended version of Benson's algorithm to solve this problem. Using Lagrangian duality, we develop scenario-wise decomposition methods to solve the two scalarization problems appearing in Benson's algorithm. Then, we propose a procedure to recover the primal solutions of these scalarization problems from the solutions of their Lagrangian dual problems. Finally, we test our algor"},"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":"1711.06403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-17T04:48:37Z","cross_cats_sorted":["q-fin.RM"],"title_canon_sha256":"4e3f1a7e056d40d5e6da1fd0b542450c2c9cfe6fca1b2504c45316177d7156eb","abstract_canon_sha256":"72483a3db1b1ac52b4e0a03df35873d43afa6e083d0bac5c6ce1007e6c7ec5ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.191293Z","signature_b64":"0OXExW2ki7aUoIosdF/j+RQbZENkwZ/oTnEtxVjf/NFDeYsl8dRDcYbdWQk1Auwzt9mERJ6IvF14frx6RfkcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"507972929102e89279906a501dcd88f02b9b4088755eac14cd4349c68b50e3ce","last_reissued_at":"2026-05-18T00:30:21.190518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.190518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-objective risk-averse two-stage stochastic programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"math.OC","authors_text":"Ali \\.Irfan Mahmuto\\u{g}ullar{\\i}, \\c{C}a\\u{g}{\\i}n Ararat, \\\"Ozlem \\c{C}avu\\c{s}","submitted_at":"2017-11-17T04:48:37Z","abstract_excerpt":"We consider a multi-objective risk-averse two-stage stochastic programming problem with a multivariate convex risk measure. We suggest a convex vector optimization formulation with set-valued constraints and propose an extended version of Benson's algorithm to solve this problem. Using Lagrangian duality, we develop scenario-wise decomposition methods to solve the two scalarization problems appearing in Benson's algorithm. Then, we propose a procedure to recover the primal solutions of these scalarization problems from the solutions of their Lagrangian dual problems. Finally, we test our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06403","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.06403","created_at":"2026-05-18T00:30:21.190669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06403v1","created_at":"2026-05-18T00:30:21.190669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06403","created_at":"2026-05-18T00:30:21.190669+00:00"},{"alias_kind":"pith_short_12","alias_value":"KB4XFEURALUJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KB4XFEURALUJE6MQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KB4XFEUR","created_at":"2026-05-18T12:31:24.725408+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/KB4XFEURALUJE6MQNJIB3TMI6A","json":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A.json","graph_json":"https://pith.science/api/pith-number/KB4XFEURALUJE6MQNJIB3TMI6A/graph.json","events_json":"https://pith.science/api/pith-number/KB4XFEURALUJE6MQNJIB3TMI6A/events.json","paper":"https://pith.science/paper/KB4XFEUR"},"agent_actions":{"view_html":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A","download_json":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A.json","view_paper":"https://pith.science/paper/KB4XFEUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06403&json=true","fetch_graph":"https://pith.science/api/pith-number/KB4XFEURALUJE6MQNJIB3TMI6A/graph.json","fetch_events":"https://pith.science/api/pith-number/KB4XFEURALUJE6MQNJIB3TMI6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A/action/storage_attestation","attest_author":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A/action/author_attestation","sign_citation":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A/action/citation_signature","submit_replication":"https://pith.science/pith/KB4XFEURALUJE6MQNJIB3TMI6A/action/replication_record"}},"created_at":"2026-05-18T00:30:21.190669+00:00","updated_at":"2026-05-18T00:30:21.190669+00:00"}