{"as_of":"2026-08-09T10:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:088080f42716b33192cfe1ecfbdb3cebb854701a3019b16cf94edeb94104e052","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-09T06:31:02.800959+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-05T16:10:53.441291Z","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-07-04T15:59:57.178239Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14503","last_updated":"2022-02-18T17:07:14Z","snapshot_observed_at":"2026-07-06T12:02:39.457907Z","submitted_at":"2021-10-27T15:15:11Z","title":"Simple data balancing achieves competitive worst-group-accuracy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14503","snapshot_observed_at":"2026-08-05T16:10:53.441291Z","title":"Y.; Arjovsky, M.; Pezeshki, M.; and Lopez-Paz, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.18933","last_updated":"2025-08-26T11:20:39Z","snapshot_observed_at":"2026-08-08T05:43:40.659762Z","submitted_at":"2025-08-26T11:20:39Z","title":"VISION: Robust and Interpretable Code Vulnerability Detection Leveraging Counterfactual Augmentation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T16:10:53.441291Z"},"links":{"cited_paper":"/paper/2110.14503","citing_paper":"/paper/2508.18933"},"observation_digest":"sha256:f91ecf1dd3a296f5790524bfc3b1016d0b00699c3401cac6a09309b7cbfed819","observation_id":"60b5a9d8-a6cd-458d-ade2-0473b9838930","resolution":{"observed_at":"2026-08-05T16:10:53.441291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14503","last_updated":"2022-02-18T17:07:14Z","snapshot_observed_at":"2026-07-06T12:02:39.457907Z","submitted_at":"2021-10-27T15:15:11Z","title":"Simple data balancing achieves competitive worst-group-accuracy","version":2},"cited_work":{"arxiv_id":"2110.14503","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14503","snapshot_observed_at":"2026-07-04T15:59:57.178239Z","title":null,"venue":null,"work_id":"246f72cd-790c-44c2-9c56-83b61e148733","year":2022},"citing_paper":{"arxiv_id":"2606.24161","last_updated":"2026-06-23T05:28:47Z","snapshot_observed_at":"2026-07-06T23:58:49.574536Z","submitted_at":"2026-06-23T05:28:47Z","title":"Dual-Branch Cross-Projection Debiasing through Diffusion-based Disentanglement","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T01:06:54.997176Z"},"links":{"cited_paper":"/paper/2110.14503","citing_paper":"/paper/2606.24161"},"observation_digest":"sha256:3ea6a300c01b1c67dc500327c85685593a8b6e5bd3799c7ead0e34a7eba35255","observation_id":"a89ea9ae-4edf-4c8a-b805-c3141ff5b3a2","resolution":{"observed_at":"2026-07-04T15:59:57.179559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.14503/citation-record","integrity":"/paper/2110.14503/integrity","json":"/paper/2110.14503/citation-record.json","paper":"/paper/2110.14503"},"outbound":[],"paper":{"arxiv_id":"2110.14503","last_updated":"2022-02-18T17:07:14Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:02:39.457907Z","submitted_at":"2021-10-27T15:15:11Z","title":"Simple data balancing achieves competitive worst-group-accuracy"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.14503."}