{"as_of":"2026-08-14T15:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92a49b74d6c1547117aa895fd3a1ab4de47fad1360fb914c8464070d9d87ab1d","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-14T06:32:32.682623+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-07T05:07:39.503440Z","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":"2504.15208","last_updated":"2025-04-21T16:26:56Z","snapshot_observed_at":"2026-08-13T18:17:58.869042Z","submitted_at":"2025-04-21T16:26:56Z","title":"Compute-Optimal LLMs Provably Generalize Better With Scale","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15208","snapshot_observed_at":"2026-08-07T05:07:39.503440Z","title":"Compute-optimal LLMs provably generalize better with scale,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00004","last_updated":"2025-07-10T17:08:40Z","snapshot_observed_at":"2026-08-12T15:42:28.437403Z","submitted_at":"2025-06-10T14:47:48Z","title":"A Theory of Inference Compute Scaling: Reasoning through Directed Stochastic Skill Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:07:39.503440Z"},"links":{"cited_paper":"/paper/2504.15208","citing_paper":"/paper/2507.00004"},"observation_digest":"sha256:2eedac27ed67f25ff5e5d2b8c45a855301ea1b3620f1dff574dffd438d2bb870","observation_id":"b0430e10-3c59-4534-997b-f8613924f1d5","resolution":{"observed_at":"2026-08-07T05:07:39.503440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.15208/citation-record","integrity":"/paper/2504.15208/integrity","json":"/paper/2504.15208/citation-record.json","paper":"/paper/2504.15208"},"outbound":[],"paper":{"arxiv_id":"2504.15208","last_updated":"2025-04-21T16:26:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T18:17:58.869042Z","submitted_at":"2025-04-21T16:26:56Z","title":"Compute-Optimal LLMs Provably Generalize Better With Scale"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.15208."}