{"as_of":"2026-08-09T06:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac22895e6687357c76911dd96013fcc879ebb0ff66fca4f70c50a55282290ba1","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:33:19.949293Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"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/2607.18413/citation-record","integrity":"/paper/2607.18413/integrity","json":"/paper/2607.18413/citation-record.json","paper":"/paper/2607.18413"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.04927","last_updated":"2023-12-08T09:44:25Z","snapshot_observed_at":"2026-08-05T07:11:50.808005Z","submitted_at":"2023-12-08T09:44:25Z","title":"Zoology: Measuring and Improving Recall in Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04927","snapshot_observed_at":"2026-08-01T15:33:18.907360Z","title":"Zoology: Measuring and improving recall in efficient language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:18.907360Z"},"links":{"cited_paper":"/paper/2312.04927","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:96b1dafcc08fe44568cb6435a6a70bab6cb3ed8003174a4776699985dccde914","observation_id":"39a74367-655c-4e23-87dc-84e9a810d222","resolution":{"observed_at":"2026-08-01T15:33:18.907360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-01T15:33:19.390924Z","title":"The Llama 3 herd of models.arXiv preprint arXiv:2407.21783,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.390924Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:152a11df52ecd6ea06fb1de864da51cdec0644e67542b41fc2f8502eab1de169","observation_id":"f983f576-b1e3-4042-aa58-82fd7f6f661d","resolution":{"observed_at":"2026-08-01T15:33:19.390924Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:33:19.486169Z","title":"The winograd schema challenge.KR, 2012(13th):3,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.486169Z"},"links":{"citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:0ca5935a4b23e56792d4a5b735c03c44ca911d8987c6dbc92cc93283d231550d","observation_id":"67cb0798-adac-4dd8-9a39-9ed9a26af986","resolution":{"observed_at":"2026-08-01T15:33:19.486169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13048","last_updated":"2023-12-11T03:58:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-22T13:57:41Z","title":"RWKV: Reinventing RNNs for the Transformer Era","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13048","snapshot_observed_at":"2026-08-01T15:33:19.640015Z","title":"RWKV: Reinventing RNNs for the transformer era.arXiv preprint arXiv:2305.13048,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.640015Z"},"links":{"cited_paper":"/paper/2305.13048","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:e81fb6ced336cc49e71360d027c2bd47f74aaac220cf47178cfdc7cfa14ee3cb","observation_id":"f1ab101f-75c4-4c81-8326-4da53c74c4a6","resolution":{"observed_at":"2026-08-01T15:33:19.640015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-01T15:33:19.705248Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.705248Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:20d5e85c3ac492dc9d43d12a7556855a2733fa6af7fa375c6a08ef61aad2eb29","observation_id":"cd9c51ab-be67-4cb5-b094-4bd83ef5eee7","resolution":{"observed_at":"2026-08-01T15:33:19.705248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06464","last_updated":"2025-03-06T06:57:34Z","snapshot_observed_at":"2026-08-03T00:27:18.402796Z","submitted_at":"2024-12-09T13:09:04Z","title":"Gated Delta Networks: Improving Mamba2 with Delta Rule","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06464","snapshot_observed_at":"2026-08-01T15:33:19.794814Z","title":"Gated delta networks: Improving Mamba2 with delta rule.arXiv preprint arXiv:2412.06464,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.794814Z"},"links":{"cited_paper":"/paper/2412.06464","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:bcb05b5b90291c287accada8c33b348d2e5d46e2fe3840d54e9775172edc3787","observation_id":"da467185-96c5-40a4-9521-a18242b87533","resolution":{"observed_at":"2026-08-01T15:33:19.794814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-01T15:33:19.888295Z","title":"HellaSwag: Can a machine really finish your sentence?arXiv preprint arXiv:1905.07830,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.888295Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:40ddb660e190a4fa711a2bc38c7f708bafbe59b247beb6991b06b06ed397f4b5","observation_id":"bb65f505-5215-42b4-8b8e-d8ea1010be71","resolution":{"observed_at":"2026-08-01T15:33:19.888295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04134","last_updated":"2024-05-27T14:37:59Z","snapshot_observed_at":"2026-08-05T02:00:05.002873Z","submitted_at":"2023-10-06T10:16:26Z","title":"TiC: Exploring Vision Transformer in Convolution","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04134","snapshot_observed_at":"2026-08-01T15:33:19.949293Z","title":"TiC: Exploring vision transformer in convolution.arXiv preprint arXiv:2310.04134,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.949293Z"},"links":{"cited_paper":"/paper/2310.04134","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:2be29f90c6055cdb8371967896b6922813136e38fa29833918b6535716f6d88d","observation_id":"be7065fc-eed5-4814-8170-6aec13b92f84","resolution":{"observed_at":"2026-08-01T15:33:19.949293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-01T15:33:19.249897Z","title":"Think you have solved question answering? try ARC, the AI2 reasoning challenge","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.249897Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:3eb29959bd55840ffe01f72d2d3235c3f80c04efd239a704c0cd491b41d506fe","observation_id":"b247d4f6-d7f4-41e1-913c-8d7d6386e557","resolution":{"observed_at":"2026-08-01T15:33:19.249897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-06T19:10:40.703812Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-01T15:33:19.088107Z","title":"Conditional memory via scalable lookup: A new axis of sparsity for large language models.arXiv preprint arXiv:2601.07372,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.088107Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:641aa37e9ee3c0b7297bf467d7af4d00a24c5fe6486de6485a41d6d846208e8c","observation_id":"5176f9e4-3092-4c31-8827-9b2a1d3d1562","resolution":{"observed_at":"2026-08-01T15:33:19.088107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00927","last_updated":"2025-07-11T15:49:30Z","snapshot_observed_at":"2026-08-07T16:17:02.389734Z","submitted_at":"2025-04-01T15:59:32Z","title":"Multi-Token Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00927","snapshot_observed_at":"2026-08-01T15:33:19.333214Z","title":"Multi-token attention","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.333214Z"},"links":{"cited_paper":"/paper/2504.00927","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:03fd28c9a017e8705373153698b77ee24bab5a826ceb7e066dc39ffbc227412a","observation_id":"a1624770-c7bb-4c84-a2cc-12401e5d5c4e","resolution":{"observed_at":"2026-08-01T15:33:19.333214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18668","last_updated":"2025-03-07T18:57:52Z","snapshot_observed_at":"2026-07-06T17:37:05.339368Z","submitted_at":"2024-02-28T19:28:27Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18668","snapshot_observed_at":"2026-08-01T15:33:18.981516Z","title":"Simple linear attention language models balance the recall–throughput tradeoff.arXiv preprint arXiv:2402.18668,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:18.981516Z"},"links":{"cited_paper":"/paper/2402.18668","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:a94cc33444789d2fb3220ae8f9317c9cec91475fa206398ed443bd6e7dc69e26","observation_id":"c913f9ca-8308-41a0-9670-e12a589d0328","resolution":{"observed_at":"2026-08-01T15:33:18.981516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08100","last_updated":"2020-05-16T20:56:25Z","snapshot_observed_at":"2026-08-08T15:18:32.322111Z","submitted_at":"2020-05-16T20:56:25Z","title":"Conformer: Convolution-augmented Transformer for Speech Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08100","snapshot_observed_at":"2026-08-01T15:33:19.438141Z","title":"Conformer: Convolution-augmented transformer for speech recognition.arXiv preprint arXiv:2005.08100,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.438141Z"},"links":{"cited_paper":"/paper/2005.08100","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:c2671e3ac19889579f24ab1f63ca69ac70af7e87eb58741369208bd911380a2d","observation_id":"071d7a69-a49a-40d3-9f47-ac91e71a841d","resolution":{"observed_at":"2026-08-01T15:33:19.438141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.04715","last_updated":"2025-08-19T09:45:25Z","snapshot_observed_at":"2026-08-07T17:23:48.548894Z","submitted_at":"2025-03-06T18:58:29Z","title":"Predictable Scale: Part I, Step Law -- Optimal Hyperparameter Scaling Law in Large Language Model Pretraining","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.04715","snapshot_observed_at":"2026-08-01T15:33:19.545195Z","title":"Aixin Liu, Bei Feng, Bing Xue, Bingxuan Wang, Bochao Wu, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenyu Zhang, Chong Ruan, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.545195Z"},"links":{"cited_paper":"/paper/2503.04715","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:fae12a5314fe3dfb163c37d06997270fae46e1e4657d0ddc821bd6e0e9e8531a","observation_id":"f9a9a766-4339-4587-a696-5daaaf3a386d","resolution":{"observed_at":"2026-08-01T15:33:19.545195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-01T15:33:19.153639Z","title":"BoolQ: Exploring the surprising difficulty of natural yes/no questions.arXiv preprint arXiv:1905.10044,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.153639Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:5fe599aae91961c68fae6d51b73349133779104000fd810fe9866bbcfb7901d6","observation_id":"b4116b81-853b-415a-9f5e-6ef9684913cf","resolution":{"observed_at":"2026-08-01T15:33:19.153639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T14:18:57.059537Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":15},"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 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.18413."}