{"as_of":"2026-08-10T08:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3fe0d9996d10380904a7a3910085778edb5c09fdea6a8b0949f32697ef51f2d","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T18:32:14.645620Z","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-07-03T19:08:49.918323Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-07T18:32:14.645620Z","title":"Grokking modular polynomials, 2024 b","venue":null,"work_id":null,"year":2024},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-07T18:32:14.645620Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2502.10390"},"observation_digest":"sha256:952d23fddb8f6944951691a275e071bb5f94dec0442e4f484f67a0730db0a05a","observation_id":"bfb1fbbb-74cd-44c4-82c7-91221e920893","resolution":{"observed_at":"2026-08-07T18:32:14.645620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T15:20:31.413642Z","title":"Doshi, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15624","last_updated":"2025-05-21T15:12:34Z","snapshot_observed_at":"2026-08-07T15:11:28.332416Z","submitted_at":"2025-05-21T15:12:34Z","title":"Mechanistic Insights into Grokking from the Embedding Layer","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:20:31.413642Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2505.15624"},"observation_digest":"sha256:d8ad7416cc3304a8b218aa74c12f6e0bdc9bc3a4c604b1548b141c13b3787332","observation_id":"6d143eb0-f0f2-4aec-a7f8-7cb0c7af2b31","resolution":{"observed_at":"2026-08-07T15:20:31.413642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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.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-04T22:57:12.084835Z","title":"Doshi, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06931","last_updated":"2025-09-08T17:43:45Z","snapshot_observed_at":"2026-08-09T08:30:23.163548Z","submitted_at":"2025-09-08T17:43:45Z","title":"Learning words in groups: fusion algebras, tensor ranks and grokking","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T22:57:12.084835Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2509.06931"},"observation_digest":"sha256:d76eefd2dc89455a3adada380b6418f62cfb80f4b7dc7167fb4a17bb9d067e1d","observation_id":"9204c1b0-623d-4178-9221-ff3448285cf5","resolution":{"observed_at":"2026-08-04T22:57:12.084835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2510.04930","last_updated":"2026-05-18T15:03:38Z","snapshot_observed_at":"2026-07-06T22:31:49.574184Z","submitted_at":"2025-10-06T15:40:36Z","title":"Egalitarian Gradient Descent: A Simple Approach to Accelerated Grokking","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T21:13:24.267454Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2510.04930"},"observation_digest":"sha256:384f3c10695e810982d29bc8891015b2ebdad6e9d48fb1167a07493a397a0244","observation_id":"d99fd05a-69c1-42ad-b69b-95fe8bce8ad4","resolution":{"observed_at":"2026-05-21T21:14:22.032793Z","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"}},{"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2605.07648","last_updated":"2026-05-08T12:16:07Z","snapshot_observed_at":"2026-07-06T23:20:01.856093Z","submitted_at":"2026-05-08T12:16:07Z","title":"Learning Large-Scale Modular Addition with an Auxiliary Modulus","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-11T01:54:00.748330Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2605.07648"},"observation_digest":"sha256:d4439bb5e53a5f1f323fdc6fcf30710ce74eb9ff9c584c19839cfabcb4c07951","observation_id":"1671c171-2ba0-4148-ae78-93f3e467af22","resolution":{"observed_at":"2026-05-11T04:10:59.322631Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2605.17767","last_updated":"2026-05-21T20:45:44Z","snapshot_observed_at":"2026-08-04T06:32:13.198687Z","submitted_at":"2026-05-18T02:37:50Z","title":"Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent","version":1},"reference_index":199,"source":"arxiv_source","source_observed_at":"2026-05-20T01:29:14.555216Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2605.17767"},"observation_digest":"sha256:b20f342fb075ad7abb815b84db1cb0504bf9335f04d0ef936f103d091d480691","observation_id":"d5752ad1-0796-42f3-be5e-5359d7958015","resolution":{"observed_at":"2026-05-20T01:32:56.067252Z","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"}},{"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2605.17767","last_updated":"2026-05-21T20:45:44Z","snapshot_observed_at":"2026-08-04T06:32:13.198687Z","submitted_at":"2026-05-18T02:37:50Z","title":"Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent","version":2},"reference_index":199,"source":"arxiv_source","source_observed_at":"2026-05-25T06:39:16.246591Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2605.17767"},"observation_digest":"sha256:ed7f862aed1dc819534b655b56f293db0ee26a6963a4c8247390568881f10182","observation_id":"f7562153-87d6-477d-bbd6-8b1696dac9e2","resolution":{"observed_at":"2026-05-25T06:40:24.708227Z","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"}},{"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2605.29548","last_updated":"2026-06-01T17:29:35Z","snapshot_observed_at":"2026-08-02T17:41:19.598860Z","submitted_at":"2026-05-28T08:02:11Z","title":"Why Larger Models Learn More: Effects of Capacity, Interference, and Rare-Task Retention","version":2},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-06-29T08:39:14.327838Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2605.29548"},"observation_digest":"sha256:27e428b5ebb35007e003fdef6eab599dc10b81e1bed9365c779150f7a8186a99","observation_id":"34109042-3461-4e3e-b68e-fa2db88f7cdf","resolution":{"observed_at":"2026-06-29T08:43:15.243320Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2606.05863","last_updated":"2026-06-04T08:39:04Z","snapshot_observed_at":"2026-08-07T06:24:53.080556Z","submitted_at":"2026-06-04T08:39:04Z","title":"Deciphering Two Training Clocks in Grokking via Deep Linear Network Theory with Conditional ReLU Reduction","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T02:26:16.631418Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2606.05863"},"observation_digest":"sha256:77766543e58e1c26c99d1199ddc5c4aaafbe23db490ab8b6729e8d2565ec80e7","observation_id":"1b83f5e2-9032-4023-ada4-f80c7cd0aa01","resolution":{"observed_at":"2026-07-02T12:06:56.086673Z","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"}},{"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":"2406.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03495","snapshot_observed_at":"2026-07-03T19:08:49.918323Z","title":"arXiv preprint arXiv:2406.03495 , year=","venue":null,"work_id":"9ce25711-95ad-49b6-af7e-f55df5500745","year":2024},"citing_paper":{"arxiv_id":"2606.17399","last_updated":"2026-06-16T01:16:26Z","snapshot_observed_at":"2026-08-06T15:17:23.394928Z","submitted_at":"2026-06-16T01:16:26Z","title":"The Discrete-Log Clock: How a Transformer Learns Modular Multiplication","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T02:10:10.610990Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2606.17399"},"observation_digest":"sha256:c06a8dfc5b339292b00c3e4c1df039be878ab4629fa354599c70bf1962cc3ffd","observation_id":"c8df9e15-8d35-4647-b3e5-ef2f6e7c77f5","resolution":{"observed_at":"2026-07-03T19:08:49.920050Z","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"}},{"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-07-11T08:46:29.099447Z","title":"co/Glint-Research","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.05104","last_updated":"2026-07-06T13:58:31Z","snapshot_observed_at":"2026-08-06T21:07:18.753679Z","submitted_at":"2026-07-06T13:58:31Z","title":"Grokking Is Conditional and Fragile: A Fully-Tractable, Multi-Seed Study at 12K Parameters","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T08:46:29.099447Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2607.05104"},"observation_digest":"sha256:5810396cfec36a5eee7f1e3dbfbf9a91c89875100cddde0562dcc6d7b3239eb8","observation_id":"f14ece75-50a9-4476-bf4b-c901dd234078","resolution":{"observed_at":"2026-07-11T08:46:29.099447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-02T03:55:34.633765Z","title":"Grokking modular polynomials.arXiv preprint arXiv:2406.03495, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13749","last_updated":"2026-07-15T12:04:43Z","snapshot_observed_at":"2026-08-07T15:24:58.627323Z","submitted_at":"2026-07-15T12:04:43Z","title":"Algebraic Representability as the Limiting Regime of Grokking: An Exactly Solvable Model with Holomorphic Activations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T03:55:34.633765Z"},"links":{"cited_paper":"/paper/2406.03495","citing_paper":"/paper/2607.13749"},"observation_digest":"sha256:9789c94d7f7c6eb632773183ae99f192aa63861688801e671d5a3ad7829368c1","observation_id":"97f906b3-6a31-4418-937f-376213a08d6e","resolution":{"observed_at":"2026-08-02T03:55:34.633765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.03495/citation-record","integrity":"/paper/2406.03495/integrity","json":"/paper/2406.03495/citation-record.json","paper":"/paper/2406.03495"},"outbound":[],"paper":{"arxiv_id":"2406.03495","last_updated":"2024-06-05T17:59:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T20:54:05.936045Z","submitted_at":"2024-06-05T17:59:35Z","title":"Grokking Modular Polynomials"},"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-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 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2406.03495."}