{"as_of":"2026-08-11T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9298f385bfda9ea278d3077307994858312250ae80c8165b4d8cae392928d711","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:31:58.964900Z","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-17T23:50:31.390490Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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-04T20:03:07.696696Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08942","last_updated":"2025-09-10T19:08:17Z","snapshot_observed_at":"2026-08-10T02:44:18.196472Z","submitted_at":"2025-09-10T19:08:17Z","title":"Group Distributionally Robust Machine Learning under Group Level Distributional Uncertainty","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T20:03:07.696696Z"},"links":{"cited_paper":"/paper/2212.13669","citing_paper":"/paper/2509.08942"},"observation_digest":"sha256:84d010633d16a29ce51544cc544ddacb05e5a09026db270340db342059c0846e","observation_id":"ed7aee72-c385-4ee6-8f29-532c27872ab8","resolution":{"observed_at":"2026-08-04T20:03:07.696696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2212.13669","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.13669","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tong, X.; Li, W.; Li, L.; Loy, C","venue":null,"work_id":"27af0afa-79ca-43ed-a295-13569b490e1a","year":2022},"citing_paper":{"arxiv_id":"2511.08887","last_updated":"2026-04-05T18:21:19Z","snapshot_observed_at":"2026-07-06T22:35:31.750339Z","submitted_at":"2025-11-12T01:40:58Z","title":"FAST-CAD: A Fairness-Aware Framework for Non-Contact Stroke Diagnosis","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T23:49:03.016416Z"},"links":{"cited_paper":"/paper/2212.13669","citing_paper":"/paper/2511.08887"},"observation_digest":"sha256:45b2d0af88bd74f8cf231227e0d35e7110731c3ed9996a854e8fd2e39a85246e","observation_id":"e39ec9e9-9349-4937-8dc1-544b777ae8ce","resolution":{"observed_at":"2026-05-17T23:50:31.392797Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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":"2212.13669","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.13669","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tong, X.; Li, W.; Li, L.; Loy, C","venue":null,"work_id":"27af0afa-79ca-43ed-a295-13569b490e1a","year":2022},"citing_paper":{"arxiv_id":"2605.03945","last_updated":"2026-05-05T16:32:11Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T16:32:11Z","title":"Integrating Feature Correlation in Differential Privacy with Applications in DP-ERM","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-07T03:43:34.520951Z"},"links":{"cited_paper":"/paper/2212.13669","citing_paper":"/paper/2605.03945"},"observation_digest":"sha256:16e0cae1b278a3b910d3bf776b2e8e40fae414116d72c66186dec8b95f03a167","observation_id":"7bc66e85-c52f-4747-8b8a-3901b611b066","resolution":{"observed_at":"2026-05-12T10:41:31.662228Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.13669/citation-record","integrity":"/paper/2212.13669/integrity","json":"/paper/2212.13669/citation-record.json","paper":"/paper/2212.13669"},"outbound":[],"paper":{"arxiv_id":"2212.13669","last_updated":"2025-01-31T18:54:09Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2212.13669."}