{"as_of":"2026-08-10T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c3ca6f276d8bd0da623a9c058bdade675c1b3087ca81065c6590e6d584115c1e","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-10T06:31:04.303077+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-06T15:43:55.703744Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.19570","last_updated":"2023-05-31T05:39:52Z","snapshot_observed_at":"2026-08-02T17:31:07.790323Z","submitted_at":"2023-05-31T05:39:52Z","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.19570","snapshot_observed_at":"2026-08-06T15:43:55.703744Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.15280","last_updated":"2025-07-21T06:30:25Z","snapshot_observed_at":"2026-08-09T06:48:31.270955Z","submitted_at":"2025-07-21T06:30:25Z","title":"Machine Unlearning for Streaming Forgetting","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:55.703744Z"},"links":{"cited_paper":"/paper/2305.19570","citing_paper":"/paper/2507.15280"},"observation_digest":"sha256:618a8d2537943166f0c9a3775345305c9872fbcc91ad2ac29e9848daefd6127e","observation_id":"aeaef79b-1a85-4fbc-a3ee-918e6d29e876","resolution":{"observed_at":"2026-08-06T15:43:55.703744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19570","last_updated":"2023-05-31T05:39:52Z","snapshot_observed_at":"2026-08-02T17:31:07.790323Z","submitted_at":"2023-05-31T05:39:52Z","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms","version":1},"cited_work":{"arxiv_id":"2305.19570","doi":"10.48550/arxiv.2305.19570","metadata_source":"arxiv_reference","pith_arxiv_id":"2305.19570","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"7773f93c-a887-40f9-b15f-8d4a015d1ec3","year":null},"citing_paper":{"arxiv_id":"2605.09471","last_updated":"2026-05-10T10:56:59Z","snapshot_observed_at":"2026-08-05T20:10:28.703944Z","submitted_at":"2026-05-10T10:56:59Z","title":"The Statistical Cost of Adaptation in Multi-Source Transfer Learning","version":1},"reference_index":243,"source":"arxiv_source","source_observed_at":"2026-05-12T04:19:05.837824Z"},"links":{"cited_paper":"/paper/2305.19570","citing_paper":"/paper/2605.09471"},"observation_digest":"sha256:d63fcb8c8f1554052ca2687a174e4a20bcd145d86b382c1a168edac81132a9e4","observation_id":"65decb1e-ef64-4f47-bde7-974c93ca1de1","resolution":{"observed_at":"2026-05-12T04:21:20.743815Z","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/2305.19570/citation-record","integrity":"/paper/2305.19570/integrity","json":"/paper/2305.19570/citation-record.json","paper":"/paper/2305.19570"},"outbound":[],"paper":{"arxiv_id":"2305.19570","last_updated":"2023-05-31T05:39:52Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-02T17:31:07.790323Z","submitted_at":"2023-05-31T05:39:52Z","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.19570."}