{"as_of":"2026-08-22T20:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:870f5cce4ac18400d87ceeb91096b55c3d97faca5435782411357ebc35d68a9d","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:33:21.767555Z","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-08-15T22:31:44.637242Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.03001","last_updated":"2024-10-03T21:21:02Z","snapshot_observed_at":"2026-08-16T13:12:46.887083Z","submitted_at":"2024-10-03T21:21:02Z","title":"Can Transformers Learn $n$-gram Language Models?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03001","snapshot_observed_at":"2026-08-15T22:33:21.767555Z","title":"Can transformers learn n -gram language models? arXiv preprint arXiv:2410.03001, 2024","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":39,"source":"arxiv_source","source_observed_at":"2026-08-15T22:33:21.767555Z"},"links":{"cited_paper":"/paper/2410.03001","citing_paper":"/paper/2505.07067"},"observation_digest":"sha256:d1b4413d74cb11fe3706ffd00381cb48b5239cadd7524a1acad63204add235cd","observation_id":"0f6e61bc-18ba-4be2-a204-186c8b956881","resolution":{"observed_at":"2026-08-15T22:33:21.767555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03001","last_updated":"2024-10-03T21:21:02Z","snapshot_observed_at":"2026-08-16T13:12:46.887083Z","submitted_at":"2024-10-03T21:21:02Z","title":"Can Transformers Learn $n$-gram Language Models?","version":1},"cited_work":{"arxiv_id":"2410.03001","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.03001","snapshot_observed_at":"2026-08-15T22:31:44.637242Z","title":"Can Transformers Learn $n$-gram Language Models?","venue":"cs.CL","work_id":"e8146dad-9afd-47a7-9045-3d010b580e6d","year":2024},"citing_paper":{"arxiv_id":"2505.07070","last_updated":"2025-05-11T17:44:14Z","snapshot_observed_at":"2026-08-20T17:18:41.367276Z","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":45,"source":"pdf_text","source_observed_at":"2026-08-15T22:31:44.349671Z"},"links":{"cited_paper":"/paper/2410.03001","citing_paper":"/paper/2505.07070"},"observation_digest":"sha256:1fb2d5893be933b665b43f669f8501bccabbff659c8ce48b1c00559cbb395d64","observation_id":"c118f06a-f8eb-4d26-a943-ad07fefd38c5","resolution":{"observed_at":"2026-08-15T22:31:44.645358Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.03001/citation-record","integrity":"/paper/2410.03001/integrity","json":"/paper/2410.03001/citation-record.json","paper":"/paper/2410.03001"},"outbound":[],"paper":{"arxiv_id":"2410.03001","last_updated":"2024-10-03T21:21:02Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:12:46.887083Z","submitted_at":"2024-10-03T21:21:02Z","title":"Can Transformers Learn $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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.03001."}