{"as_of":"2026-08-10T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf1d1645022b3ff832d3b70d76f00005c1901f53b6b89640ef2ac8e7e59fb051","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:40:57.219755Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-07T18:32:14.733852Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T12:28:16.606577Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.18266","snapshot_observed_at":"2026-08-07T18:32:14.733852Z","title":"Uncovering a universal abstract algorithm for modular addition in neural networks, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.10390","last_updated":"2025-07-08T18:20:16Z","snapshot_observed_at":"2026-08-08T23:23:47.910559Z","submitted_at":"2025-02-14T18:59:40Z","title":"(How) Can Transformers Predict Pseudo-Random Numbers?","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T18:32:14.733852Z"},"links":{"cited_paper":"/paper/2505.18266","citing_paper":"/paper/2502.10390"},"observation_digest":"sha256:f9023c9e6980138562a12482a1fe12c62918ed3cf4da9877b464993f538ac8bf","observation_id":"f3e92fce-8555-4c51-b983-84e7284a6016","resolution":{"observed_at":"2026-08-07T18:32:14.733852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"cited_work":{"arxiv_id":"2505.18266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18266","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Uncovering a universal abstract algorithm for modular addition in neural networks","venue":null,"work_id":"dabc80d7-e641-4327-aadb-b7ec80cd8c27","year":2025},"citing_paper":{"arxiv_id":"2605.18022","last_updated":"2026-05-18T08:12:45Z","snapshot_observed_at":"2026-08-07T16:14:21.049246Z","submitted_at":"2026-05-18T08:12:45Z","title":"Unveiling Memorization-Generalization Coexistence: A Case Study on Arithmetic Tasks with Label Noise","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-20T12:27:56.774581Z"},"links":{"cited_paper":"/paper/2505.18266","citing_paper":"/paper/2605.18022"},"observation_digest":"sha256:efb71da2d3d7f6fc34acfaecd45f883be387b657d02f6360cad123a61a11365e","observation_id":"bab6ce43-d1d8-43bd-aa96-d6b34fe1ddd8","resolution":{"observed_at":"2026-05-20T12:28:16.608417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.18266/citation-record","integrity":"/paper/2505.18266/integrity","json":"/paper/2505.18266/citation-record.json","paper":"/paper/2505.18266"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:40:53.166207Z","title":"Zoom in: An introduction to circuits.Distill, 5(3):e00024–001, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.166207Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:ad7e8e5a4701919c59211760f48ad3376565f78bd2507155a1d7a149a04a9da5","observation_id":"a40db060-55bb-4ecb-8bf1-c6b121d0e662","resolution":{"observed_at":"2026-08-07T14:40:53.166207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.07543","last_updated":"2016-02-28T22:04:54Z","snapshot_observed_at":"2026-08-03T16:55:19.885866Z","submitted_at":"2015-11-24T02:31:46Z","title":"Convergent Learning: Do different neural networks learn the same representations?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.07543","snapshot_observed_at":"2026-08-07T14:40:53.254885Z","title":"Convergent learning: Do different neural networks learn the same representations?arXiv preprint arXiv:1511.07543, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.254885Z"},"links":{"cited_paper":"/paper/1511.07543","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:724cacd4e3ead9ee53acb460c0e24aa574e8a9584eb109e267081dc2af8e05f9","observation_id":"8cb2f851-a49c-4ded-9d85-01088bc78e3f","resolution":{"observed_at":"2026-08-07T14:40:53.254885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07987","last_updated":"2024-07-25T09:33:50Z","snapshot_observed_at":"2026-08-06T11:02:06.607024Z","submitted_at":"2024-05-13T17:58:30Z","title":"The Platonic Representation Hypothesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07987","snapshot_observed_at":"2026-08-07T14:40:53.360915Z","title":"The platonic representation hypothesis.arXiv preprint arXiv:2405.07987, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.360915Z"},"links":{"cited_paper":"/paper/2405.07987","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:13ed637334a99b7b5d3cca77c58acaa1d7924747fb30e8ebd757e99131990649","observation_id":"7f50ce00-027f-48d1-8a17-5a3903f3833f","resolution":{"observed_at":"2026-08-07T14:40:53.360915Z","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-07T14:40:53.491186Z","title":"Progress mea- sures for grokking via mechanistic interpretability","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.491186Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:a101eac8facee8250065ad538334f6215f298a07654b7ba09cc53fbd07181eb1","observation_id":"652ef375-8c70-474d-88df-fe7283821d8e","resolution":{"observed_at":"2026-08-07T14:40:53.491186Z","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-07T14:40:53.563566Z","title":"The clock and the pizza: Two stories in mechanistic explanation of neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.563566Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:126248e49c95cdb39165b21f09df8f8ca608782286129dd41b56b0fa99c03d2d","observation_id":"b99bb124-3bd4-4d54-92d7-c4b8cb3ee7ba","resolution":{"observed_at":"2026-08-07T14:40:53.563566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.02679","last_updated":"2023-01-06T19:00:01Z","snapshot_observed_at":"2026-08-06T08:20:11.326697Z","submitted_at":"2023-01-06T19:00:01Z","title":"Grokking modular arithmetic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.02679","snapshot_observed_at":"2026-08-07T14:40:53.645862Z","title":"Grokking modular arithmetic.arXiv preprint arXiv:2301.02679, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.645862Z"},"links":{"cited_paper":"/paper/2301.02679","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:b49a33918a3019bd87a1274e26013e756631c31e1b7f8670dc6806b18f1372ec","observation_id":"326d5541-bcf5-4ddf-ad9c-0f012c39f40f","resolution":{"observed_at":"2026-08-07T14:40:53.645862Z","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-07T14:41:01.890350Z","title":"Edelman, Costin-Andrei Oncescu, Rosie Zhao, and Sham M","venue":null,"work_id":"7d0a6a44-cee2-43db-a6d7-9866ac805f75","year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.738461Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:73712088f00446e90a647b8ad5ed012bf2b4f9d8d3444480c615d1710436b48a","observation_id":"e7bd76c8-14ee-4850-89e5-bccded7725a6","resolution":{"observed_at":"2026-08-07T14:41:02.014506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:41:01.521665Z","title":"A toy model of universality: Reverse engineering how networks learn group operations","venue":null,"work_id":"3841cc35-d496-4e20-86ba-be9c0877dbf3","year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:53.860696Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:35823c28b921c00da1b7d3a246b0f798d62ce3fa5d43f2d78ba98ede629ce350","observation_id":"75e51b3f-f411-4ab4-8ecf-6aba9f418d6d","resolution":{"observed_at":"2026-08-07T14:41:01.731397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:41:01.127291Z","title":"Grokking group multiplication with cosets","venue":null,"work_id":"ff1f514a-cab1-49ca-a2ce-aca7223070ea","year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.011624Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:cb5c936797bad6a191f940a07a44da9e308f25b15550de0bbf5e686ecc85daa1","observation_id":"051f1374-a86b-4312-a005-f0fae742a0a3","resolution":{"observed_at":"2026-08-07T14:41:01.311382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:41:00.759378Z","title":"Neural networks learn representation theory: Reverse engineering how networks perform group operations","venue":null,"work_id":"a25df61c-d072-4874-82cd-8c7c8da25945","year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.101934Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:185aefb59fa906e4d102e3ed9bc9c8310f320d4ca2559686a7ad176cf52272da","observation_id":"ee1c2a1f-b733-45f9-95e8-18f7dfd094b5","resolution":{"observed_at":"2026-08-07T14:41:00.913368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T02:11:23.670680Z","submitted_at":"2022-01-06T18:43:37Z","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.02177","snapshot_observed_at":"2026-08-07T14:40:54.198192Z","title":"Grokking: Generalization beyond overfitting on small algorithmic datasets, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.198192Z"},"links":{"cited_paper":"/paper/2201.02177","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:de65494ea6179953c8dc29df058a0ab7d2b7eb821cd2ed55ede2162a9617ea02","observation_id":"a1dd26ae-20e4-4e1b-85c1-f2f8b4719421","resolution":{"observed_at":"2026-08-07T14:40:54.198192Z","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-07T14:41:00.419206Z","title":"Grokking modular arithmetic can be explained by margin maximization","venue":null,"work_id":"c131f442-e68d-4296-9a85-b39e93b4d874","year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.325309Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:19c4460be14956c4695e3bf70344959edc26345ada24fdf99e1d63ff2988faaa","observation_id":"8d970e66-191a-4de5-8f5f-42613f4e0527","resolution":{"observed_at":"2026-08-07T14:41:00.566341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16496","last_updated":"2025-01-27T20:57:18Z","snapshot_observed_at":"2026-07-06T20:27:04.664873Z","submitted_at":"2025-01-27T20:57:18Z","title":"Open Problems in Mechanistic Interpretability","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16496","snapshot_observed_at":"2026-08-07T14:40:54.459356Z","title":"Michaud, Stephen Casper, Max Tegmark, William Saunders, David Bau, Eric Todd, Atticus Geiger, Mor Geva, Jesse Hoogland, Daniel Murfet, and Tom McGrath","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.459356Z"},"links":{"cited_paper":"/paper/2501.16496","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:f9b956c7ff2711f9968276d49d56a6af05783c8e0e361f7cdd097c623805fb70","observation_id":"30b1ff91-1129-4565-af17-7658331d90a5","resolution":{"observed_at":"2026-08-07T14:40:54.459356Z","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-07T14:41:00.174829Z","title":"Thread: Circuits.Distill, 2020","venue":null,"work_id":"9bd5c164-aebd-498b-838d-f252b2892a2c","year":2020},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.558939Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:92d7e9d37ef5dba694aa84ae9d2ab102120dee4e0e56914b41bfe876d0bb3a4f","observation_id":"ef968e82-c10e-4928-8742-bd8f35314717","resolution":{"observed_at":"2026-08-07T14:41:00.247003Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:40:54.684451Z","title":"A mathematical framework for transformer circuits.Transformer Circuits Thread,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.684451Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:07f71b07df200d71430d3c1a06733301be2b72cf867080358a476606f4669ee9","observation_id":"06dd71ed-dc68-4526-b89e-c5722863c611","resolution":{"observed_at":"2026-08-07T14:40:54.684451Z","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-07T14:40:54.885770Z","title":"In-context learning and induction heads.Transformer Circuits Thread, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.885770Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:f4451f5f2d8bdce6bc9e04c6a352cd5c8b56e86a30488dcff3e182dad3e8882f","observation_id":"3fcf4fe0-b59d-4059-a787-e7d54097508e","resolution":{"observed_at":"2026-08-07T14:40:54.885770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.10652","last_updated":"2022-09-21T20:49:26Z","snapshot_observed_at":"2026-07-06T13:54:56.779166Z","submitted_at":"2022-09-21T20:49:26Z","title":"Toy Models of Superposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.10652","snapshot_observed_at":"2026-08-07T14:40:55.005013Z","title":"Toy models of superposition.arXiv preprint arXiv:2209.10652, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.005013Z"},"links":{"cited_paper":"/paper/2209.10652","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:fa7d734e7158e87073bc2b1c45f5cc8e02e63a81555b5530b39651fceda1f5e4","observation_id":"5f417759-0ca5-49cd-a230-a409296389e7","resolution":{"observed_at":"2026-08-07T14:40:55.005013Z","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-07T14:40:59.839987Z","title":"From understanding computation to understanding neural circuitry","venue":null,"work_id":"4ffaab46-078e-4de9-85cc-79b9b8699bde","year":1979},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.136536Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:0078bc05adec3993dd029008d173808fb8ecc7d16196576fb86e2edccdf84f62","observation_id":"27a22bb0-6496-4730-9314-aed84e835155","resolution":{"observed_at":"2026-08-07T14:40:59.976611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05107","last_updated":"2020-04-06T15:58:44Z","snapshot_observed_at":"2026-08-08T02:53:52.553667Z","submitted_at":"2020-04-06T15:58:44Z","title":"Levels of Analysis for Machine Learning","version":1},"cited_work":{"arxiv_id":"2004.05107","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.05107","snapshot_observed_at":"2026-08-07T14:40:57.731221Z","title":"Levels of Analysis for Machine Learning","venue":"cs.CY","work_id":"2bc830ea-5d04-4338-8444-d494c5911d7d","year":2020},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.233422Z"},"links":{"cited_paper":"/paper/2004.05107","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:a18a9b1dcb6f1b94ca9e8e5bcd9110acf172f534e095c3013ba2f24ce046216a","observation_id":"d9915aaa-6aa8-4b09-b845-c1be79042c9a","resolution":{"observed_at":"2026-08-07T14:40:57.796916Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12664","last_updated":"2024-08-26T02:35:50Z","snapshot_observed_at":"2026-07-06T19:04:47.884694Z","submitted_at":"2024-08-22T18:17:20Z","title":"Multilevel Interpretability Of Artificial Neural Networks: Leveraging Framework And Methods From Neuroscience","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12664","snapshot_observed_at":"2026-08-07T14:40:55.305178Z","title":"Multilevel interpretability of artificial neural networks: Leveraging framework and methods from neuroscience.arXiv preprint arXiv:2408.12664, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.305178Z"},"links":{"cited_paper":"/paper/2408.12664","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:6a691a91b262dce751cdf9ccba0811036e9ebd230e0edb28f4dcc6bbafeb41fd","observation_id":"48b7ea23-a93e-41a9-b6a6-562e195a25f0","resolution":{"observed_at":"2026-08-07T14:40:55.305178Z","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-07T14:40:59.613748Z","title":"Vilas, Federico Adolfi, David Poeppel, and Gemma Roig","venue":null,"work_id":"ae2eeb95-bc5b-4f7a-a819-1a8a8fa3dda9","year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.380980Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:31a4ceb3eb78ff4b9ca84ee67aa74562bbc0655f7f4a45277e2d835f42306f6b","observation_id":"b5fe882a-6337-4b89-a591-23fa2d4d14d8","resolution":{"observed_at":"2026-08-07T14:40:59.719652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.04785","last_updated":"2023-04-21T22:03:01Z","snapshot_observed_at":"2026-08-06T09:36:49.383596Z","submitted_at":"2022-07-11T11:35:43Z","title":"SALSA: Attacking Lattice Cryptography with Transformers","version":2},"cited_work":{"arxiv_id":"2207.04785","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.04785","snapshot_observed_at":"2026-08-07T14:40:57.562034Z","title":"SALSA: Attacking Lattice Cryptography with Transformers","venue":"cs.CR","work_id":"6da61af6-1252-433b-9067-7600bc1dce67","year":2022},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.500431Z"},"links":{"cited_paper":"/paper/2207.04785","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:667d17212cf63fa12e82c3beb9fad2411427a7b791153e931e74b50c1f8affd7","observation_id":"9cd3a607-a758-4574-88bb-dca4b36257c9","resolution":{"observed_at":"2026-08-07T14:40:57.618997Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:40:55.572073Z","title":"Towards understanding grokking: An effective theory of representation learning.Advances in Neural Information Processing Systems, 35:34651–34663, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.572073Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:751bfa29cbb4359e1da8055250c804a0d85de55f392e5b962aa9ac5023f403aa","observation_id":"af69a3a9-3a5f-480a-b960-e48003467287","resolution":{"observed_at":"2026-08-07T14:40:55.572073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13061","last_updated":"2024-03-04T21:59:58Z","snapshot_observed_at":"2026-07-06T16:35:52.483600Z","submitted_at":"2023-10-19T18:01:10Z","title":"To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.13061","snapshot_observed_at":"2026-08-07T14:40:55.660165Z","title":"To grok or not to grok: Disen- tangling generalization and memorization on corrupted algorithmic datasets.arXiv preprint arXiv:2310.13061, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.660165Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:41c49b9909d0090979c13dfb3a0150f5061ada617cb00ce75cfb31ca9bb05f68","observation_id":"68c6dd4c-1615-43c9-b540-98d286f74253","resolution":{"observed_at":"2026-08-07T14:40:55.660165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20199","last_updated":"2025-07-09T04:06:02Z","snapshot_observed_at":"2026-08-09T15:22:12.820309Z","submitted_at":"2024-07-29T17:28:58Z","title":"Emergence in non-neural models: grokking modular arithmetic via average gradient outer product","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20199","snapshot_observed_at":"2026-08-07T14:40:55.768975Z","title":"Emergence in non-neural models: grokking modular arithmetic via average gradient outer product, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.768975Z"},"links":{"cited_paper":"/paper/2407.20199","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:c177f9ad5e4db1292b5a778509e594e0673873b8bce4872795f2dbf3612e378d","observation_id":"cf772343-b122-42ed-944c-57473aa521d7","resolution":{"observed_at":"2026-08-07T14:40:55.768975Z","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-07T14:40:59.366462Z","title":"Towards empirical interpretation of internal circuits and properties in grokked transformers on modular polynomials,","venue":null,"work_id":"679e7f42-f648-4a5b-bebe-df710d0df5ec","year":null},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.864424Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:f7dca20b9de907e75fdc5eb2f239c0b61a03de9e952a126567792e6d65a4fcd9","observation_id":"1393798c-22c0-462c-be71-f9a6aa34aaab","resolution":{"observed_at":"2026-08-07T14:40:59.487152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18817","last_updated":"2024-04-02T05:43:18Z","snapshot_observed_at":"2026-08-09T15:53:01.595776Z","submitted_at":"2023-11-30T18:55:38Z","title":"Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.18817","snapshot_observed_at":"2026-08-07T14:40:56.021018Z","title":"Du, Jason D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.021018Z"},"links":{"cited_paper":"/paper/2311.18817","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:133587269f3169020a8699be1e232d6e41da9e9ec009baeccb8779cd0552b926","observation_id":"ec22ac2e-d3c4-4590-b745-6bb9bb1a5297","resolution":{"observed_at":"2026-08-07T14:40:56.021018Z","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-07T14:40:59.102849Z","title":"Gershman, and Cengiz Pehlevan","venue":null,"work_id":"ca118112-8bad-4d76-948e-7b1e7f8cd8fa","year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.097578Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:a30428e1342468674e689f72c927731055e50c342e8539b21d25eab947f87de6","observation_id":"3b4aea52-0d78-4cb3-aa47-0b6b6ecbfafc","resolution":{"observed_at":"2026-08-07T14:40:59.201326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03495","last_updated":"2024-06-05T17:59:35Z","snapshot_observed_at":"2026-08-08T20:54:05.936045Z","submitted_at":"2024-06-05T17:59:35Z","title":"Grokking Modular Polynomials","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-08-07T14:40:56.187966Z","title":"Grokking modular polynomials","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.187966Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:435d4ef837b296bd6a4b0dc08090dbf022c1f7deb4ac60e1c0f1c36d961637ea","observation_id":"1a5f812d-08d5-4a78-83e0-206dd977c582","resolution":{"observed_at":"2026-08-07T14:40:56.187966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02550","last_updated":"2024-11-04T16:04:27Z","snapshot_observed_at":"2026-08-10T03:40:59.982529Z","submitted_at":"2024-06-04T17:59:36Z","title":"Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02550","snapshot_observed_at":"2026-08-07T14:40:56.283173Z","title":"Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic tasks.arXiv preprint arXiv:2406.02550, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.283173Z"},"links":{"cited_paper":"/paper/2406.02550","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:f120d0648e7b697c344f62c2e970340e959e42f4cc26a601ef58379f8fada37a","observation_id":"93d996df-6eb8-4d27-8cdd-2035bcb69607","resolution":{"observed_at":"2026-08-07T14:40:56.283173Z","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-07T14:40:58.788426Z","title":"The evolution of statistical induction heads: In-context learning markov chains.Advances in Neural Information Processing Systems, 37:64273–64311, 2024","venue":null,"work_id":"284bc7cb-8673-4084-a720-41404ae98cb8","year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.364071Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:435833715f9e5eb451967e7bec42d0884346ff2e2edb840abfc0bf2d3efee80d","observation_id":"47c3e015-b686-47de-a8a8-e8f7ed09e69e","resolution":{"observed_at":"2026-08-07T14:40:58.941980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07041","last_updated":"2024-10-09T16:28:23Z","snapshot_observed_at":"2026-08-10T08:18:59.773746Z","submitted_at":"2024-10-09T16:28:23Z","title":"Emergent properties with repeated examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07041","snapshot_observed_at":"2026-08-07T14:40:56.425685Z","title":"Emergent properties with repeated examples.arXiv preprint arXiv:2410.07041, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.425685Z"},"links":{"cited_paper":"/paper/2410.07041","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:f965110c41f99bb885b44cf574e8844c1dc0257f53fb93c77a4de409ad037281","observation_id":"2e41c6ef-512c-41e0-aca8-aefd4b56ab63","resolution":{"observed_at":"2026-08-07T14:40:56.425685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01612","last_updated":"2025-02-13T05:32:54Z","snapshot_observed_at":"2026-08-09T20:44:40.485078Z","submitted_at":"2025-02-03T18:45:22Z","title":"Self-Improving Transformers Overcome Easy-to-Hard and Length Generalization Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01612","snapshot_observed_at":"2026-08-07T14:40:56.496449Z","title":"Self-improving transformers overcome easy-to-hard and length generalization challenges.arXiv preprint arXiv:2502.01612, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.496449Z"},"links":{"cited_paper":"/paper/2502.01612","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:13f241bb6168413e1aa4eb5d7a0baf7347632118b997e51ba0deec0073bc3e3d","observation_id":"8e1dc65c-15ff-4d36-9200-7a3579cdd3a0","resolution":{"observed_at":"2026-08-07T14:40:56.496449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15400","last_updated":"2023-06-27T11:53:25Z","snapshot_observed_at":"2026-07-06T15:47:15.230195Z","submitted_at":"2023-06-27T11:53:25Z","title":"Length Generalization in Arithmetic Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15400","snapshot_observed_at":"2026-08-07T14:40:56.590936Z","title":"Length generalization in arithmetic transformers.arXiv preprint arXiv:2306.15400, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.590936Z"},"links":{"cited_paper":"/paper/2306.15400","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:a42106eeafc58c9f5584f3ee4af25d1cdd9950f7e5ea49747590991b230d97a4","observation_id":"d09cb9bb-7f37-4852-a02f-15dfcdb5a0c0","resolution":{"observed_at":"2026-08-07T14:40:56.590936Z","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-07T14:40:58.539160Z","title":"Learning the greatest common divisor: explaining transformer predictions,","venue":null,"work_id":"3dfbf3d6-1b1a-4542-847b-fd17894d981b","year":null},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.683140Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:80cc94e23082a93ca9fa9ef1fd70d7eeeb2a7e98042d6400918686ff0b74b9dc","observation_id":"2cd08920-8ff8-4e2e-9c43-a193cb95eed6","resolution":{"observed_at":"2026-08-07T14:40:58.621238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:40:58.426989Z","title":"Ruiz, Julian Schrittwieser, Grzegorz Swirszcz, et al","venue":null,"work_id":"70dd1bc3-e0b3-4ee8-9b67-4c327cdfc058","year":2022},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.853982Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:f8cd0c09ea2b26374c8ef500eff3d511f1441bb2c8ce1d8e4ee62eea272b1160","observation_id":"469a7c4a-97c5-48ed-8b4f-e6884400c660","resolution":{"observed_at":"2026-08-07T14:40:58.468800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:40:56.934379Z","title":"Faster sorting algorithms discovered using deep reinforcement learning.Nature, 618(7964):257–263, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.934379Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:130d019791a575017cbb8c4d3777b103d9c57c08aa0d6c905c5d51ba932097f4","observation_id":"ede7620b-16eb-4b72-9470-173565196f76","resolution":{"observed_at":"2026-08-07T14:40:56.934379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15594","last_updated":"2024-03-14T20:47:17Z","snapshot_observed_at":"2026-08-06T11:33:06.896176Z","submitted_at":"2023-08-29T19:38:41Z","title":"Learning the greatest common divisor: explaining transformer predictions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15594","snapshot_observed_at":"2026-08-07T14:40:56.780389Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.780389Z"},"links":{"cited_paper":"/paper/2308.15594","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:23fa98bb32a945e0c126eeb52e25aec931d5d24584b55ce8cc5d9469afedf6b5","observation_id":"bc7cda93-b047-4ab4-9a59-d72a9f11b882","resolution":{"observed_at":"2026-08-07T14:40:56.780389Z","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-07T14:40:58.109878Z","title":"Can deep reinforcement learning solve erdos-selfridge-spencer games? InInternational Conference on Machine Learning, pages 4238–4246","venue":null,"work_id":"bd9ed878-0c26-44ac-bdd0-0ca51304f93e","year":2018},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:57.075441Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:7ba4e1b9a0614c762697711e2f6288b3541994ba4f8f803e902269d4229b33cc","observation_id":"8438e0db-b2a7-48de-a67e-3e2e84dd19e1","resolution":{"observed_at":"2026-08-07T14:40:58.185207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T14:40:57.145750Z","title":"algorithm","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:57.145750Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:5449e902153eb715a6e55791149025ea9835109ada9875289f04f73505b738f1","observation_id":"eeac6ae6-0ded-4138-8f32-0f1739e8e36c","resolution":{"observed_at":"2026-08-07T14:40:57.145750Z","resolver_source":null,"status":"malformed_identifier"},"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-07T14:40:58.265554Z","title":"McGill University (Canada), 2021","venue":null,"work_id":"a5dfb452-0b59-4b3f-ab74-634021d27018","year":2021},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:56.996023Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:15ba66f4498f3cc5bec403319ed6132d1e6bb37661d34fba675b88a98208d9a0","observation_id":"7682a127-9ffe-4f25-836f-89375ee2696e","resolution":{"observed_at":"2026-08-07T14:40:58.326536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:40:57.974600Z","title":"error correct","venue":null,"work_id":"5dbc14c4-6406-48b7-b371-72063b3fc85b","year":null},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:57.219755Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:3064b457a0cff19f102cf550500fc4b4ec11bc8ca071078973ff0b1f8a70fe26","observation_id":"af24f564-67b3-4031-b7e8-57e226eea6e8","resolution":{"observed_at":"2026-08-07T14:40:58.027784Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:40:54.785452Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.785452Z"},"links":{"citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:16c28b6a93b46bb591daaf71dbc03ebb388dda7878d0c94fef4268476bcd0401","observation_id":"2857b8d2-ca1e-4936-a9fb-94ebca8084f3","resolution":{"observed_at":"2026-08-07T14:40:54.785452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16726","last_updated":"2024-12-30T11:00:27Z","snapshot_observed_at":"2026-07-06T17:35:36.900600Z","submitted_at":"2024-02-26T16:48:12Z","title":"Towards Empirical Interpretation of Internal Circuits and Properties in Grokked Transformers on Modular Polynomials","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16726","snapshot_observed_at":"2026-08-07T14:40:55.955596Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:55.955596Z"},"links":{"cited_paper":"/paper/2402.16726","citing_paper":"/paper/2505.18266"},"observation_digest":"sha256:8f248e9624e2f2d62a3ff07f2b285d24493155d896b03633e41fde2498f7f91f","observation_id":"9cabe313-7d16-422a-b59d-950c20328dd4","resolution":{"observed_at":"2026-08-07T14:40:55.955596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.18266","last_updated":"2025-05-23T18:02:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T00:29:07.939367Z","submitted_at":"2025-05-23T18:02:46Z","title":"Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networks"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":44},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 2 inbound Pith citation observations for arXiv:2505.18266."}