{"as_of":"2026-08-09T18:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f344ac14f9df75fc3c083206888af8e48226a0b9d8e1ecfc86898e8a7f6769e4","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:40:23.255049Z","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-06T19:45:34.610447Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.12230","last_updated":"2021-08-17T05:36:25Z","snapshot_observed_at":"2026-07-06T10:07:35.145338Z","submitted_at":"2020-10-23T08:33:04Z","title":"Coping with Label Shift via Distributionally Robust Optimisation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.12230","snapshot_observed_at":"2026-08-07T13:40:23.255049Z","title":"Coping with label shift via distributionally robust optimisation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.21422","last_updated":"2025-05-27T16:50:44Z","snapshot_observed_at":"2026-08-08T21:43:36.948248Z","submitted_at":"2025-05-27T16:50:44Z","title":"When Shift Happens - Confounding Is to Blame","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T13:40:23.255049Z"},"links":{"cited_paper":"/paper/2010.12230","citing_paper":"/paper/2505.21422"},"observation_digest":"sha256:162d2d1993aaa08182cdac0add6bbe6b1d85d3727ec0e2bb47ac0d431c17f829","observation_id":"b42e459e-3050-4053-805d-9a44d559e0cd","resolution":{"observed_at":"2026-08-07T13:40:23.255049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.12230","last_updated":"2021-08-17T05:36:25Z","snapshot_observed_at":"2026-07-06T10:07:35.145338Z","submitted_at":"2020-10-23T08:33:04Z","title":"Coping with Label Shift via Distributionally Robust Optimisation","version":3},"cited_work":{"arxiv_id":"2010.12230","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.12230","snapshot_observed_at":"2026-08-06T19:45:34.610447Z","title":"Coping with Label Shift via Distributionally Robust Optimisation","venue":"cs.LG","work_id":"3c8e3638-3e31-4ec2-bc1b-a7c18ef70a83","year":2020},"citing_paper":{"arxiv_id":"2507.04788","last_updated":"2025-07-07T09:09:52Z","snapshot_observed_at":"2026-08-06T22:46:57.461768Z","submitted_at":"2025-07-07T09:09:52Z","title":"Machine Learning from Explanations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:45:34.562873Z"},"links":{"cited_paper":"/paper/2010.12230","citing_paper":"/paper/2507.04788"},"observation_digest":"sha256:fac4d10d663a2ac402646aefcd949676a5c6b96ad2b275ef9afeb76ebf2860ad","observation_id":"8a6d6df9-9eff-4803-8b6e-af3aa8d218af","resolution":{"observed_at":"2026-08-06T19:45:34.617545Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2010.12230","last_updated":"2021-08-17T05:36:25Z","snapshot_observed_at":"2026-07-06T10:07:35.145338Z","submitted_at":"2020-10-23T08:33:04Z","title":"Coping with Label Shift via Distributionally Robust Optimisation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.12230","snapshot_observed_at":"2026-08-01T19:47:39.964010Z","title":"arXiv preprint arXiv:2010.12230 , year=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.16873","last_updated":"2026-07-18T16:25:27Z","snapshot_observed_at":"2026-08-08T03:15:21.664094Z","submitted_at":"2026-07-18T16:25:27Z","title":"InfoDense: Density-Aware Regional Decisive Replay for Memory-Efficient Incremental Face Forgery Detection","version":1},"reference_index":138,"source":"arxiv_source","source_observed_at":"2026-08-01T19:47:39.964010Z"},"links":{"cited_paper":"/paper/2010.12230","citing_paper":"/paper/2607.16873"},"observation_digest":"sha256:be3f4947417f243ed1754e64e8e33b913e39f27f3801673249bdbc8fbdd1f330","observation_id":"3ef4b572-b385-4f73-a488-bbb104fe6701","resolution":{"observed_at":"2026-08-01T19:47:39.964010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2010.12230/citation-record","integrity":"/paper/2010.12230/integrity","json":"/paper/2010.12230/citation-record.json","paper":"/paper/2010.12230"},"outbound":[],"paper":{"arxiv_id":"2010.12230","last_updated":"2021-08-17T05:36:25Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:07:35.145338Z","submitted_at":"2020-10-23T08:33:04Z","title":"Coping with Label Shift via Distributionally Robust Optimisation"},"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 3 inbound Pith citation observations for arXiv:2010.12230."}