{"as_of":"2026-08-18T12:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10c7cba39872cd6f4f5e59109354c30e7753cd89381715cd45a2c24e4abc04d2","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:33:21.763465Z","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-04T20:20:06.852432Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-08-10T22:10:33.950664Z","title":"and Cotterell, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02825","last_updated":"2025-09-10T14:39:59Z","snapshot_observed_at":"2026-08-14T20:41:06.369951Z","submitted_at":"2025-01-06T07:57:51Z","title":"Randomly Sampled Language Reasoning Problems Elucidate Limitations of In-Context Learning","version":6},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:10:33.950664Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2501.02825"},"observation_digest":"sha256:625e4f103850eb6c799a194ec2dc48482459b1dacfd7ea1d2abaa90f4d7478dd","observation_id":"06894e49-10b6-43be-86ba-55e10b525c71","resolution":{"observed_at":"2026-08-10T22:10:33.950664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-08-15T22:33:21.763465Z","title":"and Cotterell, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07067","last_updated":"2025-05-11T17:38:40Z","snapshot_observed_at":"2026-08-18T09:47:29.994030Z","submitted_at":"2025-05-11T17:38:40Z","title":"Learning curves theory for hierarchically compositional data with power-law distributed features","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T22:33:21.763465Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2505.07067"},"observation_digest":"sha256:5c4dca2b1c7ed4feac039ca9f0cb3cdfaf7720123dbada2cb29bc38cde9714f3","observation_id":"157d7e55-b743-467d-9492-61bdb33c4707","resolution":{"observed_at":"2026-08-15T22:33:21.763465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-08-15T22:31:44.339444Z","title":"Svete and R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07070","last_updated":"2025-05-11T17:44:14Z","snapshot_observed_at":"2026-08-18T09:47:51.769290Z","submitted_at":"2025-05-11T17:44:14Z","title":"Scaling Laws and Representation Learning in Simple Hierarchical Languages: Transformers vs. Convolutional Architectures","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T22:31:44.339444Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2505.07070"},"observation_digest":"sha256:c69b262f6946d27c54703f222f0c8cfc6e31e89c9fa2b02a2a70b6617b71a3ca","observation_id":"35763e32-4523-47cb-b442-5b0f433e6f36","resolution":{"observed_at":"2026-08-15T22:31:44.339444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-08-15T17:26:36.907740Z","title":"and Cotterell, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.12837","last_updated":"2025-08-19T09:36:39Z","snapshot_observed_at":"2026-08-16T12:46:53.048088Z","submitted_at":"2025-08-18T11:24:30Z","title":"Learning In-context n-grams with Transformers: Sub-n-grams Are Near-stationary Points","version":2},"reference_index":1948,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:36.907740Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2508.12837"},"observation_digest":"sha256:b5c11d9d17249180109cda20aafe87930a791410d301ac3016c68f5cf5b90b4e","observation_id":"e83276c0-6e19-4f46-ae9a-f62c4c8e15db","resolution":{"observed_at":"2026-08-15T17:26:36.907740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-08-04T21:11:44.825896Z","title":"Svete and R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08184","last_updated":"2025-09-09T23:13:41Z","snapshot_observed_at":"2026-08-13T05:24:16.291523Z","submitted_at":"2025-09-09T23:13:41Z","title":"Selective Induction Heads: How Transformers Select Causal Structures In Context","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T21:11:44.825896Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2509.08184"},"observation_digest":"sha256:7dd310037d988e6bef8397c02e42649cb22741bdad7deb7afbfecffcc7c0ef88","observation_id":"042f6ecb-4c86-4589-8749-c7e67c912841","resolution":{"observed_at":"2026-08-04T21:11:44.825896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":"2404.14994","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-07-04T20:20:06.852432Z","title":"arXiv preprint arXiv:2404.14994 , year=","venue":null,"work_id":"b49aadfd-0d49-4b12-9d18-b45a7dabd683","year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:42522371bee0912ed349e0b7012b7c95256e3ac380baba302afd9d47cd21220e","observation_id":"f74f8b14-9228-48cf-a054-d9853d069f97","resolution":{"observed_at":"2026-07-04T20:20:06.854207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.14994/citation-record","integrity":"/paper/2404.14994/integrity","json":"/paper/2404.14994/citation-record.json","paper":"/paper/2404.14994"},"outbound":[],"paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2404.14994."}