{"as_of":"2026-08-08T13:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6f244cbefd4acc31312de115a74c3b79dce19fa81a27ce80b0201f5b3e4e84d","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:10:12.049200Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.11645/citation-record","integrity":"/paper/2507.11645/integrity","json":"/paper/2507.11645/citation-record.json","paper":"/paper/2507.11645"},"outbound":[{"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-06T17:10:11.983022Z","title":"Grokking: Generalization beyond overfitting on small algorithmic datasets","venue":null,"work_id":null,"year":2022},"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":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:11.983022Z"},"links":{"cited_paper":"/paper/2201.02177","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:e7a08035b557bf20d9d38be181e20bdfa64bfc1a186f469dec455a034cfff998","observation_id":"c1b0c093-a3fd-4da3-8bd6-f5b7980d12dd","resolution":{"observed_at":"2026-08-06T17:10:11.983022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01117","last_updated":"2023-03-23T13:42:27Z","snapshot_observed_at":"2026-08-04T09:38:24.844846Z","submitted_at":"2022-10-03T17:58:04Z","title":"Omnigrok: Grokking Beyond Algorithmic Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01117","snapshot_observed_at":"2026-08-06T17:10:11.987412Z","title":"Omnigrok: Grokking beyond algorithmic data","venue":null,"work_id":null,"year":2022},"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":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:11.987412Z"},"links":{"cited_paper":"/paper/2210.01117","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:6fe7950f39c6a0664ce3b6a697cb1f15c15b59c56cb43bd69835d39a3ca65a55","observation_id":"321bca95-2504-49fe-8057-58dbfc96130c","resolution":{"observed_at":"2026-08-06T17:10:11.987412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05353","last_updated":"2024-11-08T06:19:29Z","snapshot_observed_at":"2026-07-06T19:47:16.854192Z","submitted_at":"2024-11-08T06:19:29Z","title":"Controlling Grokking with Nonlinearity and Data Symmetry","version":1},"cited_work":{"arxiv_id":"2411.05353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.05353","snapshot_observed_at":"2026-08-06T17:10:12.173776Z","title":"Controlling Grokking with Nonlinearity and Data Symmetry","venue":"cs.LG","work_id":"2f22764f-7ec1-4ef1-bb62-1cd0012add77","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":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:11.996018Z"},"links":{"cited_paper":"/paper/2411.05353","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:e1a29fc55279a6e64a90b9d0a53de2d28fa3092c32f382788388cfdf62bd8b4f","observation_id":"9833673b-e870-4fb0-a300-ce4dd4d1257b","resolution":{"observed_at":"2026-08-06T17:10:12.177954Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2205.10343","last_updated":"2022-10-14T17:39:04Z","snapshot_observed_at":"2026-08-08T11:19:57.404379Z","submitted_at":"2022-05-20T17:56:17Z","title":"Towards Understanding Grokking: An Effective Theory of Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.10343","snapshot_observed_at":"2026-08-06T17:10:11.999826Z","title":"Towards understanding grokking: An effective theory of representation learning","venue":null,"work_id":null,"year":2022},"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":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:11.999826Z"},"links":{"cited_paper":"/paper/2205.10343","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:50aa408242833cc4163f24ec8237a209191a07f390a6720ff2d8c99833ab7321","observation_id":"4640b4bf-014c-46ee-9539-8bb677542cd6","resolution":{"observed_at":"2026-08-06T17:10:11.999826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-06T17:10:12.004091Z","title":"Sentence-bert: Sentence embeddings using siamese bert - networks","venue":null,"work_id":null,"year":1908},"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":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.004091Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:dc5bd63de95f6027e58a84063494813d2ab3f022fd54608f7c392135e12eda12","observation_id":"ebe579d2-aed2-4c0e-9407-812e84bd3d39","resolution":{"observed_at":"2026-08-06T17:10:12.004091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12717","last_updated":"2025-09-18T04:41:36Z","snapshot_observed_at":"2026-07-06T20:38:29.607020Z","submitted_at":"2025-02-18T10:28:25Z","title":"Learning the symmetric group: large from small","version":2},"cited_work":{"arxiv_id":"2502.12717","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.12717","snapshot_observed_at":"2026-08-06T17:10:12.136401Z","title":"Learning the symmetric group: large from small","venue":"cs.LG","work_id":"c3fcc151-5b91-4544-a779-6fa556d097ff","year":2025},"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":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.009553Z"},"links":{"cited_paper":"/paper/2502.12717","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:98a4e1efe8e4c11a3c356d3184e9d246393b48334108c943ea37c3571df318ba","observation_id":"bf93456b-62ec-4741-8947-329e7efc6015","resolution":{"observed_at":"2026-08-06T17:10:12.142461Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19454","last_updated":"2024-05-29T19:05:11Z","snapshot_observed_at":"2026-07-06T18:22:14.521977Z","submitted_at":"2024-05-29T19:05:11Z","title":"Deep Grokking: Would Deep Neural Networks Generalize Better?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19454","snapshot_observed_at":"2026-08-06T17:10:12.014069Z","title":"Deep Grokking: Would Deep Neural Networks Generalize Better?","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":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.014069Z"},"links":{"cited_paper":"/paper/2405.19454","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:4e5e85c6a079888dd7a11f1583c095ada383877a29175b7526813d40ac2bf573","observation_id":"f9faaf10-b663-4e5e-8343-e0cdadab1ac0","resolution":{"observed_at":"2026-08-06T17:10:12.014069Z","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-06T17:10:12.237503Z","title":"Hidden progress in deep learning: Sgd learns parities near the computational limit","venue":null,"work_id":"6470fc85-501c-4334-9f25-bda9cba71076","year":2022},"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":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.018291Z"},"links":{"citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:bdff0516c655b2e74eb769f8e5b7bfc4a7691d5e482ee8c5d326ea11479a396b","observation_id":"01c2c97e-85bf-44d8-8523-e217c39227f5","resolution":{"observed_at":"2026-08-06T17:10:12.241148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2301.05217","last_updated":"2023-10-19T21:25:32Z","snapshot_observed_at":"2026-08-02T10:20:00.635719Z","submitted_at":"2023-01-12T18:56:49Z","title":"Progress measures for grokking via mechanistic interpretability","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.05217","snapshot_observed_at":"2026-08-06T17:10:12.021781Z","title":"Progress measures for grokking via mechanistic interpretability","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-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":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.021781Z"},"links":{"cited_paper":"/paper/2301.05217","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:a8a2c16cedc01ed1346d86bf4f47ca5616d6063d6d70f9876c7aff0e9145c247","observation_id":"395d889a-a00e-4510-94d5-26b4df7a6887","resolution":{"observed_at":"2026-08-06T17:10:12.021781Z","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-06T17:10:12.025593Z","title":"Grokking modular arithmetic","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-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":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.025593Z"},"links":{"cited_paper":"/paper/2301.02679","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:c7c3d7f40aa353bfedc93fb794af2e095859519e368334d3cdc6d2911fe18c38","observation_id":"5cd45044-4c53-4b66-bda9-e970f91f6fd2","resolution":{"observed_at":"2026-08-06T17:10:12.025593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.02390","last_updated":"2023-09-05T17:00:24Z","snapshot_observed_at":"2026-08-02T05:47:38.281400Z","submitted_at":"2023-09-05T17:00:24Z","title":"Explaining grokking through circuit efficiency","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.02390","snapshot_observed_at":"2026-08-06T17:10:12.030195Z","title":"Explaining grokking through circuit efficiency","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-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":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.030195Z"},"links":{"cited_paper":"/paper/2309.02390","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:dfe869e449bcddb8a32d50ccbaf23d8d03ac7fca0cb5860e3b2e98ae11df233e","observation_id":"98562052-9fce-4287-8bdd-85b62afc78b0","resolution":{"observed_at":"2026-08-06T17:10:12.030195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12755","last_updated":"2024-06-20T07:39:05Z","snapshot_observed_at":"2026-07-06T18:17:16.999617Z","submitted_at":"2024-05-21T13:06:41Z","title":"Progress Measures for Grokking on Real-world Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12755","snapshot_observed_at":"2026-08-06T17:10:12.033626Z","title":"Progress Measures for Grokking on Real -world Tasks","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":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.033626Z"},"links":{"cited_paper":"/paper/2405.12755","citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:d9c19f7d75ddd6b4096e5e9ea5b651d3d2929ac9bfa8a6a3ed2027084d34d710","observation_id":"0de9c568-2877-4528-847a-0708c3dc5375","resolution":{"observed_at":"2026-08-06T17:10:12.033626Z","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-08T11:38:25.815430Z","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-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":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:81b8a5e3745a0b1ab25617efa38868da4746e47311678f00641cc30cd70a9c22","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":"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:12.225560Z","title":"Dropout as a Bayesian approximation: Representing model uncertainty in deep learning","venue":null,"work_id":"72bdf11a-5b1b-4536-89ce-2c4dad88e9f8","year":2016},"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":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.045500Z"},"links":{"citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:878fe4d32e6e965cc36aa10abc8f12efb7a4bd2f220c2e7eaf7d4a2a188806bb","observation_id":"66f24b82-4f00-4f4f-bd03-24842f9c923a","resolution":{"observed_at":"2026-08-06T17:10:12.229876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:12.214156Z","title":"Tikeng Notsawo, Hattie Zhou, Mohammad Pezeshki, Irina Rish, and Guillaume Dumas","venue":null,"work_id":"5feeb5f9-2ab5-4a4a-ab3a-681e70034cb4","year":2023},"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":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:12.049200Z"},"links":{"citing_paper":"/paper/2507.11645"},"observation_digest":"sha256:509ec15c9dd4a5442a806c8772e7523347bf3ededd1c98da6506b761f3dcf6f4","observation_id":"4b0da438-eed5-40f6-a7dc-689d99ec2ae5","resolution":{"observed_at":"2026-08-06T17:10:12.217988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2507.11645","last_updated":"2025-07-15T18:30:42Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":3},"total_outbound_references":16},"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 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2507.11645."}