{"as_of":"2026-08-08T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3778eafc00775b016a84a66a3080c5cdeb05739fec82b0ba32b617dba1335fef","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:40:55.660165Z","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-06-30T14:24:45.256588Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-07T14:32:08.759935Z","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:ae89e2e02558e42e76481833322a98a3b1fa12f7adaaa1cb2ce3e9f4397b7c67","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":"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-06T19:10:28.467150Z","title":"Doshi, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06445","last_updated":"2026-07-21T16:59:32Z","snapshot_observed_at":"2026-08-08T03:00:34.577740Z","submitted_at":"2025-07-08T23:07:33Z","title":"Can Interpretation Predict Behavior on Unseen Data?","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:28.467150Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2507.06445"},"observation_digest":"sha256:3e00df6e8d37fe86eee49ea47585399bce53b44964a4dd8dd735d70a910af1c9","observation_id":"fe1c1514-ac34-4d72-9bd7-20727b33b708","resolution":{"observed_at":"2026-08-06T19:10:28.467150Z","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-06T17:10:12.041000Z","title":"To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11645","last_updated":"2025-07-15T18:30:42Z","snapshot_observed_at":"2026-08-08T00:31:57.508083Z","submitted_at":"2025-07-15T18:30:42Z","title":"Tracing the Path to Grokking: Embeddings, Dropout, and Network Activation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.041000Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:fb819522bae7997d3db12b08d1272e18454352551da9daa257a7ec2e2274ba24","observation_id":"f5160df7-789c-4008-9a5e-ee1fe6eb7365","resolution":{"observed_at":"2026-08-06T17:10:12.041000Z","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-04T22:57:12.078755Z","title":"Doshi, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.06931","last_updated":"2025-09-08T17:43:45Z","snapshot_observed_at":"2026-08-07T19:04:29.724597Z","submitted_at":"2025-09-08T17:43:45Z","title":"Learning words in groups: fusion algebras, tensor ranks and grokking","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T22:57:12.078755Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2509.06931"},"observation_digest":"sha256:26405bcaae70252b72209175da926c9b93011afd6f7bcc50c5cf17c312ba3b1f","observation_id":"a2cfc99a-6c63-4e7d-b442-b9c1d18587e8","resolution":{"observed_at":"2026-08-04T22:57:12.078755Z","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-04T07:21:34.060178Z","title":"To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasets, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.26792","last_updated":"2026-02-16T23:41:23Z","snapshot_observed_at":"2026-08-08T03:13:50.232248Z","submitted_at":"2025-10-30T17:59:09Z","title":"Learning Pseudorandom Numbers with Transformers: Permuted Congruential Generators, Curricula, and Interpretability","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T07:21:34.060178Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2510.26792"},"observation_digest":"sha256:7ebc7beccb3f464292c0a0720917589647bbc820f2677a57700605d5220a1467","observation_id":"fd0efad6-27ae-4ff0-b56a-cf8406fb4cc9","resolution":{"observed_at":"2026-08-04T07:21:34.060178Z","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":"2310.13061","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.13061","snapshot_observed_at":"2026-06-30T14:24:45.256588Z","title":"org/abs/2310.130618","venue":null,"work_id":"cf73869d-d127-4f53-b9eb-1ab7c0e4509b","year":2024},"citing_paper":{"arxiv_id":"2605.24420","last_updated":"2026-05-23T06:18:27Z","snapshot_observed_at":"2026-08-01T16:33:31.562249Z","submitted_at":"2026-05-23T06:18:27Z","title":"Batch Normalization Amplifies Memorization and Privacy Risks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T14:16:36.855362Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2605.24420"},"observation_digest":"sha256:21aea67c9058997943d906fa37becb160e867a729687d7c6f9144cdfb1dd3721","observation_id":"c31394d0-1233-452b-b58f-bae591077331","resolution":{"observed_at":"2026-06-30T14:24:45.258015Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2310.13061","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.13061","snapshot_observed_at":"2026-06-30T14:24:45.256588Z","title":"org/abs/2310.130618","venue":null,"work_id":"cf73869d-d127-4f53-b9eb-1ab7c0e4509b","year":2024},"citing_paper":{"arxiv_id":"2606.07563","last_updated":"2026-05-25T18:32:52Z","snapshot_observed_at":"2026-07-06T23:47:10.030985Z","submitted_at":"2026-05-25T18:32:52Z","title":"Emergence via Phase Transitions: Mechanism Landscapes and Universal Convergence Across Complex Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T22:53:30.561450Z"},"links":{"cited_paper":"/paper/2310.13061","citing_paper":"/paper/2606.07563"},"observation_digest":"sha256:d7f6609d9bb0d4724d857ccc9e4058472c666942eeb49b99b9d810761165e825","observation_id":"12f8e830-eb4a-4b63-8e21-7a618c0e7b1e","resolution":{"observed_at":"2026-06-29T22:54:00.691784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.13061/citation-record","integrity":"/paper/2310.13061/integrity","json":"/paper/2310.13061/citation-record.json","paper":"/paper/2310.13061"},"outbound":[],"paper":{"arxiv_id":"2310.13061","last_updated":"2024-03-04T21:59:58Z","latest_version":2,"primary_category":"cs.LG","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"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2310.13061."}