{"as_of":"2026-08-21T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:137c72d73ee458ba3d6b27e7f70db6addde2eb5d92dbaff58e587cbb1b6596d6","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-15T15:27:28.143731Z","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-07-11T02:57:47.058973Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"cited_work":{"arxiv_id":"2603.11161","doi":null,"metadata_source":"pith","pith_arxiv_id":"2603.11161","snapshot_observed_at":"2026-07-11T02:57:47.058973Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","venue":"cs.LG","work_id":"4736bbb5-f471-4c16-bb75-f78239f2777c","year":2026},"citing_paper":{"arxiv_id":"2607.05735","last_updated":"2026-07-07T01:41:42Z","snapshot_observed_at":"2026-08-17T14:04:56.684752Z","submitted_at":"2026-07-07T01:41:42Z","title":"Width-Robust Learnability in Mean-Field Bayesian Neural Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T02:50:06.746659Z"},"links":{"cited_paper":"/paper/2603.11161","citing_paper":"/paper/2607.05735"},"observation_digest":"sha256:a2ba8f4cfb91aa3707e54cc749dcb2467e5b35d8decd74cc8f49ea5e74ef10f7","observation_id":"1dda7ac2-3187-48fc-9b6f-e38505af4efd","resolution":{"observed_at":"2026-07-11T02:57:47.089470Z","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":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.11161","snapshot_observed_at":"2026-08-15T15:27:28.143731Z","title":"On the minimal degree bias in generalization on the unseen for non-boolean functions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00418","last_updated":"2026-08-01T03:39:57Z","snapshot_observed_at":"2026-08-21T13:43:13.716608Z","submitted_at":"2026-08-01T03:39:57Z","title":"Mask-Based Priors Are More Persistent than Query-Key Initializations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:27:28.143731Z"},"links":{"cited_paper":"/paper/2603.11161","citing_paper":"/paper/2608.00418"},"observation_digest":"sha256:7b520b6e0bc7df61fae8da150d09ed840f8f4800016483d8a9328266ec54908c","observation_id":"5c904b94-a1bc-47d6-b81d-a5fb689638c7","resolution":{"observed_at":"2026-08-15T15:27:28.143731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2603.11161/citation-record","integrity":"/paper/2603.11161/integrity","json":"/paper/2603.11161/citation-record.json","paper":"/paper/2603.11161"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"cc/paper_files/paper/2022/hash/ f96180a6b7d142d76f827a5d7367c3b2-Abstract-Conference","venue":null,"work_id":"a832af0e-090e-4c13-9151-f78309fba301","year":2022},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:5f7152a834a44650d68656ac83c8047ab6dbd43184d042b359c99536c02771a0","observation_id":"5fe1624c-4dfc-4d9d-87b0-5f7e3e158efe","resolution":{"observed_at":"2026-05-15T13:10:01.441272Z","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":"2006.11942","last_updated":"2020-12-04T09:23:18Z","snapshot_observed_at":"2026-08-16T10:18:39.807115Z","submitted_at":"2020-06-21T23:49:57Z","title":"Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descent","version":4},"cited_work":{"arxiv_id":"2006.11942","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.11942","snapshot_observed_at":"2026-07-03T20:08:56.167023Z","title":"cc/paper_files/paper/2022/file/ 884baf65392170763b27c914087bde01-Paper-Conference","venue":null,"work_id":"9b3cc048-d4ab-47ec-9452-fe22d22da24b","year":2006},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"cited_paper":"/paper/2006.11942","citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:ab528eeef4540eda20501d4cfd51db4b42d0dfc6b456720e3ed2cc791ba1e022","observation_id":"fbcd05cb-3176-46cf-804a-1ffdd812c76e","resolution":{"observed_at":"2026-05-15T13:10:00.843927Z","resolver_source":"arxiv_id","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0400000004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL http://www","venue":"Foundations and Trends® in Theoretical Computer Science","work_id":"55ec49c1-aae4-4c6f-b008-49d39c05f309","year":2022},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:9ed2a7adbdca2959ecee6491e4cd080c27809f6441ea765e881a89f046b64725","observation_id":"6dd7de2d-c618-43a7-bafa-e2d217c4527a","resolution":{"observed_at":"2026-05-15T13:10:00.813324Z","resolver_source":"doi","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":"2304.03408","last_updated":"2023-11-07T12:15:57Z","snapshot_observed_at":"2026-08-20T03:08:51.559513Z","submitted_at":"2023-04-06T23:11:49Z","title":"Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networks","version":3},"cited_work":{"arxiv_id":"2304.03408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.03408","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamics of finite width kernel and prediction fluctua- tions in mean field neural networks","venue":null,"work_id":"4fd94555-df06-47d8-ab5f-f73c8a3aa367","year":2023},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"cited_paper":"/paper/2304.03408","citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:2e9939fa11fa5decf9957a244a1d3c47425f7cd53e93dfead5ef7779cdcadc9e","observation_id":"09b6dcbb-3b14-48b4-ac2b-b39fc9402f82","resolution":{"observed_at":"2026-05-15T13:10:00.834753Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"10.1038/s41467-018-03101-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Nature Communications","work_id":"13636f50-7f64-43d7-899e-c97f8a3bf894","year":2009},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:2d1fa05f038d48366befaf6c2f5131c11f8168f1025e872de3edbb0b6f15c007","observation_id":"61552c39-6bd8-457d-9628-a1f45c0f1a2b","resolution":{"observed_at":"2026-05-15T13:10:00.776533Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"45533aae-1293-48f1-8194-7ffc5ae55e4f","year":null},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:f756cad0b9647798ee6f1f6912699d7abccc21aba298ec696ec2f0d66915dd84","observation_id":"1022e9fd-5986-47a3-b452-f49ca2a649d0","resolution":{"observed_at":"2026-05-15T13:10:01.438407Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06-05T21:23:00.469572Z","title":"pub/2021/framework/index.html","venue":null,"work_id":"4e2d32fb-f7bd-405a-bb19-088fe9c92ad6","year":2021},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:1eff721bba48b3d656832ea7ad15d87a7b7f9bf2468d419aa92df73b01e27319","observation_id":"4c047220-86ae-45da-a493-65523fb758f4","resolution":{"observed_at":"2026-05-15T13:10:01.435677Z","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":"1995.514853","doi":"10.1109/sct.1995.514853","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Also available as","venue":null,"work_id":"31169f2a-b47f-4a3b-8f83-faa91132a50c","year":2020},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:ba5cce35f8c7939d9b237d4273322a250c93d7b260ad04a80e6ec7b24d654cd5","observation_id":"2dd8ba67-4709-433e-a23a-c76522250c30","resolution":{"observed_at":"2026-05-15T13:10:00.792331Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2410.05229","last_updated":"2025-08-27T16:24:39Z","snapshot_observed_at":"2026-08-21T14:11:30.905906Z","submitted_at":"2024-10-07T17:36:37Z","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.05229","doi":"10.48550/arxiv.2410.05229","metadata_source":"pith","pith_arxiv_id":"2410.05229","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","venue":"cs.LG","work_id":"7d26909d-cb69-48f7-b93e-7d6fcc281415","year":2024},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2410.05229","citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:9176f8c29058d4f8acd91f62a361462266fb058e8bff46f208a6a7e1b5dbc6e0","observation_id":"7ffa1995-ea2d-4752-9c74-70923e24b6c9","resolution":{"observed_at":"2026-05-15T13:10:00.804640Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-07-18T18:51:19.596854+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T18:51:19.596854+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.02177","last_updated":"2022-01-06T18:43:37Z","snapshot_observed_at":"2026-08-18T12:23:06.967499Z","submitted_at":"2022-01-06T18:43:37Z","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","version":1},"cited_work":{"arxiv_id":"2201.02177","doi":"10.1109/tit.2005.851722","metadata_source":"pith","pith_arxiv_id":"2201.02177","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","venue":"cs.LG","work_id":"a3c30ead-1625-4c18-a9c1-e4928dcd0da6","year":2022},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2201.02177","citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:f23b491df6582892e13b3f81d74d0eac022b4651271e79bd8619a23c4a4ef376","observation_id":"cc7bd056-2c39-488e-adc4-1b4b5f93a416","resolution":{"observed_at":"2026-05-15T13:10:00.799164Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1805.08522","last_updated":"2019-04-21T10:16:54Z","snapshot_observed_at":"2026-08-16T15:57:47.198225Z","submitted_at":"2018-05-22T11:51:36Z","title":"Deep learning generalizes because the parameter-function map is biased towards simple functions","version":5},"cited_work":{"arxiv_id":"1805.08522","doi":"10.48550/arxiv.1805.08522","metadata_source":"pith","pith_arxiv_id":"1805.08522","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deep learning generalizes because the parameter-function map is biased towards simple functions","venue":"stat.ML","work_id":"fac56252-c56f-47f5-87d9-16d73bdccad9","year":2018},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1805.08522","citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:44858ab48a7ff35b54e211d09f9e5aa31467281838882079b2481f917f955f2c","observation_id":"9170bfc3-6605-4121-80fb-73ffe83e3866","resolution":{"observed_at":"2026-05-15T13:10:00.783480Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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.05369","last_updated":"2020-04-25T06:17:48Z","snapshot_observed_at":"2026-08-18T11:00:44.672942Z","submitted_at":"2018-10-12T06:21:22Z","title":"Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernel","version":4},"cited_work":{"arxiv_id":"1810.05369","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05369","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"von Mises, R.Mathematical Theory of Probability and Statistics","venue":null,"work_id":"8443640a-70c4-477b-9d90-7f614bf218c0","year":1964},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"cited_paper":"/paper/1810.05369","citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:b76f1473b74c3c31026c8cafe5977e9c5d3b61b0f36544a30fa23f2386a4ee6b","observation_id":"f7130ae5-86b2-4af0-bb6c-f7a14a5f00e4","resolution":{"observed_at":"2026-05-15T13:10:00.838705Z","resolver_source":"arxiv_id","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"TX c,e=1 Ac(s1)∆Σ′ ceAe(s2) # ≤ ∥∆Σ ′∥∞ E(s1,s2)","venue":null,"work_id":"4e8316a2-7bb2-4cdd-98d4-66677a465fa2","year":null},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:358c53af7c6fe585853e85809b81d103f1fe8b7837efe568f614f1c107fb73d8","observation_id":"5a94d5c5-37b5-413c-b37f-4cc866af8967","resolution":{"observed_at":"2026-05-15T13:10:01.431519Z","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-06-05T21:23:00.469572Z","title":"As estab- lished in Eq","venue":null,"work_id":"566ed5d1-4583-45ac-8a04-0fd33d3c3310","year":2017},"citing_paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-15T13:09:21.144212Z"},"links":{"citing_paper":"/paper/2603.11161"},"observation_digest":"sha256:6966431747e839ca698da8325351e22e7da8567f262a5c7bd94b84ea64b1e279","observation_id":"6d8772f3-7f42-43b3-9d26-a80b4675bcbc","resolution":{"observed_at":"2026-05-15T13:10:01.433574Z","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"}}],"paper":{"arxiv_id":"2603.11161","last_updated":"2026-05-07T13:22:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T02:24:29.615253Z","submitted_at":"2026-03-11T18:00:00Z","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":4},"total_outbound_references":14},"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 14 of 14 outbound references and 2 inbound Pith citation observations for arXiv:2603.11161."}