{"as_of":"2026-08-13T16:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:230699b4c889532496863dac29a3e126f16646e16fae392845207b1c76d214dc","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-13T06:32:02.005865+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-11T18:53:09.732076Z","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-11T18:53:11.872476Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.10189","last_updated":"2023-10-12T23:18:22Z","snapshot_observed_at":"2026-08-13T00:43:09.826302Z","submitted_at":"2020-06-17T22:45:14Z","title":"Revisiting minimum description length complexity in overparameterized models","version":4},"cited_work":{"arxiv_id":"2006.10189","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.10189","snapshot_observed_at":"2026-08-11T18:53:11.872476Z","title":"Revisiting minimum description length complexity in overparameterized models","venue":"cs.LG","work_id":"2028e2df-2b12-409e-b9fa-ebd1b6ae18ab","year":2020},"citing_paper":{"arxiv_id":"2412.07520","last_updated":"2024-12-10T13:58:19Z","snapshot_observed_at":"2026-08-13T05:58:59.217102Z","submitted_at":"2024-12-10T13:58:19Z","title":"Quantifying the Prediction Uncertainty of Machine Learning Models for Individual Data","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:53:09.732076Z"},"links":{"cited_paper":"/paper/2006.10189","citing_paper":"/paper/2412.07520"},"observation_digest":"sha256:d8455842605089237ef452b4ff96634f98f32c2f1e4d69b4020287961f4548c5","observation_id":"ff57d101-ac47-401e-ab79-61bbdf5f2e48","resolution":{"observed_at":"2026-08-11T18:53:11.904752Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.10189/citation-record","integrity":"/paper/2006.10189/integrity","json":"/paper/2006.10189/citation-record.json","paper":"/paper/2006.10189"},"outbound":[],"paper":{"arxiv_id":"2006.10189","last_updated":"2023-10-12T23:18:22Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T00:43:09.826302Z","submitted_at":"2020-06-17T22:45:14Z","title":"Revisiting minimum description length complexity in overparameterized models"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2006.10189."}