{"as_of":"2026-08-19T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:60aca5cb17f4c8fbe60a7bfea64fe902f6a907cfc06981800b9f0a93512b42a5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:10:44.224567Z","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-16T00:10:45.874454Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.15118","last_updated":"2025-02-21T00:40:22Z","snapshot_observed_at":"2026-08-16T12:56:29.824505Z","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-14T14:03:14.169995Z","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:3222c0acbfb0f4bcb40d4465c431976b369926c715cff453c169ba74ea94e1ee","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"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15118","last_updated":"2025-02-21T00:40:22Z","snapshot_observed_at":"2026-08-16T12:56:29.824505Z","submitted_at":"2025-02-21T00:40:22Z","title":"Do we really need the Rademacher complexities?","version":1},"cited_work":{"arxiv_id":"2502.15118","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15118","snapshot_observed_at":"2026-08-16T00:10:45.874454Z","title":"Do we really need the Rademacher complexities?","venue":"math.ST","work_id":"d3d15e91-2a49-44bb-b527-ffcd73c36258","year":2025},"citing_paper":{"arxiv_id":"2608.12587","last_updated":"2026-08-12T21:01:33Z","snapshot_observed_at":"2026-08-18T15:03:55.684518Z","submitted_at":"2026-08-12T21:01:33Z","title":"DYSANOS Generative Dynamic Smooth Arbitrage-free Non-parametric Option Surfaces","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T00:10:44.224567Z"},"links":{"cited_paper":"/paper/2502.15118","citing_paper":"/paper/2608.12587"},"observation_digest":"sha256:5f8ae86bacf9365bf771c30a910f5e02e7853d90a2587dc3215fc2233a81c59b","observation_id":"f1ff6ce5-c61d-4c0f-9bf4-1858bb25dab5","resolution":{"observed_at":"2026-08-16T00:10:45.879144Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"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-08-16T12:56:29.824505Z","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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.15118."}