{"as_of":"2026-08-21T23:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:090e8fa803b44bfadf734c4a0edf7d9bc049ac1522ca96806074fd367dd4f760","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:18:38.579151Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T08:56:58.962761Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-08-16T12:18:38.579151Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13292","last_updated":"2025-04-17T19:08:40Z","snapshot_observed_at":"2026-08-19T16:42:46.725536Z","submitted_at":"2025-04-17T19:08:40Z","title":"Let Me Grok for You: Accelerating Grokking via Embedding Transfer from a Weaker Model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:18:38.579151Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2504.13292"},"observation_digest":"sha256:6996f32e065ee36aad2de893e72cb8bd69645fab697ac1efd789a195e527a097","observation_id":"f04ee7fc-58c7-4cd4-bdaa-8e1fbfc2c282","resolution":{"observed_at":"2026-08-16T12:18:38.579151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-08-06T17:10:12.037121Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11645","last_updated":"2025-07-15T18:30:42Z","snapshot_observed_at":"2026-08-16T05:21:17.764886Z","submitted_at":"2025-07-15T18:30:42Z","title":"Tracing the Path to Grokking: Embeddings, Dropout, and Network Activation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.037121Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:7bc928dc21e65337f1e1d3b2c0216dcbe7227eade282d1985ee915ab562bf727","observation_id":"639f2b71-ed70-49b3-8694-57858d1aaa97","resolution":{"observed_at":"2026-08-06T17:10:12.037121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2510.04930","last_updated":"2026-05-18T15:03:38Z","snapshot_observed_at":"2026-08-13T01:25:05.882119Z","submitted_at":"2025-10-06T15:40:36Z","title":"Egalitarian Gradient Descent: A Simple Approach to Accelerated Grokking","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T21:13:24.267454Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2510.04930"},"observation_digest":"sha256:6c08533f23b4de32c8fe62bffdfd42a481832bf9d921364fc5b047437a6e7d21","observation_id":"969da97b-1d4c-4f77-894e-143a2bbd50c6","resolution":{"observed_at":"2026-05-21T21:14:22.051391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2602.16746","last_updated":"2026-04-03T01:52:32Z","snapshot_observed_at":"2026-08-11T02:35:28.181112Z","submitted_at":"2026-02-18T03:57:56Z","title":"Low-Dimensional and Transversely Curved Optimization Dynamics in Grokking","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T21:31:58.997733Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2602.16746"},"observation_digest":"sha256:d272db16a1bcda867e5d6b6bbf3bb9a17391c699b210cb0c740642ab0b54a5ef","observation_id":"2c6ec1c0-6288-435e-ab6d-eb2f84d4ad74","resolution":{"observed_at":"2026-05-15T21:36:40.809602Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2602.18523","last_updated":"2026-04-03T01:46:22Z","snapshot_observed_at":"2026-08-11T14:11:45.442097Z","submitted_at":"2026-02-19T22:39:55Z","title":"The Geometry of Multi-Task Grokking: Transverse Instability, Superposition, and Weight Decay Phase Structure","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T20:39:40.957937Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2602.18523"},"observation_digest":"sha256:758d75e957ecfea96bee0a09d1583c5166af6bddc77c3f441f6e1886b56d0379","observation_id":"ff741f6c-eab0-4bef-b078-acf17faf60de","resolution":{"observed_at":"2026-05-15T20:40:18.303165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2604.13123","last_updated":"2026-05-12T11:46:45Z","snapshot_observed_at":"2026-08-13T05:34:05.929101Z","submitted_at":"2026-04-13T18:23:16Z","title":"Spectral Entropy Collapse as a Phase Transition in Delayed Generalisation: An Interventional and Predictive Framework for Grokkin","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T15:05:50.684294Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2604.13123"},"observation_digest":"sha256:ecdee5269882d73bd980e51de616b70706ce0dc414127ad9ed9ee02409d6033e","observation_id":"97be2fbc-0723-466a-b3d0-9a1617d0112c","resolution":{"observed_at":"2026-05-11T11:11:06.425309Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2604.13123","last_updated":"2026-05-12T11:46:45Z","snapshot_observed_at":"2026-08-13T05:34:05.929101Z","submitted_at":"2026-04-13T18:23:16Z","title":"Spectral Entropy Collapse as a Phase Transition in Delayed Generalisation: An Interventional and Predictive Framework for Grokkin","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-13T06:48:04.763818Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2604.13123"},"observation_digest":"sha256:a7a321c000e482ccbf5268d6c02185126cd392db1ec775ccddca906e20036e72","observation_id":"ea657177-0aaf-4ba1-ba85-852dac34df03","resolution":{"observed_at":"2026-05-13T06:52:25.803131Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2605.05683","last_updated":"2026-05-07T05:19:56Z","snapshot_observed_at":"2026-08-14T14:32:02.311019Z","submitted_at":"2026-05-07T05:19:56Z","title":"Spectral Lens: Activation and Gradient Spectra as Diagnostics of LLM Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-08T05:41:24.861876Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2605.05683"},"observation_digest":"sha256:7bef951694eb21897a33c44e3fa6936002e079e0d5f68af982e10110f1d907d8","observation_id":"12e3afb9-43c8-47c0-9115-8702bc06ae69","resolution":{"observed_at":"2026-05-11T21:26:13.338165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2605.09724","last_updated":"2026-05-10T19:47:39Z","snapshot_observed_at":"2026-08-17T18:27:47.160397Z","submitted_at":"2026-05-10T19:47:39Z","title":"Model Capacity Determines Grokking through Competing Memorisation and Generalisation Speeds","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-12T03:55:28.036044Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2605.09724"},"observation_digest":"sha256:86c177c89351726950f82cd6565f5261af6f34f2a86731c567a499c2bb5f423c","observation_id":"056a3853-8b9c-4f4f-98e5-4b7c2f4c7db4","resolution":{"observed_at":"2026-05-12T03:56:21.716337Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2606.12966","last_updated":"2026-06-21T19:54:33Z","snapshot_observed_at":"2026-08-17T20:09:21.899654Z","submitted_at":"2026-06-11T06:52:10Z","title":"Circuit Synchronization Precedes Generalization: A Causal Precursor to Grokking","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T07:09:22.925799Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2606.12966"},"observation_digest":"sha256:1e3510f5463fd9ba8bf9068b565f553ce7624acdad2c420681c95f3f252260db","observation_id":"5d415a73-c1d3-48e4-9008-ca13308c6cda","resolution":{"observed_at":"2026-07-03T14:08:22.535683Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2606.13125","last_updated":"2026-06-11T09:51:35Z","snapshot_observed_at":"2026-08-16T06:36:29.149178Z","submitted_at":"2026-06-11T09:51:35Z","title":"Select and Improve: Understanding the Mechanics of Post-Training for Reasoning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T07:14:47.302277Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2606.13125"},"observation_digest":"sha256:7719cc3445e466271fd7a3cbe616509396f34f11a44a5a4dda9115316b3cab09","observation_id":"6ccf6603-9419-4883-ab3e-3b127e0517d1","resolution":{"observed_at":"2026-07-03T14:08:21.748681Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2606.22873","last_updated":"2026-06-25T18:44:01Z","snapshot_observed_at":"2026-08-12T17:43:10.201466Z","submitted_at":"2026-06-22T05:37:43Z","title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-06-26T09:19:50.623741Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2606.22873"},"observation_digest":"sha256:b4454daf91c2d1b6d7670a249d7713d6818a8c58c9f325ad2aca6dac09ab6ec3","observation_id":"5493204c-c6a8-4603-8802-7bb08db541d2","resolution":{"observed_at":"2026-07-04T09:59:45.056001Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2606.22873","last_updated":"2026-06-25T18:44:01Z","snapshot_observed_at":"2026-08-12T17:43:10.201466Z","submitted_at":"2026-06-22T05:37:43Z","title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","version":3},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-06-29T01:18:19.195007Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2606.22873"},"observation_digest":"sha256:c04a104c61d2a6040fda6219da855ce235b949ed9e7c50d1cd38a4b794fdcbe8","observation_id":"105daa8b-8656-42cf-8ba8-60e76f45c963","resolution":{"observed_at":"2026-07-01T18:55:59.720326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2606.32000","last_updated":"2026-06-30T17:34:13Z","snapshot_observed_at":"2026-08-01T16:19:28.283223Z","submitted_at":"2026-06-30T17:34:13Z","title":"Radial Suppression Accelerates Algorithmic Generalization: A Geometric Analysis of Delayed Generalization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-01T06:19:17.851285Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2606.32000"},"observation_digest":"sha256:7ddefb0c230173e2b9ad2509d73def9468f94d7253449465ac2194b4d6cd1aca","observation_id":"bb0bcca0-536e-4258-b4fa-8ac898993632","resolution":{"observed_at":"2026-07-01T09:45:39.734147Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","version":1},"cited_work":{"arxiv_id":"2303.11873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11873","snapshot_observed_at":"2026-07-10T08:56:58.962761Z","title":"A tale of two circuits: Grokking as competition of sparse and dense subnetworks.arXiv preprint arXiv:2303.11873","venue":"cs.LG","work_id":"04fe7340-1319-435d-a5e6-86ab8a7b0417","year":2023},"citing_paper":{"arxiv_id":"2607.08350","last_updated":"2026-07-09T10:55:16Z","snapshot_observed_at":"2026-08-08T16:36:48.330559Z","submitted_at":"2026-07-09T10:55:16Z","title":"Grokking and epoch-wise double descent in quantum neural networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T08:55:29.359838Z"},"links":{"cited_paper":"/paper/2303.11873","citing_paper":"/paper/2607.08350"},"observation_digest":"sha256:a2ef3f199ca7796300997d510f3ed3e0389477dc4905e63c7f4f4b40e470fdd4","observation_id":"9d0465fb-7c89-4c7f-90a6-f71b700c58b6","resolution":{"observed_at":"2026-07-10T08:56:58.968694Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.11873/citation-record","integrity":"/paper/2303.11873/integrity","json":"/paper/2303.11873/citation-record.json","paper":"/paper/2303.11873"},"outbound":[],"paper":{"arxiv_id":"2303.11873","last_updated":"2023-03-21T14:17:29Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:46:32.260742Z","submitted_at":"2023-03-21T14:17:29Z","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:2303.11873."}