{"as_of":"2026-08-07T17:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11d3df69dd4686612e6595888047ece6a22eeb5d6f84b7018b78aad7955f1ba0","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-07T06:34:17.273281+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-03T05:00:55.259789Z","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":"2502.15118","last_updated":"2025-02-21T00:40:22Z","snapshot_observed_at":"2026-07-06T20:40:10.731339Z","submitted_at":"2025-02-21T00:40:22Z","title":"Do we really need the Rademacher complexities?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15118","snapshot_observed_at":"2026-08-03T05:00:55.259789Z","title":"Do we really need the Rademacher complexities?arXiv preprint arXiv:2502.15118, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.259789Z"},"links":{"cited_paper":"/paper/2502.15118","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:8efeba9ee83afd75b08e06f2449a575501a9719a72ce2381587e0be8cc6d4d4b","observation_id":"e41442ad-2089-4fe2-8d1a-5211f4c68f3d","resolution":{"observed_at":"2026-08-03T05:00:55.259789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.15118/citation-record","integrity":"/paper/2502.15118/integrity","json":"/paper/2502.15118/citation-record.json","paper":"/paper/2502.15118"},"outbound":[],"paper":{"arxiv_id":"2502.15118","last_updated":"2025-02-21T00:40:22Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-07-06T20:40:10.731339Z","submitted_at":"2025-02-21T00:40:22Z","title":"Do we really need the Rademacher complexities?"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.15118."}