{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XYNCRE7EIT4O55HTHDRMX2FNT5","short_pith_number":"pith:XYNCRE7E","schema_version":"1.0","canonical_sha256":"be1a2893e444f8eef4f338e2cbe8ad9f7fdfb4311b0e937cc603a9d6ce1b9058","source":{"kind":"arxiv","id":"1208.2113","version":1},"attestation_state":"computed","paper":{"title":"Stochastic linear programming with a distortion risk constraint","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"stat.ME","authors_text":"Karl Mosler, Pavel Bazovkin","submitted_at":"2012-08-10T08:42:23Z","abstract_excerpt":"Linear optimization problems are investigated whose parameters are uncertain. We apply coherent distortion risk measures to capture the possible violation of a restriction. Each risk constraint induces an uncertainty set of coefficients, which is shown to be a weighted-mean trimmed region. Given an external sample of the coefficients, an uncertainty set is a convex polytope that can be exactly calculated. We construct an efficient geometrical algorithm to solve stochastic linear programs that have a single distortion risk constraint. The algorithm is available as an R-package. Also the algorit"},"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":"1208.2113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ME","submitted_at":"2012-08-10T08:42:23Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"a9c9f23ed8a36159af741a3fd81460ec02a8797d230c1e70a78e4166e64564e7","abstract_canon_sha256":"fec36fee51ba843c4f228406b785dcf061e5d51140465f3999861b6fde332cb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:57.926150Z","signature_b64":"85lptFXvjVWlGWWuxPHSOBXFDt65qmfJxV2aaVSpOtOA05d7bkDejVY8Dp9nDerDYJgm/8vRvGd64/A5XDHqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be1a2893e444f8eef4f338e2cbe8ad9f7fdfb4311b0e937cc603a9d6ce1b9058","last_reissued_at":"2026-05-18T00:27:57.925407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:57.925407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic linear programming with a distortion risk constraint","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"stat.ME","authors_text":"Karl Mosler, Pavel Bazovkin","submitted_at":"2012-08-10T08:42:23Z","abstract_excerpt":"Linear optimization problems are investigated whose parameters are uncertain. We apply coherent distortion risk measures to capture the possible violation of a restriction. Each risk constraint induces an uncertainty set of coefficients, which is shown to be a weighted-mean trimmed region. Given an external sample of the coefficients, an uncertainty set is a convex polytope that can be exactly calculated. We construct an efficient geometrical algorithm to solve stochastic linear programs that have a single distortion risk constraint. The algorithm is available as an R-package. Also the algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2113","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":"1208.2113","created_at":"2026-05-18T00:27:57.925535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2113v1","created_at":"2026-05-18T00:27:57.925535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2113","created_at":"2026-05-18T00:27:57.925535+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYNCRE7EIT4O","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYNCRE7EIT4O55HT","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYNCRE7E","created_at":"2026-05-18T12:27:27.928770+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/XYNCRE7EIT4O55HTHDRMX2FNT5","json":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5.json","graph_json":"https://pith.science/api/pith-number/XYNCRE7EIT4O55HTHDRMX2FNT5/graph.json","events_json":"https://pith.science/api/pith-number/XYNCRE7EIT4O55HTHDRMX2FNT5/events.json","paper":"https://pith.science/paper/XYNCRE7E"},"agent_actions":{"view_html":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5","download_json":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5.json","view_paper":"https://pith.science/paper/XYNCRE7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2113&json=true","fetch_graph":"https://pith.science/api/pith-number/XYNCRE7EIT4O55HTHDRMX2FNT5/graph.json","fetch_events":"https://pith.science/api/pith-number/XYNCRE7EIT4O55HTHDRMX2FNT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/action/storage_attestation","attest_author":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/action/author_attestation","sign_citation":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/action/citation_signature","submit_replication":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/action/replication_record"}},"created_at":"2026-05-18T00:27:57.925535+00:00","updated_at":"2026-05-18T00:27:57.925535+00:00"}