{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XYNCRE7EIT4O55HTHDRMX2FNT5","short_pith_number":"pith:XYNCRE7E","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"},"canonical_sha256":"be1a2893e444f8eef4f338e2cbe8ad9f7fdfb4311b0e937cc603a9d6ce1b9058","source":{"kind":"arxiv","id":"1208.2113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2113","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2113v1","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2113","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"XYNCRE7EIT4O","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XYNCRE7EIT4O55HT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XYNCRE7E","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XYNCRE7EIT4O55HTHDRMX2FNT5","target":"record","payload":{"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"},"canonical_sha256":"be1a2893e444f8eef4f338e2cbe8ad9f7fdfb4311b0e937cc603a9d6ce1b9058","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"},"source_kind":"arxiv","source_id":"1208.2113","source_version":1,"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:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qP87uASgC+YT+SrJ3QAF0FkPrEMcrIMTJLimKKlGJ+K6VnN0QaHjdaKDoncrRrkIP2U0l9c8RaivF96g/JIaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:32:05.705423Z"},"content_sha256":"f5c2ffe2b12729f79510a3802dbbedf2ace88c2a8be0678e7b47f518826acaeb","schema_version":"1.0","event_id":"sha256:f5c2ffe2b12729f79510a3802dbbedf2ace88c2a8be0678e7b47f518826acaeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XYNCRE7EIT4O55HTHDRMX2FNT5","target":"graph","payload":{"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"},"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:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"loCI7Rjgqk3BYt5w0x1u1Qp4Y87Zmh7A3s6zQjYqmrGUzh2pH8PdArV/AALDyesVmT5E9Z8Qw2U3jqYXrnfmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:32:05.705799Z"},"content_sha256":"52c9c0f1c17a2f667906e2d901271d4c5bb16a58d741162902e6e2375b767593","schema_version":"1.0","event_id":"sha256:52c9c0f1c17a2f667906e2d901271d4c5bb16a58d741162902e6e2375b767593"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/bundle.json","state_url":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/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-25T07:32:05Z","links":{"resolver":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5","bundle":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/bundle.json","state":"https://pith.science/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYNCRE7EIT4O55HTHDRMX2FNT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XYNCRE7EIT4O55HTHDRMX2FNT5","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":"fec36fee51ba843c4f228406b785dcf061e5d51140465f3999861b6fde332cb0","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ME","submitted_at":"2012-08-10T08:42:23Z","title_canon_sha256":"a9c9f23ed8a36159af741a3fd81460ec02a8797d230c1e70a78e4166e64564e7"},"schema_version":"1.0","source":{"id":"1208.2113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2113","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2113v1","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2113","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"XYNCRE7EIT4O","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XYNCRE7EIT4O55HT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XYNCRE7E","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:52c9c0f1c17a2f667906e2d901271d4c5bb16a58d741162902e6e2375b767593","target":"graph","created_at":"2026-05-18T00:27:57Z","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":"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","authors_text":"Karl Mosler, Pavel Bazovkin","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ME","submitted_at":"2012-08-10T08:42:23Z","title":"Stochastic linear programming with a distortion risk constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2113","kind":"arxiv","version":1},"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:f5c2ffe2b12729f79510a3802dbbedf2ace88c2a8be0678e7b47f518826acaeb","target":"record","created_at":"2026-05-18T00:27:57Z","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":"fec36fee51ba843c4f228406b785dcf061e5d51140465f3999861b6fde332cb0","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ME","submitted_at":"2012-08-10T08:42:23Z","title_canon_sha256":"a9c9f23ed8a36159af741a3fd81460ec02a8797d230c1e70a78e4166e64564e7"},"schema_version":"1.0","source":{"id":"1208.2113","kind":"arxiv","version":1}},"canonical_sha256":"be1a2893e444f8eef4f338e2cbe8ad9f7fdfb4311b0e937cc603a9d6ce1b9058","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be1a2893e444f8eef4f338e2cbe8ad9f7fdfb4311b0e937cc603a9d6ce1b9058","first_computed_at":"2026-05-18T00:27:57.925407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:57.925407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85lptFXvjVWlGWWuxPHSOBXFDt65qmfJxV2aaVSpOtOA05d7bkDejVY8Dp9nDerDYJgm/8vRvGd64/A5XDHqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:57.926150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5c2ffe2b12729f79510a3802dbbedf2ace88c2a8be0678e7b47f518826acaeb","sha256:52c9c0f1c17a2f667906e2d901271d4c5bb16a58d741162902e6e2375b767593"],"state_sha256":"699067c4944a5fd959a6bed005ab80a21a97617860ad6b087296ef8d6027aa9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ux8XfnrbsbSX/dv7Qru9IqF2aYQ/Op7hd0Q2FF5wc9QaLbmJr66v2F0D196pzhhK2QDZj2Y3jfSocTq1o+PnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:32:05.707872Z","bundle_sha256":"2e264ce08960f87a3cd85235ad47ede5884740a44465543ee68aab0d8857e01a"}}