{"as_of":"2026-08-16T13:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed3b1c10697d33b3386179b13737926ce77fd70a77d081e76fb52613c34838ad","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:06:35.994946Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.12029/citation-record","integrity":"/paper/2411.12029/integrity","json":"/paper/2411.12029/citation-record.json","paper":"/paper/2411.12029"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:06:36.174811Z","title":"Using properties of the quantile function (e.g","venue":null,"work_id":"a4dae8f9-1d45-4589-b0fe-490b2eac7930","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.979187Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:7f12ca20e2fb27d3de1f379fd97af63db52a19d716ec411522ae6ca9b482393c","observation_id":"f0c7ce2b-539c-4faf-bb59-e5c65288ba5a","resolution":{"observed_at":"2026-08-12T18:06:36.179024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T18:06:36.118748Z","title":"20 G Proof of Lemma 2 We prove a slightly more general result, from which Lemma 2 can be immediately deduced","venue":null,"work_id":"aad4e712-bc3c-4ba1-836f-0989cfc23445","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.994946Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:9d002d4869501f5c76b32fa37cdbad0fe50744ae2b202f8c331cb7c4ce0dbad6","observation_id":"cb627515-15a7-46e7-9b4a-7ad7b6e5c960","resolution":{"observed_at":"2026-08-12T18:06:36.123971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T18:06:36.187244Z","title":"Then the statements ( 16) together with the continuous mapping theorem show that limn→∞ P(Bn(ε)) = 0","venue":null,"work_id":"a28dd0c9-38a5-4503-95f8-ae848ddbda18","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.974649Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:c3a19a850cec1f970b4dc2216f205874e6d46e9e4e111dfabb0427cfc86f69bf","observation_id":"1320a0a6-78ef-40d2-9132-7190f385e696","resolution":{"observed_at":"2026-08-12T18:06:36.191844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T18:06:36.148041Z","title":"Iterating the procedure we just described k times, we obtain that on an event An(t∗) ∩ (∩k j=1Bn,j ), where P(Bn,j ) ≥ 1 − δ/2k for all j ∈ [k] ˆtn ∈ F k n,δ/ 2k(T ) = Sn,δ,k","venue":null,"work_id":"2f08f742-b31e-4401-8f16-04b3358e3b4d","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.987124Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:361540af346f46d5bbf09b991454eb064abc752d3a4a8085d1746742b96b38e6","observation_id":"62594c44-5fe2-4e40-8fcb-7813593ebdf7","resolution":{"observed_at":"2026-08-12T18:06:36.152725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T18:06:36.162307Z","title":"With this knowl- edge, we now reuse the bound (","venue":null,"work_id":"9da248c7-b9a5-45ac-81ef-8e974bdb8b8e","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.983347Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:d41a0d9b65c2c0703e0f36fd99170f311fee9c2734132dcf34cd5cb9d2d423fc","observation_id":"7884d3ed-2957-4905-a0ca-df18d2c2cc5e","resolution":{"observed_at":"2026-08-12T18:06:36.166596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T18:06:36.132635Z","title":null,"venue":null,"work_id":"045160ce-4b9d-494d-9a73-351fa771d1a5","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.990829Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:9a8d02d43f0a0b1478393fe01eadb5af74fb2b75108a8e6fface8c4ee8f989b5","observation_id":"57c0e42c-4ec6-4ae6-bfca-f6d38052c774","resolution":{"observed_at":"2026-08-12T18:06:36.136746Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1305.4825","last_updated":"2016-09-17T09:42:53Z","snapshot_observed_at":"2026-08-15T00:17:08.643949Z","submitted_at":"2013-05-21T14:02:51Z","title":"Learning subgaussian classes : Upper and minimax bounds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.4825","snapshot_observed_at":"2026-08-12T18:06:35.969380Z","title":"Learning the Kernel Matrix with Semidefinite Programming","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.969380Z"},"links":{"cited_paper":"/paper/1305.4825","citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:1f82fb8bc245a690b94aa81b3088911a014702d91bf3d3d88390afd9b32a54c7","observation_id":"d8be3dec-c41c-45a8-a741-4fd6b1f89bf1","resolution":{"observed_at":"2026-08-12T18:06:35.969380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.11461","last_updated":"2022-02-23T12:27:53Z","snapshot_observed_at":"2026-08-13T16:35:29.361436Z","submitted_at":"2022-02-23T12:27:53Z","title":"Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.11461","snapshot_observed_at":"2026-08-12T18:06:35.964865Z","title":"Random Design Ana lysis of Ridge Regression","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.964865Z"},"links":{"cited_paper":"/paper/2202.11461","citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:9cfd34b28c562995b1aee3dd207483d25bc5a7465c95fa776a35bf49b0a01b3d","observation_id":"fc37f180-9dfe-4c51-bdeb-25e80614afaa","resolution":{"observed_at":"2026-08-12T18:06:35.964865Z","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-12T18:06:36.200414Z","title":"When Do Neural Networks Outperform Kernel Methods?","venue":null,"work_id":"6711acce-325a-4f93-992a-24522827e94f","year":null},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.956816Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:75711fa937c5e4d8578fb17cd403e534fe1e3e5fb5b9265f0898b6f12f44f8ae","observation_id":"5ff68e90-7ead-4e13-8d66-9ffe292a70af","resolution":{"observed_at":"2026-08-12T18:06:36.205107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"bj/1106314","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:06:36.098592Z","title":"Persistence in High-Di mensional Linear Predictor Selection and the Virtue of Overparametrization","venue":null,"work_id":"6c6e8cf4-40d8-48f0-be32-51138017a2cc","year":2015},"citing_paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T18:06:35.961021Z"},"links":{"citing_paper":"/paper/2411.12029"},"observation_digest":"sha256:7592a1627232625163f8b5dee73ee5c57f97ed46e73cf55b70d8fb7ddf2e2827","observation_id":"d8b89ee4-97eb-45d8-baf4-ed6f0bfc1f1a","resolution":{"observed_at":"2026-08-12T18:06:36.108255Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.12029","last_updated":"2024-11-18T20:05:05Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-12T17:57:12.150281Z","submitted_at":"2024-11-18T20:05:05Z","title":"On the Efficiency of ERM in Feature Learning"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":6},"total_outbound_references":10},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2411.12029."}