{"as_of":"2026-08-17T09:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18d37e9f35d07706d3cf1d9e094e10a2af0894d8d697fced3938b1bcf1b77861","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-08-14T04:15:48.624886Z","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-14T04:15:49.988513Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.06295","last_updated":"2021-10-26T19:41:12Z","snapshot_observed_at":"2026-08-16T18:17:50.526017Z","submitted_at":"2021-06-11T10:32:11Z","title":"Going Beyond Linear Transformers with Recurrent Fast Weight Programmers","version":2},"cited_work":{"arxiv_id":"2106.06295","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.06295","snapshot_observed_at":"2026-08-14T04:15:49.988513Z","title":"Going Beyond Linear Transformers with Recurrent Fast Weight Programmers","venue":"cs.LG","work_id":"0b51d9ad-1692-463e-b20a-b6d0b4b228aa","year":2021},"citing_paper":{"arxiv_id":"2608.10288","last_updated":"2026-08-10T22:45:22Z","snapshot_observed_at":"2026-08-16T18:06:38.184117Z","submitted_at":"2026-08-10T22:45:22Z","title":"Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T04:15:48.624886Z"},"links":{"cited_paper":"/paper/2106.06295","citing_paper":"/paper/2608.10288"},"observation_digest":"sha256:2cf5fbe5cb68c89f339e2b81f4ce900cbd5ac56c2aeff83f70d5da2dffcce6e5","observation_id":"0bd2e4ac-595a-46e7-a459-d77e7222739b","resolution":{"observed_at":"2026-08-14T04:15:49.993644Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.06295/citation-record","integrity":"/paper/2106.06295/integrity","json":"/paper/2106.06295/citation-record.json","paper":"/paper/2106.06295"},"outbound":[],"paper":{"arxiv_id":"2106.06295","last_updated":"2021-10-26T19:41:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:17:50.526017Z","submitted_at":"2021-06-11T10:32:11Z","title":"Going Beyond Linear Transformers with Recurrent Fast Weight Programmers"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.06295."}