{"as_of":"2026-08-10T11:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b015abd182499a975b4ff3021a1288f02ed24a45df77c09e387eadc146b1eb4","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-10T06:31:04.303077+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-07-14T20:55:11.027028Z","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-05-15T01:39:38.335684Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2008.11904","last_updated":"2020-08-27T03:58:11Z","snapshot_observed_at":"2026-08-10T06:00:39.915456Z","submitted_at":"2020-08-27T03:58:11Z","title":"A Precise Performance Analysis of Learning with Random Features","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.11904","snapshot_observed_at":"2026-07-14T20:55:11.027028Z","title":"A precise performance analysis of learning with random features.arXiv preprint arXiv:2008.11904,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2603.14830","last_updated":"2026-07-03T09:25:19Z","snapshot_observed_at":"2026-08-07T04:35:28.208886Z","submitted_at":"2026-03-16T05:14:34Z","title":"Dataset Distillation Efficiently Encodes Low-Dimensional Representations from Gradient-Based Learning of Non-Linear Tasks","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T20:55:11.027028Z"},"links":{"cited_paper":"/paper/2008.11904","citing_paper":"/paper/2603.14830"},"observation_digest":"sha256:1a267838a1672571c8acf91daa11e695adaa8172dbc9f3d948211e882ec0a346","observation_id":"d2fe77bd-ae7d-4f94-8e33-d36bf32ef225","resolution":{"observed_at":"2026-07-14T20:55:11.027028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.11904","last_updated":"2020-08-27T03:58:11Z","snapshot_observed_at":"2026-08-10T06:00:39.915456Z","submitted_at":"2020-08-27T03:58:11Z","title":"A Precise Performance Analysis of Learning with Random Features","version":1},"cited_work":{"arxiv_id":"2008.11904","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2008.11904","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2008.11904 , year=","venue":null,"work_id":"167f45e8-6b64-4bb8-bbe2-1108c752f360","year":2008},"citing_paper":{"arxiv_id":"2605.10290","last_updated":"2026-05-11T09:52:21Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:52:21Z","title":"Characterizing the Generalization Error of Random Feature Regression with Arbitrary Data-Augmentation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-12T04:53:26.267023Z"},"links":{"cited_paper":"/paper/2008.11904","citing_paper":"/paper/2605.10290"},"observation_digest":"sha256:9a665993a9ff72d3ecbd6d7c36a5f73aa38e75b739a374bab4c4705c6a409a18","observation_id":"4ac0783a-83e9-443e-a02a-a359dca114de","resolution":{"observed_at":"2026-05-12T05:51:25.406503Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2008.11904","last_updated":"2020-08-27T03:58:11Z","snapshot_observed_at":"2026-08-10T06:00:39.915456Z","submitted_at":"2020-08-27T03:58:11Z","title":"A Precise Performance Analysis of Learning with Random Features","version":1},"cited_work":{"arxiv_id":"2008.11904","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2008.11904","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2008.11904 , year=","venue":null,"work_id":"167f45e8-6b64-4bb8-bbe2-1108c752f360","year":2008},"citing_paper":{"arxiv_id":"2605.14567","last_updated":"2026-05-14T08:37:28Z","snapshot_observed_at":"2026-08-03T00:46:36.800591Z","submitted_at":"2026-05-14T08:37:28Z","title":"Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model","version":1},"reference_index":141,"source":"arxiv_source","source_observed_at":"2026-05-15T01:39:21.733359Z"},"links":{"cited_paper":"/paper/2008.11904","citing_paper":"/paper/2605.14567"},"observation_digest":"sha256:9c45c5702448cb813b51816f63fb7d5f938adaa076b314c87a14306d7d5920eb","observation_id":"330d99e1-eaba-4968-9435-22cab4b4facf","resolution":{"observed_at":"2026-05-15T01:39:38.337771Z","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/2008.11904/citation-record","integrity":"/paper/2008.11904/integrity","json":"/paper/2008.11904/citation-record.json","paper":"/paper/2008.11904"},"outbound":[],"paper":{"arxiv_id":"2008.11904","last_updated":"2020-08-27T03:58:11Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T06:00:39.915456Z","submitted_at":"2020-08-27T03:58:11Z","title":"A Precise Performance Analysis of Learning with Random Features"},"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 3 inbound Pith citation observations for arXiv:2008.11904."}