{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UIZB6SAGOW62PS2E3W2M2NGYSN","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":"f99e3adba5f8450b746170ab91016e2ff7fe9bd8f95cc019dfa9bcde36d9125e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-04T00:39:00Z","title_canon_sha256":"6015fd25e26343554943ee791613e23ecf3ae820bafe410460b0b2c2ff9a8d39"},"schema_version":"1.0","source":{"id":"1407.1097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1097","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1097v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1097","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"UIZB6SAGOW62","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UIZB6SAGOW62PS2E","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UIZB6SAG","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:f5614dda670e526256e03a892427a67d8dc0df6867a6d8bbcb988c5388008f82","target":"graph","created_at":"2026-05-18T02:48:18Z","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":"Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possible situation that could arise, out of an uncertainty set of possible situations. Classically, the uncertainty set is simply chosen by the user, or it might be estimated in overly simplistic ways with strong assumptions; whereas in this work, we learn the uncertainty set from data ","authors_text":"Cynthia Rudin, Theja Tulabandhula","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-04T00:39:00Z","title":"Robust Optimization using Machine Learning for Uncertainty Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1097","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:e1fa29ee29bc43de15dbac2914587f4a0d614d22177b64104c6a532d155e8a34","target":"record","created_at":"2026-05-18T02:48:18Z","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":"f99e3adba5f8450b746170ab91016e2ff7fe9bd8f95cc019dfa9bcde36d9125e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-04T00:39:00Z","title_canon_sha256":"6015fd25e26343554943ee791613e23ecf3ae820bafe410460b0b2c2ff9a8d39"},"schema_version":"1.0","source":{"id":"1407.1097","kind":"arxiv","version":1}},"canonical_sha256":"a2321f480675bda7cb44ddb4cd34d893450ac76b6cad6058b40834f7190bd18a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2321f480675bda7cb44ddb4cd34d893450ac76b6cad6058b40834f7190bd18a","first_computed_at":"2026-05-18T02:48:18.749498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:18.749498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bYTBN5nZUnbrzxnvIFdueCtsUz0632pCXh5PV0rTdVNtTUuKdSET2TQTRZ7jL7crThJLQlHX7j6DxMg/kTR4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:18.750169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1fa29ee29bc43de15dbac2914587f4a0d614d22177b64104c6a532d155e8a34","sha256:f5614dda670e526256e03a892427a67d8dc0df6867a6d8bbcb988c5388008f82"],"state_sha256":"17fa0a3e5b564a9db89375f605ab3be51799ed96a1e864ea59bd47970e49d55b"}