{"as_of":"2026-08-21T14:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d54021113ae2ea82b77e04bcb54310644657fb25e36da95aa0d204590421d3e","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-21T06:32:19.484+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-08-15T16:51:22.690856Z","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-07T04:21:45.614872Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.11045","last_updated":"2020-07-21T19:08:21Z","snapshot_observed_at":"2026-08-21T06:31:28.523905Z","submitted_at":"2020-07-21T19:08:21Z","title":"On the Rademacher Complexity of Linear Hypothesis Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.11045","snapshot_observed_at":"2026-08-12T10:59:06.323609Z","title":"On the rademacher complexity of linear hypothesis sets,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.18806","last_updated":"2024-11-27T23:22:28Z","snapshot_observed_at":"2026-08-16T17:29:30.870026Z","submitted_at":"2024-11-27T23:22:28Z","title":"One-Step Early Stopping Strategy using Neural Tangent Kernel Theory and Rademacher Complexity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.323609Z"},"links":{"cited_paper":"/paper/2007.11045","citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:6ab4f03e957c167a45a238d11c7057fe44475bad7e2500c7ed2fd4ecf970c2c9","observation_id":"ad96ca48-d96a-4232-a518-ba69cc18d519","resolution":{"observed_at":"2026-08-12T10:59:06.323609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.11045","last_updated":"2020-07-21T19:08:21Z","snapshot_observed_at":"2026-08-21T06:31:28.523905Z","submitted_at":"2020-07-21T19:08:21Z","title":"On the Rademacher Complexity of Linear Hypothesis Sets","version":1},"cited_work":{"arxiv_id":"2007.11045","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.11045","snapshot_observed_at":"2026-08-07T04:21:45.614872Z","title":"On the Rademacher Complexity of Linear Hypothesis Sets","venue":"cs.LG","work_id":"aab9ca76-63dd-4cd6-9acc-872fef8c6d86","year":2020},"citing_paper":{"arxiv_id":"2506.11357","last_updated":"2025-06-12T23:17:09Z","snapshot_observed_at":"2026-08-14T23:18:02.630901Z","submitted_at":"2025-06-12T23:17:09Z","title":"Generalization Bound of Gradient Flow through Training Trajectory and Data-dependent Kernel","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:21:44.688117Z"},"links":{"cited_paper":"/paper/2007.11045","citing_paper":"/paper/2506.11357"},"observation_digest":"sha256:e8aebc80a67a3dfd3a04562d92af351c638127486d5ad86938e68c367817c27b","observation_id":"574c44fe-a603-4e54-88a9-6cd282d6e5fc","resolution":{"observed_at":"2026-08-07T04:21:45.620543Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.11045","last_updated":"2020-07-21T19:08:21Z","snapshot_observed_at":"2026-08-21T06:31:28.523905Z","submitted_at":"2020-07-21T19:08:21Z","title":"On the Rademacher Complexity of Linear Hypothesis Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.11045","snapshot_observed_at":"2026-08-15T16:51:22.690856Z","title":"On the R ademacher complexity of linear hypothesis sets","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.20616","last_updated":"2025-08-28T10:02:08Z","snapshot_observed_at":"2026-08-15T16:40:09.051986Z","submitted_at":"2025-08-28T10:02:08Z","title":"Dimension Agnostic Testing of Survey Data Credibility through the Lens of Regression","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:22.690856Z"},"links":{"cited_paper":"/paper/2007.11045","citing_paper":"/paper/2508.20616"},"observation_digest":"sha256:e3686ab0a24b5bacffcb8807e54a21e1dc3ac57066c7bc4478ad0cdb0df47f50","observation_id":"b2f28b6e-63aa-4b2b-9f88-0f0b68ba6be8","resolution":{"observed_at":"2026-08-15T16:51:22.690856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.11045/citation-record","integrity":"/paper/2007.11045/integrity","json":"/paper/2007.11045/citation-record.json","paper":"/paper/2007.11045"},"outbound":[],"paper":{"arxiv_id":"2007.11045","last_updated":"2020-07-21T19:08:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-21T06:31:28.523905Z","submitted_at":"2020-07-21T19:08:21Z","title":"On the Rademacher Complexity of Linear Hypothesis Sets"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2007.11045."}