{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DEL6DLJY5KCUDLQBAOWNBHHKEG","short_pith_number":"pith:DEL6DLJY","schema_version":"1.0","canonical_sha256":"1917e1ad38ea8541ae0103acd09cea219517b5b9bbf4799f1fdc07f2ce26aec8","source":{"kind":"arxiv","id":"2412.15406","version":1},"attestation_state":"computed","paper":{"title":"Distributionally Robust Regret Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eilyan Bitar","submitted_at":"2024-12-19T21:18:49Z","abstract_excerpt":"We consider decision-making problems involving the optimization of linear objective functions with uncertain coefficients. The probability distribution of the coefficients--which are assumed to be stochastic in nature--is unknown to the decision maker but is assumed to lie within a given ambiguity set, defined as a type-1 Wasserstein ball centered at a given nominal distribution. To account for this uncertainty, we minimize the worst-case expected regret over all distributions in the ambiguity set. Here, the (ex post) regret experienced by the decision maker is defined as the difference betwee"},"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":"2412.15406","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-19T21:18:49Z","cross_cats_sorted":[],"title_canon_sha256":"f71cbcc562daf7290771c712b95f7afabe1f6795314d11c86a2c0e6e3d6e7488","abstract_canon_sha256":"da285cfb6cb948490949c874dd32b04776a6c9e488c8f9d466d0e5606613c7d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:22.806465Z","signature_b64":"t1inoXTL0jgsPm8LDbcBKABAO8XWETOjnSLyAMHBmAR/ZjuAnWazDzW/2XsEA1/PNUIBHuqQh9Lh34+I55P0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1917e1ad38ea8541ae0103acd09cea219517b5b9bbf4799f1fdc07f2ce26aec8","last_reissued_at":"2026-07-05T09:52:22.805961Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:22.805961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally Robust Regret Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eilyan Bitar","submitted_at":"2024-12-19T21:18:49Z","abstract_excerpt":"We consider decision-making problems involving the optimization of linear objective functions with uncertain coefficients. The probability distribution of the coefficients--which are assumed to be stochastic in nature--is unknown to the decision maker but is assumed to lie within a given ambiguity set, defined as a type-1 Wasserstein ball centered at a given nominal distribution. To account for this uncertainty, we minimize the worst-case expected regret over all distributions in the ambiguity set. Here, the (ex post) regret experienced by the decision maker is defined as the difference betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15406","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.15406/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.15406","created_at":"2026-07-05T09:52:22.806025+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.15406v1","created_at":"2026-07-05T09:52:22.806025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15406","created_at":"2026-07-05T09:52:22.806025+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEL6DLJY5KCU","created_at":"2026-07-05T09:52:22.806025+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEL6DLJY5KCUDLQB","created_at":"2026-07-05T09:52:22.806025+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEL6DLJY","created_at":"2026-07-05T09:52:22.806025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00155","citing_title":"Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG","json":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG.json","graph_json":"https://pith.science/api/pith-number/DEL6DLJY5KCUDLQBAOWNBHHKEG/graph.json","events_json":"https://pith.science/api/pith-number/DEL6DLJY5KCUDLQBAOWNBHHKEG/events.json","paper":"https://pith.science/paper/DEL6DLJY"},"agent_actions":{"view_html":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG","download_json":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG.json","view_paper":"https://pith.science/paper/DEL6DLJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.15406&json=true","fetch_graph":"https://pith.science/api/pith-number/DEL6DLJY5KCUDLQBAOWNBHHKEG/graph.json","fetch_events":"https://pith.science/api/pith-number/DEL6DLJY5KCUDLQBAOWNBHHKEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG/action/storage_attestation","attest_author":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG/action/author_attestation","sign_citation":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG/action/citation_signature","submit_replication":"https://pith.science/pith/DEL6DLJY5KCUDLQBAOWNBHHKEG/action/replication_record"}},"created_at":"2026-07-05T09:52:22.806025+00:00","updated_at":"2026-07-05T09:52:22.806025+00:00"}