{"as_of":"2026-08-17T09:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb07066f8f24ee46605ab54302c1bc0c8c392bcefb61ead77907d014cebdf643","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T08:43:20.719860Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.24983/citation-record","integrity":"/paper/2607.24983/integrity","json":"/paper/2607.24983/citation-record.json","paper":"/paper/2607.24983"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.717333Z","title":"For each day 𝑡, the input context𝑋 𝑡 is a historical demand window","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.717333Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:d9190c24d4c5902b789f39d092ade42a7629b7f1a29419fe53ec877ed5da7a36","observation_id":"7db9625f-31b7-494d-b49e-d3590597700d","resolution":{"observed_at":"2026-07-31T08:43:20.717333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.706506Z","title":"The KL term in (2.7) is nonnegative, hence OT𝜀(𝛼,𝛽)⩾𝑊 2 2(𝛼,𝛽)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.706506Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:3e85fe9b3fddbf0c94e040b77d11645f9b36ae72f5375428c85abe44ba5af595","observation_id":"e9b791fd-eb7e-4fea-b1ad-e2bc63dd1e12","resolution":{"observed_at":"2026-07-31T08:43:20.706506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.714835Z","title":"The loss is the multi-product newsvendor cost 𝑓(𝑤,𝑌)= 20∑︁ 𝑗=1 𝑐𝑢,𝑗(𝑌𝑗−𝑤 𝑗)++𝑐 𝑜,𝑗(𝑤𝑗−𝑌𝑗)+","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.714835Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:6d2ee0e83fe0c66fa4ec554cab06d8bf24b9229c98e8cdeee1719837ae937d35","observation_id":"89a6be96-c346-4ea7-bdf4-2e1cb98e085e","resolution":{"observed_at":"2026-07-31T08:43:20.714835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.670958Z","title":"Rui Gao, Xi Chen, and Anton J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.670958Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:310de2eb620720b98732ee3612e2737172bdc398ae6799be839f7b9ffd43bea1","observation_id":"40c174c0-867d-4396-b689-9af0992cb9a0","resolution":{"observed_at":"2026-07-31T08:43:20.670958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.679296Z","title":"Ivan Kobyzev, Simon J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.679296Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:84cd5635f25c48bedde396424523fb85ba578dd51569449a508491f925a03cd6","observation_id":"7b1d7d7c-d04c-44b7-a595-9a0df5053d2f","resolution":{"observed_at":"2026-07-31T08:43:20.679296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02549","last_updated":"2025-05-26T19:59:17Z","snapshot_observed_at":"2026-08-16T13:03:01.274326Z","submitted_at":"2024-11-04T19:32:24Z","title":"Distributionally Robust Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.02549","snapshot_observed_at":"2026-07-31T08:43:20.684224Z","title":"Xutao Ma, Chao Ning, and Wenli Du","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.684224Z"},"links":{"cited_paper":"/paper/2411.02549","citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:0d728665c1b9e79472327448cb2a75823047329daa7d6e737b25abc213d086f9","observation_id":"ac90ba06-d525-4d80-88bd-d3657985a4f6","resolution":{"observed_at":"2026-07-31T08:43:20.684224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.687354Z","title":"Hongseok Namkoong and John C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.687354Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:eb41df26b187145684c21111719fb5939b2a137d40d80659e4ea22610b3d7a9f","observation_id":"95fd1546-fc4a-4245-abee-a65b86c05fd5","resolution":{"observed_at":"2026-07-31T08:43:20.687354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.690507Z","title":"Hamed Rahimian and Sanjay Mehrotra","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.690507Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:5363334decb44e24a231b3e9245d3d7e8a0b2eef626a6bdece6c96006504a1b4","observation_id":"da2efc27-027f-40b2-9b64-ac81bd0f8fbe","resolution":{"observed_at":"2026-07-31T08:43:20.690507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.693144Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.693144Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:31c26a9a2c37891a53c5ccf47dc1184c02134345bb52350047db5b66cb8533eb","observation_id":"046a57b5-6f7c-4cd7-a91b-5420eef8e855","resolution":{"observed_at":"2026-07-31T08:43:20.693144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06353","last_updated":"2022-07-07T06:33:53Z","snapshot_observed_at":"2026-08-16T18:10:15.138420Z","submitted_at":"2021-07-13T19:26:34Z","title":"Distributionally Robust Policy Learning via Adversarial Environment Generation","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06353","snapshot_observed_at":"2026-07-31T08:43:20.695724Z","title":"Aman Sinha, Hongseok Namkoong, Riccardo Volpi, and John Duchi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.695724Z"},"links":{"cited_paper":"/paper/2107.06353","citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:b4e1e7e735f24abc3f4902c313b3a1185818c43119747029c55aa98ae3843887","observation_id":"448cef79-e40b-415f-b7d6-e766401a432d","resolution":{"observed_at":"2026-07-31T08:43:20.695724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.698615Z","title":"Learning decision-focused uncertainty sets in robust optimization, 2025a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.698615Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:ffb98a49e8f597ac78204ed7c5f6536fe966e3627eb915f11cc4949f63e43226","observation_id":"3d80b908-31b1-484e-8e98-9e3c6b804be4","resolution":{"observed_at":"2026-07-31T08:43:20.698615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.22923","last_updated":"2025-06-26T20:48:14Z","snapshot_observed_at":"2026-08-16T12:45:48.705105Z","submitted_at":"2025-03-29T01:01:02Z","title":"Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.22923","snapshot_observed_at":"2026-07-31T08:43:20.703435Z","title":"Martin Zinkevich","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.703435Z"},"links":{"cited_paper":"/paper/2503.22923","citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:654e08aa15cf8d72c970fc39dd4b6ec4241fc0ca001e12762693ca32e89ea715","observation_id":"9cb1a388-dae1-47ab-8125-57f2f9bce6ae","resolution":{"observed_at":"2026-07-31T08:43:20.703435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.709521Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.709521Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:4ab079e41fb7b9a56ad61cda851d29b39cb5b1f38bb4b0ef9a29e4a189854e8b","observation_id":"6a22b537-593b-4228-99ff-1b8163a797bc","resolution":{"observed_at":"2026-07-31T08:43:20.709521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.712267Z","title":"The decision update uses the average outer subgradient over the active inner adversaries","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.712267Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:74ab15a1cd44122da0bc45e583c76abe55d32b8cf30e1723f67145d0237122b3","observation_id":"9dc12d19-6055-4ce5-b3e8-ca5b57f52f42","resolution":{"observed_at":"2026-07-31T08:43:20.712267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.719860Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.719860Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:c9494cae18b7dd200fae06d4a5c88a939589785d2751c71d81d5b0dbffc2aa7f","observation_id":"5ca0eee8-a3e2-4db7-8609-130be940dee0","resolution":{"observed_at":"2026-07-31T08:43:20.719860Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.662153Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.662153Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:65e9e676e9d768ee7b369d24df3e573d7c7a06e8ed9df23c91ee1f1ac389c829","observation_id":"6187df99-3335-4dc8-956a-04e213889603","resolution":{"observed_at":"2026-07-31T08:43:20.662153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.665076Z","title":"predict, then optimize","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.665076Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:75c55f0b68176e85ed50e6265a46ae82c40f0c4848d1e7d4e86fd89683c9dba9","observation_id":"4c014222-6e6a-4cd5-8bf5-896c42444a2d","resolution":{"observed_at":"2026-07-31T08:43:20.665076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.676756Z","title":"2018.00240","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.676756Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:57aacc8166314d76f3eebca885f4abcdc45f06d6f17b63cb15d6b1d2473fefbe","observation_id":"cf4f8e98-4c23-4ca0-89f0-59b040a54fdd","resolution":{"observed_at":"2026-07-31T08:43:20.676756Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.655371Z","title":"Giorgio Costa and Garud N","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.655371Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:1f70f42083ff8c61321127e95561bfa838c6cae927d1d864f808a959ba6b2422","observation_id":"c50d1a95-d063-4e1c-9881-6b464a6dcdd6","resolution":{"observed_at":"2026-07-31T08:43:20.655371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.681765Z","title":"Daniel Kuhn, Soroosh Shafiee, and Wolfram Wiesemann","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.681765Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:1d8b50dca475eeda8fff0a4d27bae5d7fdc5ed0eb3b9120cdda853ce408b886d","observation_id":"2d585715-4a28-4bb6-a76b-bfe127329b5b","resolution":{"observed_at":"2026-07-31T08:43:20.681765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.668151Z","title":"Jean Feydy, Thibault S ´ejourn´e, Franc ¸ois-Xavier Vialard, Shun-ichi Amari, Alain Trouv´e, and Gabriel Peyr´e","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.668151Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:97a9da294428def1e429eb95f0dcc1178675904a2b654d96b40c38a0aeb9055d","observation_id":"de4ba3f6-5589-459c-bc24-fe194298ff70","resolution":{"observed_at":"2026-07-31T08:43:20.668151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.659016Z","title":"14 Marco Cuturi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.659016Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:58e00a27648f250b66182e00b13b67c7004520329b9d3c66d471fd8acd4457ad","observation_id":"a2d99470-2bec-4302-9505-9e7d79064053","resolution":{"observed_at":"2026-07-31T08:43:20.659016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.673960Z","title":"Aude Genevay, Gabriel Peyr´e, and Marco Cuturi","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.673960Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:97962b64e9164a5c810b4c2d0f86571927a8fd2fc7b4db598aad41b8b9ee6cae","observation_id":"21a58f6f-5076-4f86-84b5-7b4b6212231b","resolution":{"observed_at":"2026-07-31T08:43:20.673960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:43:20.700976Z","title":"Jiaqi Wen and Jianyi Yang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-07-31T08:43:20.700976Z"},"links":{"citing_paper":"/paper/2607.24983"},"observation_digest":"sha256:bb76d4269908bf05e7af22efb418414e67476ab90318ae3fb79acfc371f9c9eb","observation_id":"ca6dae43-ecb4-4647-b1c0-ec30652c2298","resolution":{"observed_at":"2026-07-31T08:43:20.700976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24983","last_updated":"2026-07-27T18:35:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T23:51:18.346070Z","submitted_at":"2026-07-27T18:35:07Z","title":"Generative Distributionally Robust Optimization"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.24983."}