{"as_of":"2026-08-16T15:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f76801cc6f39c106500ee566fd544a517d7ac799d534ab56592c47f48c6623e1","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:18:56.722800Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"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/2505.13398/citation-record","integrity":"/paper/2505.13398/integrity","json":"/paper/2505.13398/citation-record.json","paper":"/paper/2505.13398"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.06518","last_updated":"2023-11-11T09:23:54Z","snapshot_observed_at":"2026-08-16T14:44:10.718201Z","submitted_at":"2023-11-11T09:23:54Z","title":"Minimum Description Length Hopfield Networks","version":1},"cited_work":{"arxiv_id":"2311.06518","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.06518","snapshot_observed_at":"2026-08-15T20:18:57.159382Z","title":"Minimum Description Length Hopfield Networks","venue":"cs.LG","work_id":"ab1f7348-c5e7-42db-a6fb-c0887d97f6e8","year":2023},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.563224Z"},"links":{"cited_paper":"/paper/2311.06518","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e39f74ee71af2d1fb8a4baa4d31eedc22018d4f8a93d4f237c7c4055722d4876","observation_id":"2e620648-d9ac-43b4-b6cb-4bfa614e4677","resolution":{"observed_at":"2026-08-15T20:18:57.205581Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:58.504197Z","title":"Review of parallel genetic algorithms bibliography.Technical Report, 1994","venue":null,"work_id":"9414e28c-713f-428d-a1c8-d882fbd9e367","year":1994},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.627584Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:3f17bf8ba1bf2752ebf77f0f13694a7edeb8dfbce2c022fff386dae1e7ab644c","observation_id":"17c35ad9-b067-4500-a1dd-cc0f0c4d6f66","resolution":{"observed_at":"2026-08-15T20:18:58.509348Z","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":{"arxiv_id":"2406.11341","last_updated":"2024-10-17T15:12:21Z","snapshot_observed_at":"2026-08-16T13:42:21.561493Z","submitted_at":"2024-06-17T08:59:04Z","title":"A Systematic Analysis of Large Language Models as Soft Reasoners: The Case of Syllogistic Inferences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11341","snapshot_observed_at":"2026-08-15T20:18:55.664972Z","title":"A systematic analysis of large language models as soft reasoners: The case of syllogistic inferences.arXiv preprint arXiv:2406.11341, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.664972Z"},"links":{"cited_paper":"/paper/2406.11341","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:62635c1cfa3d381394d094c78484e4290b1f2db0bc1eef1ea8ccbaa61a7ffd18","observation_id":"1fb2601d-a122-4814-a192-182e55dd7afb","resolution":{"observed_at":"2026-08-15T20:18:55.664972Z","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-15T20:18:58.486459Z","title":"PhD thesis, Massachusetts Inst","venue":null,"work_id":"1a2d9018-d979-4b0a-bdf5-9d1f08f29418","year":1982},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.671623Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:870b1e17cf3f65941e095507cf30c346d8d814d3d332202e050f7ee4ab146b0c","observation_id":"66bb8432-dacf-4390-b937-b2ba84d274e7","resolution":{"observed_at":"2026-08-15T20:18:58.492246Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:55.677392Z","title":"Language models are few-shot learners.Advances in neural information processing systems, 33:1877–1901, 2020","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.677392Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:b852174526ed4c8bd06933c90d6c208e3b95645815ebc82c9d0d257585bce409","observation_id":"eeee77f0-e979-4843-9e2a-4caefaaff96b","resolution":{"observed_at":"2026-08-15T20:18:55.677392Z","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-15T20:18:58.457077Z","title":"A survey of parallel genetic algorithms.Calculateurs paralleles, reseaux et systems repartis, 10(2):141–171, 1998","venue":null,"work_id":"321ab0d6-4b81-4623-a6f0-7620428c7d97","year":1998},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.683063Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e357b81122006ff7b76507cc956608787a1f6ebb34b73c9e40b227b60076cd92","observation_id":"049254d4-a656-49c5-857d-87665dfeadd8","resolution":{"observed_at":"2026-08-15T20:18:58.462234Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:55.689760Z","title":"Neural networks generalize on low complexity data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.689760Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:f14348b5343560e562bccde81b169a1bd0af8eaec7b415c673c5d2b0caecd374","observation_id":"51f03928-8069-435a-8e61-b5359814c7df","resolution":{"observed_at":"2026-08-15T20:18:55.689760Z","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-15T20:18:58.439427Z","title":"On the implicit bias of gradient descent for temporal extrapolation","venue":null,"work_id":"bc726095-4159-46bb-918b-a9ea7b75989a","year":2022},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.747029Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:02259fe63fbc11448cf9a277315b2f0eeaa35c8dcb72bfbec2df007356e3f743","observation_id":"917a66a3-7932-45e6-9d6d-a80a608cbeaa","resolution":{"observed_at":"2026-08-15T20:18:58.444920Z","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":{"arxiv_id":"cmp-lg/9611002","last_updated":"1996-11-12T19:17:31Z","snapshot_observed_at":"2026-07-07T01:34:00.353116Z","submitted_at":"1996-11-12T19:17:31Z","title":"Unsupervised Language Acquisition","version":1},"cited_work":{"arxiv_id":"cmp-lg/9611002","doi":null,"metadata_source":"pith","pith_arxiv_id":"cmp-lg/9611002","snapshot_observed_at":"2026-08-15T20:18:57.042935Z","title":"Unsupervised Language Acquisition","venue":"cmp-lg","work_id":"86ef638d-c9c7-4a1b-b431-da2bd89738d2","year":1996},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.769052Z"},"links":{"cited_paper":"/paper/cmp-lg/9611002","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e5c432353b0dfb75bf4a90d794b20c303747684e844fff72c15cf3eaf8e9dbc2","observation_id":"c99bde4f-fce8-4f3e-87a4-24dfc4b3d7cf","resolution":{"observed_at":"2026-08-15T20:18:57.048292Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:58.422768Z","title":"Faith and fate: Limits of transformers on compositionality.Advances in Neural Information Processing Systems, 36: 70293–70332, 2023","venue":null,"work_id":"a3d06876-a500-4676-8604-388658c96e5f","year":2023},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.774845Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:9dcfb98a342948a7f62efeabe18d5016fa73538244fff59b876feef5e4692151","observation_id":"628474ad-5f68-4ac7-9501-44de0397886d","resolution":{"observed_at":"2026-08-15T20:18:58.428060Z","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-15T20:18:58.407337Z","title":"Formal and empirical studies of counting behaviour in relu rnns","venue":null,"work_id":"58eccdfe-faff-4aa6-9985-96ef7c9ec58a","year":2023},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.779748Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:45d563aae7e9e992d20dde5b617a7920cda8fae64e1d0326ac4d165a71ede94a","observation_id":"79d9c8f7-220b-4a3c-b877-b4b2fd5203ea","resolution":{"observed_at":"2026-08-15T20:18:58.411738Z","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":{"arxiv_id":"2406.02356","last_updated":"2024-06-04T14:34:39Z","snapshot_observed_at":"2026-08-16T13:46:15.512039Z","submitted_at":"2024-06-04T14:34:39Z","title":"Language Models Do Hard Arithmetic Tasks Easily and Hardly Do Easy Arithmetic Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02356","snapshot_observed_at":"2026-08-15T20:18:55.784810Z","title":"Language models do hard arith- metic tasks easily and hardly do easy arithmetic tasks.arXiv preprint arXiv:2406.02356, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.784810Z"},"links":{"cited_paper":"/paper/2406.02356","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:d4c3e635cddbdaaa7551fe4d16e8cd8983f9b32cee54b96398810779ae506e26","observation_id":"b835650b-17f2-47e4-a2b2-69119fe602b5","resolution":{"observed_at":"2026-08-15T20:18:55.784810Z","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-15T20:18:58.391175Z","title":"Serial and parallel genetic algorithms as function optimiz- ers","venue":null,"work_id":"8b015269-b4ac-439a-bac1-b7eb3264be1f","year":1993},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.790658Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:4233a5cffeb0dd70686a3c26ca40f1df69b8f8de864a43c18d03621976b351b0","observation_id":"19dec316-1cd7-4bfd-b88c-862e11eb6b35","resolution":{"observed_at":"2026-08-15T20:18:58.396777Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:55.795831Z","title":"Inductive biases for deep learning of higher-level cognition","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.795831Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:0becd605ff168660cd08f46e331cf8d9a7b59916f953026a768cf2464fe3e0fa","observation_id":"0840cffa-3c28-4c6a-bff2-3e40976f34c2","resolution":{"observed_at":"2026-08-15T20:18:55.795831Z","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-15T20:18:58.362494Z","title":"A minimum description length approach to grammar inference","venue":null,"work_id":"cefb761d-7ef7-4b6e-bd00-abb3e4b3065f","year":1995},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.831843Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:170052fb47745c1636a4f0d0a4ef2cefb63eba0b82b882a16d083f38a7d723d0","observation_id":"82a37551-282b-408a-b61b-d0e1eae62779","resolution":{"observed_at":"2026-08-15T20:18:58.368358Z","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-15T20:18:58.345734Z","title":"Testing the limits of logical reasoning in neural and hybrid models","venue":null,"work_id":"72c8e164-7f3c-464a-9c48-beeb72b44ae5","year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.895085Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:73c88876e2d1a9ec088958334e75042ec694dc14ff020dbc1f8cee9b22eb4596","observation_id":"a6ae7bc1-3fa5-46d7-ba97-c7831929b5e2","resolution":{"observed_at":"2026-08-15T20:18:58.351157Z","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-15T20:18:58.327921Z","title":"Keeping the neural networks simple by minimizing the description length of the weights","venue":null,"work_id":"a6266ffe-4e85-45bd-8316-2e70f0b73a37","year":1993},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.935350Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:046c1762cf409327b68fde4836e813ba85266c817fa6157a3acbd84166b83eeb","observation_id":"652e8021-d81f-4771-9696-3f926f25375a","resolution":{"observed_at":"2026-08-15T20:18:58.333435Z","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-15T20:18:58.310567Z","title":"MIT press, 1992","venue":null,"work_id":"7a514e33-1902-41ef-a770-92e8eba85ded","year":1992},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.992511Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:789b0b1900ffb105656be04dac6dd863b4d094daeabd6d1ab9d162028e9565fe","observation_id":"a138c918-aac5-4881-8126-c4b0d61466a6","resolution":{"observed_at":"2026-08-15T20:18:58.314856Z","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-15T20:18:58.294304Z","title":"Stanford University, 1969","venue":null,"work_id":"c1bc59c0-7b33-4d70-ba28-8c5bffd65203","year":1969},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:55.998336Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:62160a426c50db090054fe550dbeb05396881610e5340ceeede0a1e7849dc9d6","observation_id":"ea22add9-d545-430f-a8c8-e9139f5561f8","resolution":{"observed_at":"2026-08-15T20:18:58.299593Z","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":{"arxiv_id":"2502.15823","last_updated":"2025-05-13T18:06:09Z","snapshot_observed_at":"2026-08-16T12:56:48.660460Z","submitted_at":"2025-02-20T03:48:00Z","title":"InductionBench: LLMs Fail in the Simplest Complexity Class","version":4},"cited_work":{"arxiv_id":"2502.15823","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15823","snapshot_observed_at":"2026-08-15T20:18:57.001724Z","title":"InductionBench: LLMs Fail in the Simplest Complexity Class","venue":"cs.LG","work_id":"dedcc324-a22b-413f-af13-7c04f3522c26","year":2025},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.003764Z"},"links":{"cited_paper":"/paper/2502.15823","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:365241a387af4682eb2f36c0f7b23d246876634290e3403f61c7da8a5c5aecac","observation_id":"d8ba7537-3cd8-4d8d-bb11-0832001dbbf8","resolution":{"observed_at":"2026-08-15T20:18:57.007165Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.009563Z","title":"macmillan, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.009563Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:53e8becc319374148343a644372fc4e3cd3717b3a71891f92685b78493a67363","observation_id":"1ad0b5c0-157b-4a90-ab99-4b1319e99c58","resolution":{"observed_at":"2026-08-15T20:18:56.009563Z","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-15T20:18:58.265929Z","title":"Minimum description length recurrent neural networks.Transactions of the Association for Computational Linguistics, 10: 785–799, 2022","venue":null,"work_id":"2f47e019-95fe-4a1b-8f4a-15451204b488","year":2022},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.014587Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:453af175dc036cf260ec71066bf40fc8dcbdf7060dc329862532d52fb55260e4","observation_id":"3976e51e-59f7-4cb8-a4da-47382648356b","resolution":{"observed_at":"2026-08-15T20:18:58.272137Z","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-15T20:18:58.248035Z","title":"Benchmarking neural network generalization for grammar induction","venue":null,"work_id":"464f6b9e-4800-478b-9b76-ead198f10a21","year":2023},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.019754Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:97ee37b4db9ab1389eccdd76229b2d07c515f3cd3c40d24a337a621d5d980d5c","observation_id":"adb73df5-b425-45ae-9de0-190b312b97ba","resolution":{"observed_at":"2026-08-15T20:18:58.254257Z","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":{"arxiv_id":"2402.10013","last_updated":"2024-06-06T16:16:12Z","snapshot_observed_at":"2026-08-16T14:18:16.840539Z","submitted_at":"2024-02-15T15:25:30Z","title":"Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length","version":2},"cited_work":{"arxiv_id":"2402.10013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.10013","snapshot_observed_at":"2026-08-15T20:18:56.975101Z","title":"Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length","venue":"cs.CL","work_id":"e1b724f6-771a-483f-b8a8-c250cc8c194e","year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.024534Z"},"links":{"cited_paper":"/paper/2402.10013","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:31b58448ebcebf23fae1b99bbb8723fc1aa07f8bec0e45313739eab54e3cef62","observation_id":"9748c59f-fde3-423b-b4e7-e575d28e8299","resolution":{"observed_at":"2026-08-15T20:18:56.982385Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:58.229282Z","title":"Springer, 2008","venue":null,"work_id":"9a084916-2554-45c8-8d33-c21442ca51d6","year":2008},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.141496Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:5f906368d2143aca27a202e4f355ba0204d689b7aab0eaa802201384fe225252","observation_id":"c9ebbe10-8e80-400c-8499-6b400a0033ea","resolution":{"observed_at":"2026-08-15T20:18:58.235130Z","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-15T20:18:58.210965Z","title":"Deep neural networks have an inbuilt occam’s razor.Nature Communications, 16(1):220, 2025","venue":null,"work_id":"dd83cb12-3d58-4a76-8791-42d49bfa42d3","year":2025},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.169558Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:bc0ca78947f2aee15801a35cc48752acc630ac3a4298667788956e9bf6dc785b","observation_id":"d192fd17-4d4c-4849-9e60-fbc9cfe7e5fa","resolution":{"observed_at":"2026-08-15T20:18:58.217442Z","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":{"arxiv_id":"2410.05229","last_updated":"2025-08-27T16:24:39Z","snapshot_observed_at":"2026-08-16T08:54:56.543625Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05229","snapshot_observed_at":"2026-08-15T20:18:56.174117Z","title":"Gsm-symbolic: Understanding the limitations of mathematical reasoning in large language models.arXiv preprint arXiv:2410.05229, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.174117Z"},"links":{"cited_paper":"/paper/2410.05229","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:cba99324cd83f4c9b80c976cb3b5e3a79679fdb03066a5b7599a72e4c8eb321e","observation_id":"19aecaa0-5eed-47b8-a0fd-0ec3b8602bfe","resolution":{"observed_at":"2026-08-15T20:18:56.174117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02061","last_updated":"2025-03-05T01:58:08Z","snapshot_observed_at":"2026-08-16T13:46:24.606435Z","submitted_at":"2024-06-04T07:43:33Z","title":"Alice in Wonderland: Simple Tasks Showing Complete Reasoning Breakdown in State-Of-the-Art Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02061","snapshot_observed_at":"2026-08-15T20:18:56.179472Z","title":"Alice in wonderland: Simple tasks showing complete reasoning breakdown in state-of-the-art large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.179472Z"},"links":{"cited_paper":"/paper/2406.02061","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e7e0b1c5639e14b5f33117a97a1e7a4b81500a7e759816024ab92fe765d28c2d","observation_id":"d17023af-0617-4c99-9168-8866fc828a80","resolution":{"observed_at":"2026-08-15T20:18:56.179472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21272","last_updated":"2025-05-20T16:29:40Z","snapshot_observed_at":"2026-08-16T13:05:16.958093Z","submitted_at":"2024-10-28T17:59:06Z","title":"Arithmetic Without Algorithms: Language Models Solve Math With a Bag of Heuristics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21272","snapshot_observed_at":"2026-08-15T20:18:56.183675Z","title":"Arithmetic without algo- rithms: Language models solve math with a bag of heuristics.arXiv preprint arXiv:2410.21272, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.183675Z"},"links":{"cited_paper":"/paper/2410.21272","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:034a6d2d243d50b653465008dfa4647e5fa2af0be04764995d718b34015ca207","observation_id":"73f285d0-2879-41a8-8de7-632e18def59f","resolution":{"observed_at":"2026-08-15T20:18:56.183675Z","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-15T20:18:58.193231Z","title":"Bayesian learning of visual chunks by human observers.Proceedings of the National Academy of Sciences, 105(7):2745– 2750, 2008","venue":null,"work_id":"809db83c-8ce1-4424-8b21-1719fbedc7cc","year":2008},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.187999Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:60641cf4442ca9613b24abd3f8b3b2bae6eaaee3e3cc912fd105a5f1baa34b12","observation_id":"93e4c020-b602-45e8-8291-796e69514d9b","resolution":{"observed_at":"2026-08-15T20:18:58.199163Z","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-15T20:18:58.176202Z","title":"On evaluation metrics in optimality theory.Linguistic Inquiry, 47 (2):235–282, 2016","venue":null,"work_id":"692c0176-2e28-47e5-9dc1-56d28547ead6","year":2016},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.266742Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:71ec5e2e6abccb7b1f8b01392b8100111d2f311e9cfcd1d15923cff23f252dbc","observation_id":"86ea1c98-71d5-40a2-a99a-aaa2d86c35cf","resolution":{"observed_at":"2026-08-15T20:18:58.181643Z","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-15T20:18:58.153502Z","title":"Approaching explanatory adequacy in phonology using minimum description length.Journal of Language Modelling, 9 (1):17–66, 2021","venue":null,"work_id":"612ccb89-06ed-4671-a27e-ce3d32751a88","year":2021},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.310218Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:681acabdc42e27b7e2ac83584ce9d3e14eb4dd5b88589300a75c8cb300238392","observation_id":"1c4df4bf-c9f7-45be-9938-c3c94c1eb550","resolution":{"observed_at":"2026-08-15T20:18:58.163435Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.315127Z","title":"Modeling by shortest data description.Automatica, 14(5):465–471, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.315127Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e330e23ad813516fdffa4845f274bc7afeeb98b8fc3a133b22e299bc6f60c39e","observation_id":"d01045cd-10d9-4e38-a094-84b218f9d0ff","resolution":{"observed_at":"2026-08-15T20:18:56.315127Z","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-15T20:18:58.070241Z","title":"Discovering neural nets with low kolmogorov complexity and high generalization capability.Neural Networks, 10(5):857–873, 1997","venue":null,"work_id":"af95cafd-0f0b-444f-b43e-74b3235e7cbb","year":1997},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.319709Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:abbaeada95e55b5a62a94add6ee0d89f664cbcdf5db606d46571f1ddee38fc7b","observation_id":"c47436b2-3680-4c0b-9550-37ef9d39e09c","resolution":{"observed_at":"2026-08-15T20:18:58.114536Z","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-15T20:18:58.015005Z","title":"PhD thesis, Massachusetts Institute of Technology, 2009","venue":null,"work_id":"4a754634-2c01-460e-b3fc-f9a82eb90133","year":2009},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.324346Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:ac91d5b28d049cd35da5dca148725aef7923da66aba4f16d8b691396cc425f21","observation_id":"09347089-2823-4286-813c-8cef2a3a3d38","resolution":{"observed_at":"2026-08-15T20:18:58.020371Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.329468Z","title":"A mathematical theory of communication.The Bell system technical journal, 27(3):379–423, 1948","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.329468Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:3e5646361a10ac1e81c128b766fc5d31a3fde83a5a48dc84107ef51512c702f5","observation_id":"add65634-7b00-4c22-8845-e8c05944cc42","resolution":{"observed_at":"2026-08-15T20:18:56.329468Z","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-15T20:18:57.987150Z","title":"On the computational power of neural nets","venue":null,"work_id":"20bb4616-9b6c-418d-b054-ee6c35c4f66e","year":1992},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.372141Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:015020135d45467598ca2182115eaa2215e3d3ec92e8c621412e909b2f54f7f5","observation_id":"8858dd8b-61da-45c0-be0a-6aaae158e86b","resolution":{"observed_at":"2026-08-15T20:18:57.992293Z","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-15T20:18:57.968006Z","title":"A formal theory of inductive inference","venue":null,"work_id":"0a3b9aed-fe30-4115-937f-a785163ef1b2","year":1964},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.473261Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:2ad4dd701af9dda5600273253533068ba7184ab5747009e24dca41f2b035ae19","observation_id":"24222ce9-745e-4b64-b0dc-720e8bf67664","resolution":{"observed_at":"2026-08-15T20:18:57.974602Z","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-15T20:18:57.929285Z","title":"A provably stable neural network turing machine with finite precision and time.Information Sciences, 658:120034, 2024","venue":null,"work_id":"32ee02bb-7c1d-4960-9cac-5d0ee9bb163e","year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.540221Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:26e29fe21d7c3ac5562671a3648b1bf0001b2b64cae06c378ad776934beb54bf","observation_id":"a96e6933-3019-483c-b4dc-12e900255a3b","resolution":{"observed_at":"2026-08-15T20:18:57.934343Z","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-15T20:18:57.847552Z","title":"University of California, Berkeley, 1994","venue":null,"work_id":"f35c19e0-eb05-4a84-93a0-53dcf2ea8182","year":1994},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.545923Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:9fbac66809d38cb799c916355624354979f62d0ace6d5a368663c767b8fa0550","observation_id":"3e32a1c2-e19d-40d3-bed4-999876d2fe19","resolution":{"observed_at":"2026-08-15T20:18:57.901231Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.550917Z","title":"How to grow a mind: Statistics, structure, and abstraction.science, 331(6022):1279–1285, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.550917Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:4a0f28cb5493550a6a58e09ba60cfabedb5220f8aca0796ff877440d555ac37d","observation_id":"16942d4f-e811-45e6-b136-7303ce5765b1","resolution":{"observed_at":"2026-08-15T20:18:56.550917Z","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-15T20:18:57.707294Z","title":"Evaluating the world model implicit in a generative model.Advances in Neural Information Processing Systems, 37:26941–26975, 2025","venue":null,"work_id":"b87a2666-3f57-4f54-965b-3f9091b09252","year":2025},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.557276Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:5bb521309b1d6fe6a16cc5f3e01a94847737be62db642fa942832405cf57f953","observation_id":"46e88359-5a07-4176-97b1-6407867d80e3","resolution":{"observed_at":"2026-08-15T20:18:57.789261Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.563209Z","title":"Large language models still can’t plan (a benchmark for llms on planning and reasoning about change)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.563209Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e635c98267a3f369b33767371370b8bbd8d172d864d3a5ed6e8a83aec334da22","observation_id":"4dc7db69-8b65-4070-af06-bfd2e0fc03d3","resolution":{"observed_at":"2026-08-15T20:18:56.563209Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.568493Z","title":"Thinking like transformers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.568493Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:18121a2ec4bf97f3738c402cbc473bc2c753be55e101a5f845698479b98838fb","observation_id":"f8233762-5209-4fbb-8e02-2754ce17965e","resolution":{"observed_at":"2026-08-15T20:18:56.568493Z","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-15T20:18:57.578381Z","title":"Reasoning or reciting? exploring the capabilities and limitations of language models through counterfactual tasks","venue":null,"work_id":"cb9760da-0d50-4a8d-bd3a-b7014919a48a","year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.575149Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:372086a28589b0839a75aa26c2712e67946c081fdaf0f7ea74cb40d76aaadb6d","observation_id":"d567f80e-c003-4203-9a3d-8d67ab0d2c3a","resolution":{"observed_at":"2026-08-15T20:18:57.638794Z","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-15T20:18:57.558939Z","title":"Word learning as bayesian inference.Psychological review, 114(2):245, 2007","venue":null,"work_id":"63bcd9ac-3ee0-4586-9d89-11572a6d8360","year":2007},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.605616Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:e7fe63582b8a87fba9e9a5630ce32522b143b5da3229d7edfcabd381d3d0dd5c","observation_id":"8fc172f8-c328-4ec5-9c83-156fda8a98ea","resolution":{"observed_at":"2026-08-15T20:18:57.566074Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:56.668970Z","title":"When can transformers count to n?arXiv preprint arXiv:2407.15160, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.668970Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:01ce3765eb38f890bfa416b5e9d2c0d8fa01b32e5b1ab1b84af3a6d5cdd17000","observation_id":"97ce164b-ef22-46e6-92d2-88ad115e1bee","resolution":{"observed_at":"2026-08-15T20:18:56.668970Z","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-15T20:18:57.319412Z","title":"Balancing accuracy and parsimony in genetic programming.Evolutionary Computation, 3(1):17–38, 1995","venue":null,"work_id":"acf09992-c501-4b5f-abe1-886ef3e679a7","year":1995},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.711780Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:927832c7b760fe30784c7c7526a263235eedfbaa1ce79c5d52a0b804b6514a51","observation_id":"f3e2adfe-096a-40e2-a34d-f998817fb9db","resolution":{"observed_at":"2026-08-15T20:18:57.466257Z","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-15T20:18:57.300870Z","title":"Evolving optimal neural networks using genetic algorithms with occam’s razor.Complex systems, 7(3):199–220, 1993","venue":null,"work_id":"fa211658-84db-4e2a-b93e-973bea6da604","year":1993},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.717375Z"},"links":{"citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:ffe28486a1f4a630f8893b65818628d734a4c17af919d9cf14d12fa5dd704df8","observation_id":"1702002b-7bd4-4bb3-8c22-23cc2bc6e6ee","resolution":{"observed_at":"2026-08-15T20:18:57.306590Z","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":{"arxiv_id":"2205.11502","last_updated":"2022-05-24T20:56:39Z","snapshot_observed_at":"2026-08-15T00:04:44.274000Z","submitted_at":"2022-05-23T17:56:48Z","title":"On the Paradox of Learning to Reason from Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11502","snapshot_observed_at":"2026-08-15T20:18:56.722800Z","title":"On the paradox of learning to reason from data.arXiv preprint arXiv:2205.11502, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:56.722800Z"},"links":{"cited_paper":"/paper/2205.11502","citing_paper":"/paper/2505.13398"},"observation_digest":"sha256:643b7ae74b67edaffaba3d560d6918b211facba080aaf1f964786d124ff039e7","observation_id":"f046198a-3b83-4b2d-b405-6d71900ded75","resolution":{"observed_at":"2026-08-15T20:18:56.722800Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.13398","last_updated":"2025-09-08T09:23:08Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T20:12:26.883392Z","submitted_at":"2025-05-19T17:34:56Z","title":"A Minimum Description Length Approach to Regularization in Neural Networks"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":4,"verified_fuzzy":30},"total_outbound_references":50},"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 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2505.13398."}