{"as_of":"2026-08-10T23:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d56020e0991fe60c670005a1e5bcf11d4b1e81bec72859f9a40435f05d8f08a","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:31:59.021528Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T12:10:44.802059Z","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-10T12:15:22.299532Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"cited_work":{"arxiv_id":"2505.15212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15212","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Group distributionally robust optimization with flexible sample queries.arXiv preprint arXiv:2505.15212","venue":null,"work_id":"205d4f99-f905-4733-8f4b-12eb8abcb98e","year":null},"citing_paper":{"arxiv_id":"2604.15416","last_updated":"2026-04-16T17:55:36Z","snapshot_observed_at":"2026-07-06T23:02:58.361418Z","submitted_at":"2026-04-16T17:55:36Z","title":"StoSignSGD: Unbiased Structural Stochasticity Fixes SignSGD for Training Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T12:10:44.802059Z"},"links":{"cited_paper":"/paper/2505.15212","citing_paper":"/paper/2604.15416"},"observation_digest":"sha256:39520913a589740a42a4b549f278bac4187213dd22ee2e0d49ffed51c48ac08e","observation_id":"3302237f-c104-4911-b3ff-f5d3a3355ee3","resolution":{"observed_at":"2026-05-10T12:15:22.301242Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15212/citation-record","integrity":"/paper/2505.15212/integrity","json":"/paper/2505.15212/citation-record.json","paper":"/paper/2505.15212"},"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-07T15:31:59.807298Z","title":"Minimax regret optimization for robust machine learning under distribution shift","venue":null,"work_id":"eeeb21c7-9157-4e89-969d-e14d1f17c50a","year":2022},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.821778Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:434dedc0a43b968ee1969fb0467d1c9e1c7af07d389ebf7819dab4fb4c2eaccc","observation_id":"1664fc2e-aaf7-45e0-bc0f-c8254deae6c4","resolution":{"observed_at":"2026-08-07T15:31:59.811725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.792533Z","title":"Budgeted prediction with expert advice","venue":null,"work_id":"c49619f6-d2ef-472e-b578-a08c09fa9069","year":2015},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.826483Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:b962a9a40c88a454a0359bfe27de578e1778854581b44885d6af6e50129eea39","observation_id":"87689a6c-70bb-4668-897c-7dae4cf377ff","resolution":{"observed_at":"2026-08-07T15:31:59.797456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.778015Z","title":"Schapire","venue":null,"work_id":"49dea672-389c-416a-a98b-60446c2e9a7a","year":2002},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.830639Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:ed0c76a8b177fc6b03283979965932c8bc9e6b0302a22e5cf699943ee94aedd6","observation_id":"42d6ad70-1f6a-4c83-9847-49b980046a70","resolution":{"observed_at":"2026-08-07T15:31:59.782058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.763616Z","title":"Regret analysis of stochastic and nonstochastic multi-armed bandit problems","venue":null,"work_id":"ab3b543d-69c6-4239-88cc-b95aba98111e","year":2012},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.835355Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:0f51c64a82723b2276347a1970ef2e07521d0230b10da8fcc988a3e72a39535c","observation_id":"634edfee-f3f3-44ef-a7ff-de5ec781d007","resolution":{"observed_at":"2026-08-07T15:31:59.768192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.749121Z","title":"Distributionally robust optimization via ball oracle acceleration","venue":null,"work_id":"056ab073-4393-4f5d-b304-15bb335a8768","year":2022},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.839642Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:59b23ee96f3271d8d42eea35f2994130f6a77438493149bfa1330f8066295161","observation_id":"b43b0c5a-3bec-4d4a-b050-1b38e852b857","resolution":{"observed_at":"2026-08-07T15:31:59.753676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.735375Z","title":"Cesa-Bianchi and G","venue":null,"work_id":"0c1a1a80-f442-4466-8fc5-9d602a88778e","year":2006},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.843893Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:fc54c730af9ea5486c28ce8affaa95434e23cca71141ccc06dc667f6a5ace47f","observation_id":"b881ccdf-189c-4045-92f1-4c24d895cba6","resolution":{"observed_at":"2026-08-07T15:31:59.739758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.721221Z","title":"Anytime online-to-batch, optimism and acceleration","venue":null,"work_id":"7c44de19-e393-4326-9134-ef9afcc8ad3b","year":2019},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.848405Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:82bf811cf5adf8679bfb2129d8ebf07c74ec26ef50952fe5d7e0e5e35faca8b6","observation_id":"1fe0eb03-8d8c-49ca-bf47-ac8d89eac7cf","resolution":{"observed_at":"2026-08-07T15:31:59.725443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:31:58.852211Z","title":"Distributionally robust optimization under moment uncertainty with application to data-driven problems","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.852211Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:0500b1b79b3dafaed94babf62e375aea068d979a5d58f48ac609f02a0a7dd000","observation_id":"5fcaf380-1c5a-437c-a889-d0d89ed78d82","resolution":{"observed_at":"2026-08-07T15:31:58.852211Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:31:59.698108Z","title":"Duchi and Hongseok Namkoong","venue":null,"work_id":"ed854106-a776-495a-8e88-866a209160f0","year":2021},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.856014Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:6a08e6cc9e1d602e6203839bad29f2d7f299e72f23210e45eb1643ed61a75764","observation_id":"c642349c-6a00-47a4-98a7-3c801436a7f9","resolution":{"observed_at":"2026-08-07T15:31:59.701951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.684078Z","title":"Probability: theory and examples, volume 49","venue":null,"work_id":"08ee136a-833e-47ba-9ef4-62e1b8cc7c81","year":2019},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.859681Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:1aaf911244c117f621791fc78c0268b996415791fa564023c84a0d5a3a45f419","observation_id":"7efbb857-6411-46b7-b106-b9b32622bda9","resolution":{"observed_at":"2026-08-07T15:31:59.688480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.670549Z","title":"Freedman","venue":null,"work_id":"b70159bc-aa7b-4982-b9aa-e326a26e1a49","year":1975},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.863626Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:bfd133fc4cd17d03334beeadf0902ca6b45c2962aeb190b7920ec66f5dc3c22f","observation_id":"d07beb7d-9ce1-4a4e-8a8e-237b2efaddd9","resolution":{"observed_at":"2026-08-07T15:31:59.674701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.656324Z","title":"A survey on concept drift adaptation","venue":null,"work_id":"bb1012f3-afc7-4eda-85fb-eb542052a0a7","year":2014},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.867827Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:309c7bce7a9a9faea15a7fd93ad0a95ecdebe131715eedf08abfe4629ebd9a5f","observation_id":"3ca8aed2-6d64-4e83-aae7-70bd2466c391","resolution":{"observed_at":"2026-08-07T15:31:59.660878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.642245Z","title":"Dependent rounding and its applications to approximation algorithms","venue":null,"work_id":"a1109c7c-df54-4f8a-bd11-e26379c6fb9d","year":2006},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.871594Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:5a87252f6999ea05dda5241d16e4768bafc6341c6ff329369ccb8cbbad1ab056","observation_id":"ca7d4890-be9d-4f3d-b87c-45cd9558b3fa","resolution":{"observed_at":"2026-08-07T15:31:59.646462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.628313Z","title":"Statistical machine learning: A unified framework","venue":null,"work_id":"4cf0189c-a212-40d8-b012-880233df280b","year":2020},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.875717Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:aa2e3f96736aa85d7136dfa16c90e5c036490df4ee300a22cac4015f55d1cd0d","observation_id":"b2358f78-7030-411a-8a35-f41d350ea5ac","resolution":{"observed_at":"2026-08-07T15:31:59.632599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.614222Z","title":"Jordan, and Eric Zhao","venue":null,"work_id":"a13e57f3-6617-4dbd-a95a-8e0685f9e52f","year":2022},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.879509Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:08f8c0f446409de79d4de769f110d84231f53a4b4ac47eb6431acde7df4e85da","observation_id":"bcb849ab-3d1f-4e0f-84b7-62a3d612ebbf","resolution":{"observed_at":"2026-08-07T15:31:59.618676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.601333Z","title":"Multiarmed bandits with limited expert advice","venue":null,"work_id":"b9fdc835-157f-4637-beba-1101cb93084c","year":2014},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.883401Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:330a5ac68101d94b67eeb7af89ca67dfff19d7dcfbca1831390d90149fc140a1","observation_id":"e87a5cf8-a453-4a75-8021-7cbbca83a58e","resolution":{"observed_at":"2026-08-07T15:31:59.605224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.586510Z","title":"Efficient learning by implicit exploration in bandit problems with side observations","venue":null,"work_id":"0082edc1-e03e-4c2b-befa-b1e29bdea8d5","year":2014},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.887228Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:74122f46a76eae3efe5c6aa9fb899eb965bf4c2284c19fd37c10576b875eaa30","observation_id":"bd038a17-4b05-4279-a319-7efdec1e0938","resolution":{"observed_at":"2026-08-07T15:31:59.591410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.571917Z","title":"Generative models improve fairness of medical classifiers under distribution shifts","venue":null,"work_id":"8c9c536d-8701-4262-a17b-ecd6a84ecc37","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.891121Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:53f73c3ad27b5ee1de0e96249c90e1906c378a0e93bc407fdb2f7fe3c72998e2","observation_id":"7069f23c-2cd2-4eb3-9ea7-1bd7fdfef07b","resolution":{"observed_at":"2026-08-07T15:31:59.576332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.558659Z","title":"Stable prediction across unknown environments","venue":null,"work_id":"32ccc96f-6266-4998-8a04-802a3008167a","year":2018},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.894967Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:abd8576792313a2a23f5f1422a4c18790918d824e036c5ed7019cc8d6ed1bc85","observation_id":"8f1822f1-eb41-43e6-94e9-8736e4d510c3","resolution":{"observed_at":"2026-08-07T15:31:59.562910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.544032Z","title":"Minimax optimal reinforcement learning with quasi-optimism","venue":null,"work_id":"dc7e47da-d392-40e6-97c8-b323deb417d6","year":2025},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.898918Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:17a86eca8f59483da652fe64228d08b5ca3946ca1111bef220ff802fc7a4985f","observation_id":"09f30afa-efc2-4619-af38-52d5834283ae","resolution":{"observed_at":"2026-08-07T15:31:59.548890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00823","last_updated":"2025-03-01T16:33:54Z","snapshot_observed_at":"2026-07-06T18:24:05.440881Z","submitted_at":"2024-06-02T18:11:47Z","title":"Lasso Bandit with Compatibility Condition on Optimal Arm","version":2},"cited_work":{"arxiv_id":"2406.00823","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.00823","snapshot_observed_at":"2026-08-07T15:31:59.182939Z","title":"Lasso Bandit with Compatibility Condition on Optimal Arm","venue":"stat.ML","work_id":"adead639-9878-495e-9201-84b012437149","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.902463Z"},"links":{"cited_paper":"/paper/2406.00823","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:502e310074ea43c475e0c6bc7f8ae526e30c6e4314e27c48f47b8aee1d805f4e","observation_id":"1163f8e1-39fc-4122-8a0c-582969b9dc87","resolution":{"observed_at":"2026-08-07T15:31:59.188025Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.529956Z","title":"Agnostic federated learning","venue":null,"work_id":"92300ade-2903-4437-be75-e2fcc7110e6e","year":2019},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.906705Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:bfb5f1b73b17c4de0c459bab74a69946c1e082e033ba80ad27f6ff15fea22d0e","observation_id":"b2208d60-7c48-419d-a97c-03292d37c063","resolution":{"observed_at":"2026-08-07T15:31:59.533945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.517202Z","title":"Stochastic gradient methods for distributionally robust optimization with f-divergences","venue":null,"work_id":"4da954fb-b53e-4eaf-90c9-d4d5440ffbec","year":2016},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.910225Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:78ba7e20457ad302b8d648b69cd29a63adc790f3ab6cde22cc70693d5ac9dbea","observation_id":"5c275fac-2d81-4e51-8d08-738c24f6a90f","resolution":{"observed_at":"2026-08-07T15:31:59.521209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:31:58.913807Z","title":"Nemirovski, A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.913807Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:ce7665bab3c1cf061ee2408d1c50c89d5999a8d51d479f122f82eef21e8b8781","observation_id":"5c8fa7c3-b58d-4979-a133-0fc51a4bb63c","resolution":{"observed_at":"2026-08-07T15:31:58.913807Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:31:59.494444Z","title":"Explore no more: Improved high-probability regret bounds for non-stochastic bandits","venue":null,"work_id":"970288a7-9a7c-40fe-8f0f-01358ea90ba4","year":2015},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.917339Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:01ea264aec4e95aab249db56ee8668c612cc3a450e3ac5519e6b7d34f39febfc","observation_id":"2bcb53bc-0a2b-4a0d-aa83-da639a91cd13","resolution":{"observed_at":"2026-08-07T15:31:59.498763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.00690","last_updated":"2025-01-31T02:51:17Z","snapshot_observed_at":"2026-07-06T19:25:15.390282Z","submitted_at":"2024-10-01T13:45:55Z","title":"Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity","version":2},"cited_work":{"arxiv_id":"2410.00690","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.00690","snapshot_observed_at":"2026-08-07T15:31:59.159853Z","title":"Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity","venue":"cs.LG","work_id":"e238897e-0a34-49b5-a0da-6a689825ff44","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.920887Z"},"links":{"cited_paper":"/paper/2410.00690","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:50bed7afc0247847f3ba80277c731c82de344a4001d88ac0b8e4200ae523223c","observation_id":"634bc4ba-4946-41a6-98e2-7ad3c1a83fcd","resolution":{"observed_at":"2026-08-07T15:31:59.165206Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-07T15:31:58.925775Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.925775Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:aed1ec032acadb826ef13bb5fde027e8dd533eb4b53c14681b80d000e9f0ced9","observation_id":"f65f5007-3c23-4dcc-b892-8863690838e7","resolution":{"observed_at":"2026-08-07T15:31:58.925775Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:31:59.481819Z","title":"To cool or not to cool? temperature network meets large foundation models via DRO","venue":null,"work_id":"968f7133-fefe-4216-a0a6-7165edd72f9f","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.929821Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:8fd627abe291208e31357d058c2f1aadead8a130f00bfcc4c5c8a8b82922ac6b","observation_id":"cec44ad7-9c39-4222-a306-6e16b1b9d68c","resolution":{"observed_at":"2026-08-07T15:31:59.485883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.467962Z","title":"Frameworks and results in distributionally robust optimization","venue":null,"work_id":"6c8c525b-e0db-447b-89d2-089fa277d7a4","year":2022},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.933452Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:6c332d120dd1529c558bf7d3ef117cc165755c164e0054401c31ace3148e71f2","observation_id":"09436a28-23d8-4e6d-961c-95dc3775ff73","resolution":{"observed_at":"2026-08-07T15:31:59.472999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20304","last_updated":"2024-05-30T17:50:04Z","snapshot_observed_at":"2026-08-10T22:18:58.746397Z","submitted_at":"2024-05-30T17:50:04Z","title":"Group Robust Preference Optimization in Reward-free RLHF","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20304","snapshot_observed_at":"2026-08-07T15:31:58.937247Z","title":"Group robust preference optimization in reward-free rlhf","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.937247Z"},"links":{"cited_paper":"/paper/2405.20304","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:04a483c8257f86ae02ef2596e315dc971bf510147eefa47222a010ea3a599ccb","observation_id":"a70ac4be-d282-410f-8e73-a59653c8a2c8","resolution":{"observed_at":"2026-08-07T15:31:58.937247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.13939","last_updated":"2021-06-04T14:38:53Z","snapshot_observed_at":"2026-07-06T11:13:44.890922Z","submitted_at":"2021-05-28T16:01:42Z","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems","version":2},"cited_work":{"arxiv_id":"2105.13939","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.13939","snapshot_observed_at":"2026-08-07T15:31:59.094867Z","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems","venue":"cs.LG","work_id":"ec846b71-034f-49d4-a360-48465bd049ad","year":2021},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.941485Z"},"links":{"cited_paper":"/paper/2105.13939","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:62655b4802b3bff563e63b6094843f8681f6c694cadf4d103575bf5c3b2ada02","observation_id":"443b5c99-d015-4f14-9720-3d2560f69c93","resolution":{"observed_at":"2026-08-07T15:31:59.099279Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.455604Z","title":"Fast rates for prediction with limited expert advice","venue":null,"work_id":"29f9e87c-03a2-4fd8-ae96-2c17dad709d3","year":2021},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.945820Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:c8c5268b1f2e593b0a747a8ef3bce58ab9e171b10e46efb9c0d52b9c54b6d7cd","observation_id":"7ca7d22c-8279-4f7b-9139-b23f53a1ddab","resolution":{"observed_at":"2026-08-07T15:31:59.459521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.442513Z","title":"Constant regret for sequence prediction with limited advice","venue":null,"work_id":"35d4ad7d-4592-4c7b-8ee9-275d6163a908","year":2023},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.949637Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:e7f38767004974af416e2f4e3a5a4b74930948fc2459a4df8da78fe4b9dfd2e7","observation_id":"7fe13162-a445-4f07-85c3-7b365b4b9a43","resolution":{"observed_at":"2026-08-07T15:31:59.447068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.428388Z","title":"Hashimoto, and Percy Liang","venue":null,"work_id":"412a67cd-4ddf-413e-97b0-2a752ac9d351","year":2020},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.953279Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:96661ec0791afeaf7b0faa4b2d4b5f28c47cc0c74cef6ac40a3cda4d112d7b5b","observation_id":"96b10dc3-72d4-4611-aa00-6f46762ca45d","resolution":{"observed_at":"2026-08-07T15:31:59.432479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.415452Z","title":"Prediction with limited advice and multiarmed bandits with paid observations","venue":null,"work_id":"373006ee-cd60-494b-a9ff-35e002fe8261","year":2014},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.957608Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:5413cd39328e338a63edde2f82374fc8db038992f919a5942aa9cdc284c7bedf","observation_id":"5ab4ed95-0ade-4719-9d67-c111a56e5f4d","resolution":{"observed_at":"2026-08-07T15:31:59.419556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.402373Z","title":"On distributionally robust optimization and data rebalancing","venue":null,"work_id":"c6456e6c-5489-404b-b682-6fa500138b5b","year":2022},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.961308Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:018a9e8b09f8a1e56255d604ce0ef79c954624756fb74b4469ea4f8bec78b41b","observation_id":"50767151-84ea-468e-84b3-c4deb4457000","resolution":{"observed_at":"2026-08-07T15:31:59.406434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13669","last_updated":"2025-01-31T18:54:09Z","snapshot_observed_at":"2026-08-09T19:31:16.184206Z","submitted_at":"2022-12-28T02:45:46Z","title":"Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.13669","snapshot_observed_at":"2026-08-07T15:31:58.964900Z","title":"Optimal algorithms for group distributionally robust optimization and beyond","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.964900Z"},"links":{"cited_paper":"/paper/2212.13669","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:c5f4359900566a5b7a1aed06a3a1f79f31d02b28cf30ec8b2e3468d414ee3f30","observation_id":"9d95cddc-79eb-461c-91ac-517602b11d34","resolution":{"observed_at":"2026-08-07T15:31:58.964900Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:31:59.389576Z","title":"DeShazo, Chris Gennings, Juan L","venue":null,"work_id":"1791fe24-a75d-4d1f-bd0a-b9090674b908","year":2014},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.968958Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:24e4a80f692bec3d2b8082567150dd5c5e42efe4518553fedc7b7817d4edb10f","observation_id":"97fa0c7c-295e-4a12-b17f-3da2a9d3771a","resolution":{"observed_at":"2026-08-07T15:31:59.393504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.376103Z","title":"Covariate shift adaptation by importance weighted cross validation","venue":null,"work_id":"9714bc2d-6ab0-4bfd-9a8d-0776d08e2785","year":2007},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.972561Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:6f926f946082bb5c5d5b3bb3f2e08b2f0f4a2d472aca3df53071a2809e44cbc2","observation_id":"6c0d7800-be31-4626-a193-e9f1db95f29d","resolution":{"observed_at":"2026-08-07T15:31:59.380314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.361968Z","title":"Adaptation to easy data in prediction with limited advice","venue":null,"work_id":"b19c0d78-9ad7-4640-85ee-aaf232f0b18f","year":2018},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.976930Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:ec62d7a1441a12a80cf9b962426254034877c9675a63f6571fab98fff8ce07eb","observation_id":"72aec366-cfd9-4cb7-ab63-b1ad6aed3888","resolution":{"observed_at":"2026-08-07T15:31:59.366725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.348715Z","title":"Algorithms for adversarial bandit problems with multiple plays","venue":null,"work_id":"6596620d-3a0d-4732-bc0e-730f4c6a75d9","year":2010},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.980928Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:c81e6b35a136aab069a88d1f15c40fec8047081922cf9522ffd1e4a92b3935d0","observation_id":"0b4343c7-d7af-4683-9428-230e72cf9024","resolution":{"observed_at":"2026-08-07T15:31:59.353218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.335899Z","title":null,"venue":null,"work_id":"591dbeb7-6f46-4519-8688-089496745fad","year":2000},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.984824Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:28ffcfa812280ded063a9a9af81920bf9b62baa7e59d53f6f1aeadabf79098d5","observation_id":"5cfffe25-1dc1-47f9-ada5-55dffe9df73f","resolution":{"observed_at":"2026-08-07T15:31:59.339817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.321258Z","title":"Kozat Kozat","venue":null,"work_id":"b0c692ea-e154-4639-9698-16669283423c","year":2019},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.989059Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:0c288b3b385e9d1ed2413a777679efb881ebaf97a008f83242eae60428bfc31c","observation_id":"7350c119-5165-4bab-9aa6-1bb7a73bf5f2","resolution":{"observed_at":"2026-08-07T15:31:59.326377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.302595Z","title":"Towards unbiased information extraction and adaptation in cross-domain recommendation","venue":null,"work_id":"ccb95029-6648-42c0-af75-d85ac9a48b74","year":2025},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.994346Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:3775d3d2ba8cf7cb26214ed6ee8bdd109de666931e0f37eb7d62fea4d58b8503","observation_id":"b538a7a3-9d69-44ec-8693-6fd1c46bfcd2","resolution":{"observed_at":"2026-08-07T15:31:59.308413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.284294Z","title":"Doremi: Optimizing data mixtures speeds up language model pretraining","venue":null,"work_id":"68c86fb4-6525-4233-979f-56b37a2d1f85","year":2023},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.998294Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:1d2502b2d4a74d0e704b4a20fae66ab77b181bdc8355c39b04c25a8aed1a0893","observation_id":"6e3e2ae8-7f9d-4253-a24e-efccf8473edd","resolution":{"observed_at":"2026-08-07T15:31:59.289491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.264791Z","title":"Efficient algorithms for empirical group distributionally robust optimization and beyond","venue":null,"work_id":"dee013ed-0a62-4405-b48f-d4480dd3b8e9","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:59.002044Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:095597af3d34324517b3a79bd1c98cb9322da7109d42d96121df0deeb6f25930","observation_id":"b5c9e9e4-43af-4ff7-96ab-c3e1e928f856","resolution":{"observed_at":"2026-08-07T15:31:59.270224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.248159Z","title":"Multi-armed bandit with additional observations","venue":null,"work_id":"f73e3146-6dac-4a23-8a07-d0d8add82bfa","year":2018},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:59.005663Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:ea713813f01d916b3b1380e63127b0e0cbff64e89c0ed96f496f6d0dba84167d","observation_id":"7f79dd5e-a83d-4f08-95eb-321066b3a03c","resolution":{"observed_at":"2026-08-07T15:31:59.253579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.231957Z","title":"Stochastic approximation approaches to group distributionally robust optimization","venue":null,"work_id":"37160ee4-cf7b-4567-b13a-49c9d7f878c6","year":2023},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:59.009561Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:469dee2656ff9debb0c5e26948a9ce10c6da7bc991ade81384ee7835be0a3381","observation_id":"0c7c5304-b65d-474c-8628-b83a45420a44","resolution":{"observed_at":"2026-08-07T15:31:59.237445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.215725Z","title":"Efficient stochastic approximation of minimax excess risk optimization","venue":null,"work_id":"da40dcb4-d4cc-4b11-ab51-da67ee297f74","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:59.013287Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:b3cab9a320359eb6e3dfd4d5962d378f6cc2d7e82b72e08f5ee609c7e83bc61b","observation_id":"6aaea59b-331e-47df-a516-eb77c4251575","resolution":{"observed_at":"2026-08-07T15:31:59.220737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09267","last_updated":"2024-11-20T05:58:10Z","snapshot_observed_at":"2026-07-06T14:53:11.996325Z","submitted_at":"2023-02-18T09:24:15Z","title":"Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond","version":5},"cited_work":{"arxiv_id":"2302.09267","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.09267","snapshot_observed_at":"2026-08-07T15:31:59.057117Z","title":"Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond","venue":"cs.LG","work_id":"20b20780-e2d1-47d4-bb37-a1299bce3142","year":2023},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:59.017127Z"},"links":{"cited_paper":"/paper/2302.09267","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:e14688c0b38f36dbe6818f56ff3dd67a0f6f0799f0007ac875ee3d6f31128f97","observation_id":"a11bb1f8-bbd4-4a64-95b5-04677eb1f8fc","resolution":{"observed_at":"2026-08-07T15:31:59.064116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:31:59.199738Z","title":"Federated learning with adaptive communication compression under dynamic bandwidth and unreliable networks","venue":null,"work_id":"4793e50a-ac8d-4cf8-818e-67e9dcba307b","year":2020},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:59.021528Z"},"links":{"citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:ab2966d06b65ccc4b0da4fa2db97c814baf7d1b355d6023470d9ac879c102f7d","observation_id":"3ff377a0-9bed-476d-af3f-8cb02bcc9e43","resolution":{"observed_at":"2026-08-07T15:31:59.204739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":3,"verified_fuzzy":41},"total_outbound_references":51},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 1 inbound Pith citation observation for arXiv:2505.15212."}