{"as_of":"2026-08-14T15:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b44a0270cf83eb98bf23012c9df5e57ca04de3b162b935efa86978a2f2ab9e93","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:36:57.981805Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:04:25.399472Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.10138","last_updated":"2021-11-12T15:52:00Z","snapshot_observed_at":"2026-08-09T06:27:59.636131Z","submitted_at":"2020-06-17T20:19:25Z","title":"An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectives","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10138","snapshot_observed_at":"2026-08-10T21:36:57.981805Z","title":"arXiv e-prints, 2006–10138 (2020) https://doi.org/10.48550/arXiv.2006.10138 arXiv:2006.10138 [cs.LG]","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.04527","last_updated":"2025-01-08T14:19:03Z","snapshot_observed_at":"2026-08-14T14:47:35.930413Z","submitted_at":"2025-01-08T14:19:03Z","title":"Towards Fair Class-wise Robustness: Class Optimal Distribution Adversarial Training","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T21:36:57.981805Z"},"links":{"cited_paper":"/paper/2006.10138","citing_paper":"/paper/2501.04527"},"observation_digest":"sha256:5069ed4cb8f3eb80f0d19f7ad9801b49bb62979f09f84e23fb803a6cc0b2fa1e","observation_id":"732d649d-1441-43ac-b2e0-d345daeed1a8","resolution":{"observed_at":"2026-08-10T21:36:57.981805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10138","last_updated":"2021-11-12T15:52:00Z","snapshot_observed_at":"2026-08-09T06:27:59.636131Z","submitted_at":"2020-06-17T20:19:25Z","title":"An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectives","version":5},"cited_work":{"arxiv_id":"2006.10138","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.10138","snapshot_observed_at":"2026-08-07T14:04:25.399472Z","title":"An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectives","venue":"cs.LG","work_id":"f8e598b3-9a06-40b3-99f8-6946f407f183","year":2020},"citing_paper":{"arxiv_id":"2505.20380","last_updated":"2025-05-26T17:32:14Z","snapshot_observed_at":"2026-08-10T08:18:46.652708Z","submitted_at":"2025-05-26T17:32:14Z","title":"GRAPE: Optimize Data Mixture for Group Robust Multi-target Adaptive Pretraining","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T14:04:23.474114Z"},"links":{"cited_paper":"/paper/2006.10138","citing_paper":"/paper/2505.20380"},"observation_digest":"sha256:d4b6c66a8859b1fc4550eda135f158f5cf68f8ba1698aa831142859aa8e2c8d6","observation_id":"2161bc10-f925-448e-8759-e77f382bd826","resolution":{"observed_at":"2026-08-07T14:04:25.474251Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.10138/citation-record","integrity":"/paper/2006.10138/integrity","json":"/paper/2006.10138/citation-record.json","paper":"/paper/2006.10138"},"outbound":[],"paper":{"arxiv_id":"2006.10138","last_updated":"2021-11-12T15:52:00Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T06:27:59.636131Z","submitted_at":"2020-06-17T20:19:25Z","title":"An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectives"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2006.10138."}