{"as_of":"2026-08-10T22:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8852131ffa6ebf166441140f858767aa15990aba47a10e07b19cef12fd7b89c0","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:58:28.384982Z","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":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T15:27:55.566795Z","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-05-11T16:41:11.033629Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"cited_work":{"arxiv_id":"2502.01578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01578","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.01578 , year=","venue":null,"work_id":"2e916303-24f4-46e5-9339-ff05ac23ab35","year":null},"citing_paper":{"arxiv_id":"2605.05838","last_updated":"2026-05-07T08:12:09Z","snapshot_observed_at":"2026-07-06T23:18:22.301347Z","submitted_at":"2026-05-07T08:12:09Z","title":"MDN: Parallelizing Stepwise Momentum for Delta Linear Attention","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-09T15:27:55.566795Z"},"links":{"cited_paper":"/paper/2502.01578","citing_paper":"/paper/2605.05838"},"observation_digest":"sha256:e7743705dff06c0f80ca49efebcf19be2db8804858e2f82871ab20ef163de07a","observation_id":"e588fc1d-a70d-4b1a-a4d4-d26bcdc64ce0","resolution":{"observed_at":"2026-05-11T16:41:11.049805Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.01578/citation-record","integrity":"/paper/2502.01578/integrity","json":"/paper/2502.01578/citation-record.json","paper":"/paper/2502.01578"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.15719","last_updated":"2024-10-15T17:14:26Z","snapshot_observed_at":"2026-08-09T21:31:35.623308Z","submitted_at":"2023-10-24T10:51:50Z","title":"AGaLiTe: Approximate Gated Linear Transformers for Online Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.15719","snapshot_observed_at":"2026-08-09T14:58:28.372580Z","title":"In Findings of the Association for Computa- tional Linguistics: EMNLP 2023, Singapore, Decem- ber 6-10, 2023, pages 14048–14077","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.372580Z"},"links":{"cited_paper":"/paper/2310.15719","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:9bf2999abf5ecd88b524fcf43e5ca298343eea7425a01cbe33ba5d05c95cd3c7","observation_id":"55091fc3-93a7-4ee2-9984-e9de5b8d0c2b","resolution":{"observed_at":"2026-08-09T14:58:28.372580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14103","last_updated":"2021-09-21T18:04:55Z","snapshot_observed_at":"2026-08-10T18:44:10.718022Z","submitted_at":"2021-05-28T20:45:30Z","title":"An Attention Free Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14103","snapshot_observed_at":"2026-08-09T14:58:28.384982Z","title":"Songlin Yang, Bailin Wang, Yu Zhang, Yikang Shen, and Yoon Kim","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.384982Z"},"links":{"cited_paper":"/paper/2105.14103","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:bcb0bf73e2e9e0fd0f8fb9758879c7203db08412af38c5b7368e2d607b7a2c95","observation_id":"67b72f18-a996-4fd6-a9c5-4db836ee0a2a","resolution":{"observed_at":"2026-08-09T14:58:28.384982Z","resolver_source":null,"status":"malformed_identifier"},"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-09T14:58:28.594930Z","title":"Stephanie Lin, Jacob Hilton, and Owain Evans","venue":null,"work_id":"69d17b6c-997c-4de0-8e4b-0248c5982126","year":2022},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":626,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.362736Z"},"links":{"citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:e3657c344efdd1306658222d58b1694ad56434c7ac6905ba3055751e0aaeb88b","observation_id":"0e09df79-3139-4610-9e76-7eed6b46fbfa","resolution":{"observed_at":"2026-08-09T14:58:28.623021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-09T14:58:28.355406Z","title":"CoRR, abs/1503.02531","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.355406Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:d036cb7be2e7236b7c2c6bfc4fb51f3d77d5b0b0297ece51135360e20c5cb98c","observation_id":"329f43b7-fb04-4b91-b630-0dc4d7226530","resolution":{"observed_at":"2026-08-09T14:58:28.355406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-09T14:58:28.381778Z","title":"In Pro- ceedings of the 3rd ACM SIGPLAN International Workshop on Machine Learning and Programming Languages, MAPL@PLDI 2019, Phoenix, AZ, USA, June 22, 2019, pages 10–19","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.381778Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:f7a4b0caabb426fd874b22e6c7a2d175ec29dc58477278d9249e2a1633c19f06","observation_id":"5764fd25-4ea5-4e01-be73-b21e5a4f12cc","resolution":{"observed_at":"2026-08-09T14:58:28.381778Z","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-09T14:58:28.653306Z","title":"In 8th International Conference on Learning Representa- tions, ICLR 2020, Addis Ababa, Ethiopia, April 26- 30, 2020","venue":null,"work_id":"f4c526cf-7230-4c59-ba6c-07f7b6da5146","year":2020},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.359551Z"},"links":{"citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:c25eb847710bf7da7533cd67026e1303805cafeaa9802a88aa89fcf4979a4185","observation_id":"564530a2-a8de-4200-9114-808576bd5dc0","resolution":{"observed_at":"2026-08-09T14:58:28.673120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:58:28.489388Z","title":null,"venue":null,"work_id":"9c8c9eaa-8af3-4693-99c5-f7c8ce949d42","year":2021},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.376037Z"},"links":{"citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:c44744b76ce84a521302e18626d19934a4d6361d8b42dc5162d2e417778fd455","observation_id":"db6bed96-5954-459f-9948-1ee58b01c424","resolution":{"observed_at":"2026-08-09T14:58:28.493332Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-09T14:58:28.345359Z","title":"Albert Gu and Tri Dao","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.345359Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:d33592934bee2ad88ed06fbba5b6ecd9ddb86e443a854eea340eb490a35bc1cd","observation_id":"75963c56-8c83-4724-bfc4-7bb129be203f","resolution":{"observed_at":"2026-08-09T14:58:28.345359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.06640","last_updated":"2024-05-10T17:59:08Z","snapshot_observed_at":"2026-08-07T04:56:53.120063Z","submitted_at":"2024-05-10T17:59:08Z","title":"Linearizing Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.06640","snapshot_observed_at":"2026-08-09T14:58:28.369659Z","title":"arXiv preprint arXiv:2405.06640","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.369659Z"},"links":{"cited_paper":"/paper/2405.06640","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:cc0269836965bd0c96b084d0d60eb2278a2b5ffb9d4c0c7aaf5e4e1497f785fb","observation_id":"e1e10dd2-ba04-4478-a0b4-d53b3273d48b","resolution":{"observed_at":"2026-08-09T14:58:28.369659Z","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-09T14:58:28.513468Z","title":"Huanru Henry Mao","venue":null,"work_id":"334c2766-19c1-4155-9d4d-b2be6a9034ef","year":2022},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":6565,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.366902Z"},"links":{"citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:e5b42151b703b9f6fa431cf38d57fef33d026f9ac5fbd085e0f949ceb60fe16c","observation_id":"59a8ee0b-03fe-4056-ba79-f9019577f060","resolution":{"observed_at":"2026-08-09T14:58:28.564114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2403.19928","last_updated":"2024-04-01T09:17:01Z","snapshot_observed_at":"2026-08-06T07:05:21.216187Z","submitted_at":"2024-03-29T02:32:15Z","title":"DiJiang: Efficient Large Language Models through Compact Kernelization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19928","snapshot_observed_at":"2026-08-09T14:58:28.311160Z","title":"Hanting Chen, Zhicheng Liu, Xutao Wang, Yuchuan Tian, and Yunhe Wang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":7439,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.311160Z"},"links":{"cited_paper":"/paper/2403.19928","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:44b2d98654d56fe65a460bd1eabd10aaca769ca3f320e1e7e9baecc93278f4fc","observation_id":"3a76408c-11e9-4d06-9277-56760d66595e","resolution":{"observed_at":"2026-08-09T14:58:28.311160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08621","last_updated":"2023-08-09T08:53:08Z","snapshot_observed_at":"2026-08-02T13:21:32.251959Z","submitted_at":"2023-07-17T16:40:01Z","title":"Retentive Network: A Successor to Transformer for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08621","snapshot_observed_at":"2026-08-09T14:58:28.378606Z","title":"Jürgen Schmidhuber","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention","version":3},"reference_index":9366,"source":"pdf_text","source_observed_at":"2026-08-09T14:58:28.378606Z"},"links":{"cited_paper":"/paper/2307.08621","citing_paper":"/paper/2502.01578"},"observation_digest":"sha256:71fd3001d6bb051c1fb4adf807ed4b3672d820ebd857eb6ff2ddfd637dcbc5ec","observation_id":"42c5fc2d-3f8b-4b6a-9074-daef2b08a0dd","resolution":{"observed_at":"2026-08-09T14:58:28.378606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.01578","last_updated":"2025-08-08T18:42:33Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T18:44:27.977977Z","submitted_at":"2025-02-03T18:03:13Z","title":"ReGLA: Refining Gated Linear Attention"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":12},"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 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2502.01578."}