{"as_of":"2026-08-06T04:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ddc66258c7cdbcac5e7fab61da59c813f77517d5d5e920ef858ec33a333ecb0","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T05:19:08.086357Z","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-06-30T23:35:07.305583Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2009.14794","last_updated":"2022-11-19T12:45:21Z","snapshot_observed_at":"2026-08-02T09:26:59.716070Z","submitted_at":"2020-09-30T17:09:09Z","title":"Rethinking Attention with Performers","version":4},"reference_index":148,"source":"arxiv_source","source_observed_at":"2026-05-12T09:16:14.336570Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2009.14794"},"observation_digest":"sha256:88ad71622d5ee183bba46f59f5e9327a33b8fc39280f98c82eaef3342b7bc580","observation_id":"d434ecb6-5020-48b4-b0b4-4926c3582296","resolution":{"observed_at":"2026-05-12T09:16:14.474261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2404.07143","last_updated":"2024-08-09T22:37:25Z","snapshot_observed_at":"2026-08-02T14:27:24.212588Z","submitted_at":"2024-04-10T16:18:42Z","title":"Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T18:17:00.157129Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2404.07143"},"observation_digest":"sha256:5bf86ff9b5096f2a25f5f82de6885bc547475779c1d5228059775f898bedf8d9","observation_id":"4944ade3-446b-424d-955c-7b46e371bbc2","resolution":{"observed_at":"2026-05-21T18:17:00.285970Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2605.06683","last_updated":"2026-04-24T20:37:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-24T20:37:21Z","title":"Toeplitz MLP Mixers are Low Complexity, Information-Rich Sequence Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-11T01:07:33.756985Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2605.06683"},"observation_digest":"sha256:ef4d7450a945bb85a28bb79cf7d785c42d04e89e381b9ab6556a9e90c621e803","observation_id":"eddbe899-5eb9-4413-8bf9-9fcc1dd536e6","resolution":{"observed_at":"2026-05-11T04:45:56.352759Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T04:13:37.382807Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-12T01:28:46.885635Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:47dd0fe0bbb27ee42dfb4382ddaeac12dbb833dcf8333d044d4bf395f7c9c4d9","observation_id":"a46753e6-64af-4586-8a74-007c8099b203","resolution":{"observed_at":"2026-05-12T07:56:29.164659Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T04:13:37.382807Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-20T23:27:20.754475Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:b8b896b9b33aeec63ed3edd2d99311d0a253e006745aec0c136ee03bc9619906","observation_id":"dde04e34-5322-4b78-a1ce-0b386595be09","resolution":{"observed_at":"2026-05-20T23:29:12.978671Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T04:13:37.382807Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-30T23:31:48.469869Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:f7042ace4601268efaa84696e5d84e900db91cf5ff4ece571fa56bdd3f627523","observation_id":"15b7cd13-7a7d-41d3-a3c2-eb3260409a51","resolution":{"observed_at":"2026-06-30T23:35:07.307579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-08-04T05:19:08.086357Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T04:13:37.382807Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T05:19:08.086357Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:30bb674a4eddfc7c2ee42d4dde7f63e997d806b22982c0ebef2ece636be450f3","observation_id":"1515425f-e896-460f-9a84-5b904f46b82e","resolution":{"observed_at":"2026-08-04T05:19:08.086357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities","version":10},"cited_work":{"arxiv_id":"1812.01243","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.01243","snapshot_observed_at":"2026-06-30T23:35:07.305583Z","title":"Efficient attention: Attention with linear complexities","venue":null,"work_id":"3401135a-42d7-468a-aee6-4eb6ba94cea7","year":2018},"citing_paper":{"arxiv_id":"2605.12491","last_updated":"2026-05-12T17:59:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-12T17:59:26Z","title":"Elastic Attention Cores for Scalable Vision Transformers","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-13T06:02:40.158866Z"},"links":{"cited_paper":"/paper/1812.01243","citing_paper":"/paper/2605.12491"},"observation_digest":"sha256:87cbce9ef4d3f864d41dbc4705b6a8660fca39c126fdd41a23780c976fc48655","observation_id":"6d5e8181-bbe7-4377-a695-5f030c91e2e1","resolution":{"observed_at":"2026-05-13T06:07:22.634429Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1812.01243/citation-record","integrity":"/paper/1812.01243/integrity","json":"/paper/1812.01243/citation-record.json","paper":"/paper/1812.01243"},"outbound":[],"paper":{"arxiv_id":"1812.01243","last_updated":"2024-01-19T05:44:28Z","latest_version":10,"primary_category":"cs.CV","snapshot_observed_at":"2026-07-06T07:18:55.228651Z","submitted_at":"2018-12-04T06:41:46Z","title":"Efficient Attention: Attention with Linear Complexities"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:1812.01243."}