{"as_of":"2026-08-08T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9dac2fef58cdc6e600581c3b337681f40169fa5231801d17cfe58d653c14f2fb","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:23:26.202315Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.10945","last_updated":"2021-03-19T18:15:49Z","snapshot_observed_at":"2026-08-08T16:57:37.072014Z","submitted_at":"2020-12-20T14:54:29Z","title":"SPlit: An Optimal Method for Data Splitting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.10945","snapshot_observed_at":"2026-08-05T18:23:26.202315Z","title":"Roshan Joseph and Akhil Vakayil","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.14741","last_updated":"2025-08-20T14:40:21Z","snapshot_observed_at":"2026-08-08T17:04:21.222931Z","submitted_at":"2025-08-20T14:40:21Z","title":"CaTE Data Curation for Trustworthy AI","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T18:23:26.202315Z"},"links":{"cited_paper":"/paper/2012.10945","citing_paper":"/paper/2508.14741"},"observation_digest":"sha256:3cf77a152dc050c39f001f0e80dd28abeb970991c08f3d62c19b75681a4df916","observation_id":"72fb385f-06c5-43c7-97c8-c61f86270183","resolution":{"observed_at":"2026-08-05T18:23:26.202315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2012.10945/citation-record","integrity":"/paper/2012.10945/integrity","json":"/paper/2012.10945/citation-record.json","paper":"/paper/2012.10945"},"outbound":[],"paper":{"arxiv_id":"2012.10945","last_updated":"2021-03-19T18:15:49Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-08T16:57:37.072014Z","submitted_at":"2020-12-20T14:54:29Z","title":"SPlit: An Optimal Method for Data Splitting"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2012.10945."}