{"as_of":"2026-08-20T07:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70e0cba1b0570978b3ec9b305972b750b50f99edd76a9f184f17d14523f83a50","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:36:15.888509Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:04:28.508844Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T14:46:45.254926Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"cited_work":{"arxiv_id":"2412.15406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.15406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributionally robust regret minimization.arXiv preprint arXiv:2412.15406","venue":null,"work_id":"65325125-45e4-4638-a478-23bc649fc5e0","year":null},"citing_paper":{"arxiv_id":"2605.00155","last_updated":"2026-08-09T20:29:32Z","snapshot_observed_at":"2026-08-15T21:51:37.517830Z","submitted_at":"2026-04-30T19:22:56Z","title":"Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-09T21:03:53.045304Z"},"links":{"cited_paper":"/paper/2412.15406","citing_paper":"/paper/2605.00155"},"observation_digest":"sha256:89f4edeaaeef45bed75fed71bc4b5efc8497e86a7da8371c453e5567dff77cab","observation_id":"5b7d676f-64bf-45fd-a3cf-2d5d60d43e92","resolution":{"observed_at":"2026-05-11T14:46:45.362821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15406","snapshot_observed_at":"2026-08-15T15:04:28.508844Z","title":"arXiv:2412.15406 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03075","last_updated":"2026-08-04T03:39:43Z","snapshot_observed_at":"2026-08-19T12:15:32.039048Z","submitted_at":"2026-08-04T03:39:43Z","title":"Oracle-Based Distributionally Robust Optimization under Optimal Transport Ambiguity Sets","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T15:04:28.508844Z"},"links":{"cited_paper":"/paper/2412.15406","citing_paper":"/paper/2608.03075"},"observation_digest":"sha256:d7ba93a2dd7b3b76fe2bece32d539a33ce769d6d542a049ca2b4068035039eb9","observation_id":"e1993333-0329-4ce0-9967-ee1e1c798fcb","resolution":{"observed_at":"2026-08-15T15:04:28.508844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.15406/citation-record","integrity":"/paper/2412.15406/integrity","json":"/paper/2412.15406/citation-record.json","paper":"/paper/2412.15406"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.232041Z","title":"A distributi onally robust approach to regret optimal control using the wasserstein distance","venue":null,"work_id":"2a45d26e-fc03-4c62-b7f2-28d041b05c3a","year":2023},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.790144Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:ba6f19877a5995c160d7b8d339a42cebb4924b8124fe51049a4a96219422f571","observation_id":"150ffcd7-7c8f-49ed-9668-60f44e20f2a5","resolution":{"observed_at":"2026-08-11T11:36:16.235762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.221312Z","title":"Coherent measures of risk","venue":null,"work_id":"ed8d8ca3-2ea0-4c04-814f-ad77e638c05e","year":1999},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.794838Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:073443b5b59cc1505db0a9057d07fb89b1b0ba115846538b869c77db1929d38e","observation_id":"946cf080-fcbf-4347-b262-f53cecc1200c","resolution":{"observed_at":"2026-08-11T11:36:16.225005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.210475Z","title":"Minmax regret linear resource allocatio n problems","venue":null,"work_id":"df93ec49-7f14-4096-856d-b2f587e47f28","year":2004},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.798764Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:95c9be70e973ce649917e2f5a009d73c9767889af70839987a03570fe92d456a","observation_id":"c8762730-7254-4264-9661-53ad1ffc3b31","resolution":{"observed_at":"2026-08-11T11:36:16.214077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.199519Z","title":"On the complexity of m inmax regret linear programming","venue":null,"work_id":"e7899b98-e950-4413-affe-f63ecd18b098","year":2005},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.802485Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:0e1f173b19ebad669b8b61801edbaa4771a588cb6c57436bf798cd67ef50e75f","observation_id":"4d1fdf6f-7814-49b6-9254-0d5f88bb724e","resolution":{"observed_at":"2026-08-11T11:36:16.203235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.188858Z","title":"Deriving robust counterparts of nonlinear uncertain inequalities","venue":null,"work_id":"6257a537-bd98-4979-b94e-b4d12f8bddd0","year":2015},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.806387Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:1ac048519d897a01f28110f292b8c12e637eab1f987b517f3dede63546d388bc","observation_id":"4cd38c9c-6bb2-4759-ab3d-d328eeb375f8","resolution":{"observed_at":"2026-08-11T11:36:16.192545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.178937Z","title":"Robust optimization, volume 28","venue":null,"work_id":"50fcfa0f-0358-4715-857a-1263cbf93168","year":2009},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.810457Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:91945294ea94ff347a2641c4ed9dfdb16d643082103de62ccff0af048cf01045","observation_id":"f022454d-a009-4b52-9fa2-f8f3417978fd","resolution":{"observed_at":"2026-08-11T11:36:16.182684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.168890Z","title":"Robust solutions of uncertain linear programs","venue":null,"work_id":"d47a9a7e-3a65-4c01-b45c-44ee51aa7bed","year":1999},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.814402Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:32c5152e88ff2529f1728bdbe2b6ab23202e2ed5ac5ad73f87bc88ff34e5c682","observation_id":"f58ca4f7-8cae-4d52-9773-1503adecf0ec","resolution":{"observed_at":"2026-08-11T11:36:16.172576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.158908Z","title":"Relative robust an d adaptive optimization","venue":null,"work_id":"d9b63910-0a38-4557-84d5-7ba19e4e5dca","year":2020},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.818076Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:a1e638d6942dfee53490162e59921af824b287e271535fb45ca69c388d4335a1","observation_id":"f8f5bddc-0ce2-46b3-ab4e-2302aafa0ef0","resolution":{"observed_at":"2026-08-11T11:36:16.162460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.148671Z","title":"Quantifying distrib utional model risk via optimal trans- port","venue":null,"work_id":"1217ccb7-2c58-43d2-9d8c-82b506e48058","year":2019},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.821457Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:790aadd712d2e663287d7c128fdda063e72b208c322bb9ce48d542615c4ebb1f","observation_id":"cf639756-9ee0-4f8a-979c-bc395129bb0f","resolution":{"observed_at":"2026-08-11T11:36:16.152244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.138400Z","title":"A variational approac h to lagrange multipliers","venue":null,"work_id":"15884c6f-4542-4d69-80c7-100b7a609d5d","year":2016},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.825249Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:2586a456655711fb39ce66fec2ee1605fe6be3b97b5ca8b4639182d689fbb91d","observation_id":"8f9467b6-57bc-4110-8bbe-7091993f5860","resolution":{"observed_at":"2026-08-11T11:36:16.141915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.127762Z","title":"Regret in the newsvendor model w ith demand and yield randomness","venue":null,"work_id":"ad083942-1421-4cfd-9a64-2abd562eecba","year":2021},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.828749Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:0d06154f23bbf83e8f40b0a7f32d33b046f274d8d82163496323f99cd6bf6070","observation_id":"3f707662-e842-4ddf-a2d4-7f40553d0510","resolution":{"observed_at":"2026-08-11T11:36:16.131537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.116887Z","title":"Wasserstein distributi onally robust regret minimization","venue":null,"work_id":"d05f58dc-646f-4e9a-8a42-9eeb235497af","year":2024},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.832468Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:0c637f69c36d91c8cf142fcc44327d24d68fbfd46d922bf9c19d4ffb801f2593","observation_id":"adafb174-d146-4a1e-8d6b-9cef619b6a79","resolution":{"observed_at":"2026-08-11T11:36:16.120838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.105971Z","title":"On the complexity of the continuous unbo unded knapsack problem with uncertain coefficients","venue":null,"work_id":"06b7273b-da31-4a31-b387-b54fdc6900ab","year":2005},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.835961Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:4eeafd4b8b1733fe791205fba80f9a5977d07c3f894a39e4cd12e4f0520aa4e4","observation_id":"6e5c7508-2107-4be6-8875-1166d717e261","resolution":{"observed_at":"2026-08-11T11:36:16.109889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.095416Z","title":"Robustness and dual ity in linear programming","venue":null,"work_id":"2d03be11-b9b8-4c25-a804-46943400c818","year":2010},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.839736Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:a66d9cccddd285797a832b5042b0d3910521e2b36beb622af5321288104f3eef","observation_id":"51ca996c-7a6e-4538-b76b-1d08227d7e3d","resolution":{"observed_at":"2026-08-11T11:36:16.099023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.083424Z","title":"Distributionally robust st ochastic optimization with Wasserstein distance","venue":null,"work_id":"f90e0d15-68cf-4c26-b1f9-c5442bc17de5","year":2023},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.843332Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:46437f8abd466e5e581ba42070c01c24aa2d7ec092b90067eb419dcbd63497d7","observation_id":"d1fb4515-ac71-4bba-b7a3-4700fac7d4bc","resolution":{"observed_at":"2026-08-11T11:36:16.088001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.072440Z","title":"Wassers tein distributionally robust regret- optimal control under partial observability","venue":null,"work_id":"03d6d84c-ed7a-4cbb-a857-046886c6ec94","year":2023},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.846796Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:1b7ddeaadf1a20b3aa34a6b25ba7b4ec30fca8ebd225de29ca5488af1abb9b27","observation_id":"e9d453ec-419d-4483-ada2-5252f8bd6d89","resolution":{"observed_at":"2026-08-11T11:36:16.076163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.061438Z","title":"computational complexity of stochastic programming problems","venue":null,"work_id":"1d2ee1dc-6662-42d1-8983-6c2e07b92334","year":2016},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.850424Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:dff83a343fba5cef5a3a6d50eac1a6586067391619eccf0bc42058f48ecad519","observation_id":"f57452c1-00c5-4e3b-a623-b29c2ff98976","resolution":{"observed_at":"2026-08-11T11:36:16.065426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.049112Z","title":"Wasserstein distributionally robust regret-optimal control over infinite-horizon","venue":null,"work_id":"6a0a2691-2c73-4cf3-bb35-5b3a5e6d4aa1","year":2024},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.853785Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:377febb0db5a44768f2673e9a0f7afe756e0261c1df327b92dda0b551c5c4f36","observation_id":"4db03315-1200-4d9b-85b9-aee79ea572ef","resolution":{"observed_at":"2026-08-11T11:36:16.053041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.037836Z","title":"Wasserstein distributionally robust optimizatio n: Theory and applications in machine learning","venue":null,"work_id":"2e818d74-7f75-4051-bb98-e5173fb86479","year":2019},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.857191Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:91840a664783908e1b2a51136d65c6da7360869d4dc0138dcbfb98bcb335f340","observation_id":"11770393-b6a7-4de7-8bed-7f8c1f4a0d6e","resolution":{"observed_at":"2026-08-11T11:36:16.041971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.026341Z","title":"A variable-complexit y norm maximization problem","venue":null,"work_id":"fddeb2cc-bfc6-43f9-8f87-30d75c9c069b","year":1986},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.860399Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:5fda590c25ea5386a859ea2e367f8a1f4bf9f1d19172177cda8f0cc77b20556c","observation_id":"7321a656-7453-478d-b9c9-2608de344c41","resolution":{"observed_at":"2026-08-11T11:36:16.030432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.014099Z","title":"Data-drive n distributionally robust optimiza- tion using the Wasserstein metric: Performance guarantees and tractable reformulations","venue":null,"work_id":"375cbb90-a81f-4c46-b3a9-c5d838589edd","year":2018},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.863299Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:26c4a6b2236fcc76bd5a1c8ae1bb7f386a57adced244874a3d01cbff3bec4daa","observation_id":"5da7b8a8-f58d-4d3f-bf15-066a36fcb7fa","resolution":{"observed_at":"2026-08-11T11:36:16.018343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:16.002663Z","title":"A p robabilistic model for minmax regret in combinatorial optimization","venue":null,"work_id":"342df363-9058-4c44-abfd-ec07cc70f49e","year":2014},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.867010Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:be6af8a35a414569fcfb4a8737777725af806509f906e7f8b2ac29c5c0f7834a","observation_id":"24fa589a-089b-4212-974f-6297660ebd7d","resolution":{"observed_at":"2026-08-11T11:36:16.006641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.990768Z","title":"Regret in the news vendor model with partial informa- tion","venue":null,"work_id":"03ad8e15-c850-42d9-84fa-945daedbbefe","year":2008},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.869996Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:636c860f3378e5284773295ec464ada5210ef3fb0d7f148ab9b51cbd686e943d","observation_id":"6b971aad-d0db-469b-96ae-1c93b72cc3c0","resolution":{"observed_at":"2026-08-11T11:36:15.995175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.978049Z","title":"Adjustable robus t optimization reformulations of two- stage worst-case regret minimization problems","venue":null,"work_id":"a537f8a3-694b-4928-a51f-3605f66b4a4a","year":2022},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.872916Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:861247e67b8a8e0b7caa191d158c520f03db69950e8bf2c6ddf138f8ab2076bb","observation_id":"4d17cdc1-f02d-4299-a7a7-bc3819086742","resolution":{"observed_at":"2026-08-11T11:36:15.982460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.965454Z","title":"Risk-averse regret minimization in multistage stochastic programs","venue":null,"work_id":"cf5fdf8d-f06f-4af6-a6b6-05a871a61463","year":2024},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.875862Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:9cc25001599bafc7db40a615acc527cc6a75842b48d04134c1e884a522bd7f11","observation_id":"47982d49-ebc0-43b8-8157-c5ddede29cba","resolution":{"observed_at":"2026-08-11T11:36:15.969507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.953238Z","title":"The theory of statistical decision","venue":null,"work_id":"62e0ebe3-010d-49be-90c4-b4b589f009df","year":1951},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.878962Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:70bc497260d1c6df0cd6124ce457073401e8d5ba942e54cd8438accdddd715b3","observation_id":"ea352e59-ceba-4739-9687-ac6258702453","resolution":{"observed_at":"2026-08-11T11:36:15.957195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.938055Z","title":"Expect ed value of distribution information for the newsvendor problem","venue":null,"work_id":"97af3529-7968-4e11-9a07-a5d2cec0f4fc","year":2006},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.881912Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:9dcc7cdc38f53d744843829428228a9d3bf60dabaa45238b92a86737e74a8111","observation_id":"e5ff6fb4-d04b-485e-b937-b6c009226875","resolution":{"observed_at":"2026-08-11T11:36:15.945179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.926882Z","title":"On l inear optimization over wasser- stein balls","venue":null,"work_id":"f6119d5c-1945-4d76-9335-93b24ad5a787","year":2022},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.885146Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:3e7f7c954286d566dcc2c35a69ac7cb0ac436a255a355442016bb522f6e31cca","observation_id":"107f265c-246f-4c88-8178-8c54979346d9","resolution":{"observed_at":"2026-08-11T11:36:15.930647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:36:15.913726Z","title":"Newsvendor optim ization with limited distribution information","venue":null,"work_id":"9e9a1195-a889-4d4f-a1e6-558f77c0ec56","year":2013},"citing_paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T11:36:15.888509Z"},"links":{"citing_paper":"/paper/2412.15406"},"observation_digest":"sha256:5015c86e07a27e76035b12ac0d3fd42481842bb0aed62e2ea44d0cd0630950b6","observation_id":"d1aed845-07c6-44cd-aa06-e787372c2e36","resolution":{"observed_at":"2026-08-11T11:36:15.919290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.15406","last_updated":"2024-12-19T21:18:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T08:45:42.221635Z","submitted_at":"2024-12-19T21:18:49Z","title":"Distributionally Robust Regret Minimization"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 2 inbound Pith citation observations for arXiv:2412.15406."}