{"as_of":"2026-08-21T10:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7038241ecc3adf0b1b8847fb847559b11ebb93f87a763c430619dee3c765e589","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:59:06.323609Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2411.18806/citation-record","integrity":"/paper/2411.18806/integrity","json":"/paper/2411.18806/citation-record.json","paper":"/paper/2411.18806"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.278250Z","title":"Neural networks for fast optimisation in model predictive control: A review,","venue":null,"work_id":null,"year":2023},"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":1,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.278250Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:5946999aa240fe591c5de931eaf185555cdf79068176f4ad1010640a4afc617e","observation_id":"8a78f6db-4570-49ac-a781-c96cd36adf9a","resolution":{"observed_at":"2026-08-12T10:59:06.278250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.566494Z","title":"Neural tangent kernel: Con- vergence and generalization in neural networks,","venue":null,"work_id":"77a51ce9-c328-4df1-a731-8ffea1a56cbb","year":2018},"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":2,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.282422Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:57d805d93ab839de1d63f2ce8f3c9315712a4765ae61ec9728898f950f786d1c","observation_id":"51257fbe-815e-41aa-ac83-25a7ac7ceacb","resolution":{"observed_at":"2026-08-12T10:59:06.570167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1810.02054","last_updated":"2019-02-05T01:59:59Z","snapshot_observed_at":"2026-08-20T07:39:09.579125Z","submitted_at":"2018-10-04T04:47:47Z","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02054","snapshot_observed_at":"2026-08-12T10:59:06.285824Z","title":"Gradient descent provably optimizes over-parameterized neural networks,","venue":null,"work_id":null,"year":2018},"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":3,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.285824Z"},"links":{"cited_paper":"/paper/1810.02054","citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:b61072a2ce1f60f00f71f5eafeaac93e3ccd5aaaeca6d2c09f4514f7ae47d2ce","observation_id":"045d7450-91da-4319-9230-16ef152d0aab","resolution":{"observed_at":"2026-08-12T10:59:06.285824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.555159Z","title":"Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks,","venue":null,"work_id":"73c74f3b-a52c-437a-b116-e9b566546786","year":2019},"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":4,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.289959Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:e4487dd88fff68fe026b03da623430d476182966132aec07b2b7297366bf6c74","observation_id":"22a75806-2444-4d6d-a73e-8a7a923010bc","resolution":{"observed_at":"2026-08-12T10:59:06.559030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1906.05392","last_updated":"2019-07-04T00:17:07Z","snapshot_observed_at":"2026-08-14T16:16:29.998217Z","submitted_at":"2019-06-12T21:39:06Z","title":"Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobian","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05392","snapshot_observed_at":"2026-08-12T10:59:06.293828Z","title":"Generalization guarantees for neural networks via harnessing the low-rank structure of the jacobian,","venue":null,"work_id":null,"year":1906},"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":5,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.293828Z"},"links":{"cited_paper":"/paper/1906.05392","citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:d176faa02b5ebc4124d52ccfb68112d6618275db3dac0492ee9563f323cc27d5","observation_id":"29c7a8a9-567e-4268-94d4-be87dc588daf","resolution":{"observed_at":"2026-08-12T10:59:06.293828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.542408Z","title":"Implicit bias of MSE gradient optimiza- tion in underparameterized neural networks,","venue":null,"work_id":"c939e157-43d9-4686-b382-ac840713d4fa","year":2022},"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":6,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.298006Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:c4dafbc1bb7cb52dbe1dd017a451e3c199b8c8dd43f50a71e5a5373a6d3f226b","observation_id":"f99084aa-da01-478f-8300-230a6f6673b2","resolution":{"observed_at":"2026-08-12T10:59:06.547034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.530152Z","title":"Training and generalization errors for underparameterized neural networks,","venue":null,"work_id":"12619b8e-9c04-4d8e-b239-60ba1aac912f","year":2023},"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":7,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.302057Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:d0e42af32632d77687346185ba01b570aa6c8cf5aa6f9e91e68c7a613f3bcb35","observation_id":"47eca9f0-4a84-46b6-a1f7-1a193a85a2e5","resolution":{"observed_at":"2026-08-12T10:59:06.534202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.518733Z","title":"Founda- tions of machine learning,","venue":null,"work_id":"b41e14a4-bb2b-4e32-a7a5-b273d27fc937","year":2019},"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":8,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.305550Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:d9944fd4e9d21ba042ac6d47bc25b9f77e478dc14c4f10bae72ef5d5b97dea92","observation_id":"6399e108-210d-44fa-9e1b-9d9f99bb456b","resolution":{"observed_at":"2026-08-12T10:59:06.522940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.508026Z","title":"Rademacher and gaussian complex- ities: Risk bounds and structural results,","venue":null,"work_id":"51148681-9b0a-4888-ad58-7cf16163fb59","year":2002},"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":9,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.308963Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:63eed649ce711460b7085e4d175fcf4571f39123a4b7b427d06877b13b08e381","observation_id":"c2460a4e-8712-4c19-9076-ad618b0232a7","resolution":{"observed_at":"2026-08-12T10:59:06.511526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.497304Z","title":"Lecture notes for machine learning theory,","venue":null,"work_id":"093ab3be-9c9b-4396-bf59-192281efa851","year":2022},"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":10,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.312588Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:bc9403dd590e42e935e8ab62b6c470afcd92a0894b35fb2b59b2e06c54763bbc","observation_id":"bc194fbc-5818-4e36-87c4-bfd3c2857809","resolution":{"observed_at":"2026-08-12T10:59:06.500792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.316002Z","title":"Benign overfitting in linear regression,","venue":null,"work_id":null,"year":2020},"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":11,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.316002Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:3329f836330d0017e1980a52deb269ee249b0f756f91f098cda8f825034af0ef","observation_id":"ce65bcd8-f8d6-47f5-b618-a04f1667a2d3","resolution":{"observed_at":"2026-08-12T10:59:06.316002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:59:06.480842Z","title":"Pytorch: An imperative style, high-performance deep learning library,","venue":null,"work_id":"902402c7-ae5b-4b34-8ec2-db9e0805eade","year":2019},"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":12,"source":"pdf_text","source_observed_at":"2026-08-12T10:59:06.319559Z"},"links":{"citing_paper":"/paper/2411.18806"},"observation_digest":"sha256:99e5c7a3cfaec8c904107d3c13aaab66570c26c01790b50254d10c0d3f43f13e","observation_id":"73ac8217-890f-49fb-9e7d-a71cbadaa5a5","resolution":{"observed_at":"2026-08-12T10:59:06.487581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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"}}],"paper":{"arxiv_id":"2411.18806","last_updated":"2024-11-27T23:22:28Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":13},"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 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2411.18806."}