{"as_of":"2026-08-04T13:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c52a04cc43dd82ecb449deff5d9580f1c86a0f37b8666c1d25c6ed93633721fa","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T14:50:03.831572Z","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-20T19:45:36.414760Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":"2003.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient content-based sparse attention with routing Transformers","venue":null,"work_id":"2c11dcbf-bf3e-4aaa-ac7d-37bae1c69af0","year":2003},"citing_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"reference_index":115,"source":"arxiv_source","source_observed_at":"2026-05-10T13:29:58.719341Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2004.05150"},"observation_digest":"sha256:872c78c8b9d33904797aa68ddae845915336ad5a02703a62d5cb70efcf717c72","observation_id":"e6bf9c7a-ee46-400a-93e2-c9a1bce4889b","resolution":{"observed_at":"2026-05-10T13:29:58.812383Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":"2003.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient content-based sparse attention with routing Transformers","venue":null,"work_id":"2c11dcbf-bf3e-4aaa-ac7d-37bae1c69af0","year":2003},"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":147,"source":"arxiv_source","source_observed_at":"2026-05-12T09:16:14.336570Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2009.14794"},"observation_digest":"sha256:e2a98087721b1babbeac37b70db7cc3b0fc45a9df77bde09d8081d026ba95525","observation_id":"59d670d3-6313-40bb-a7d6-85ce5eef24f2","resolution":{"observed_at":"2026-05-12T09:16:14.467988Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":"2003.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient content-based sparse attention with routing Transformers","venue":null,"work_id":"2c11dcbf-bf3e-4aaa-ac7d-37bae1c69af0","year":2003},"citing_paper":{"arxiv_id":"2010.04159","last_updated":"2021-03-18T03:14:26Z","snapshot_observed_at":"2026-07-06T10:02:45.105181Z","submitted_at":"2020-10-08T17:59:21Z","title":"Deformable DETR: Deformable Transformers for End-to-End Object Detection","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-11T09:47:16.915936Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2010.04159"},"observation_digest":"sha256:ed8908be78fb8bba7c7ce4ee840289eca58f1f80a93940edf014bbc56a146377","observation_id":"b1bf7893-dbbe-421f-8b55-f8978425fd85","resolution":{"observed_at":"2026-05-11T09:47:17.010120Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":"2003.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient content-based sparse attention with routing Transformers","venue":null,"work_id":"2c11dcbf-bf3e-4aaa-ac7d-37bae1c69af0","year":2003},"citing_paper":{"arxiv_id":"2204.02311","last_updated":"2022-10-05T06:02:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-05T16:11:45Z","title":"PaLM: Scaling Language Modeling with Pathways","version":5},"reference_index":129,"source":"arxiv_source","source_observed_at":"2026-05-10T23:45:06.755839Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2204.02311"},"observation_digest":"sha256:b6999e8e7a773efe0d57b45a7f6830bed82391f0a5598e4a11d44a0eba816cd1","observation_id":"8747ea07-4842-4805-967b-f8a34b4a94f4","resolution":{"observed_at":"2026-05-10T23:45:07.356120Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":"2003.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient content-based sparse attention with routing Transformers","venue":null,"work_id":"2c11dcbf-bf3e-4aaa-ac7d-37bae1c69af0","year":2003},"citing_paper":{"arxiv_id":"2401.10774","last_updated":"2024-06-14T23:32:32Z","snapshot_observed_at":"2026-07-06T17:17:56.276857Z","submitted_at":"2024-01-19T15:48:40Z","title":"Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads","version":3},"reference_index":241,"source":"arxiv_source","source_observed_at":"2026-05-13T10:36:17.764761Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2401.10774"},"observation_digest":"sha256:2eecd92b37d6b782a7611c0486e182d097ce0ad43bf3f9fb3f94fe55e230423b","observation_id":"16a64e48-e4bb-40c1-aaf5-bb23935fdda5","resolution":{"observed_at":"2026-05-13T10:36:18.322637Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":"2003.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient content-based sparse attention with routing Transformers","venue":null,"work_id":"2c11dcbf-bf3e-4aaa-ac7d-37bae1c69af0","year":2003},"citing_paper":{"arxiv_id":"2407.08608","last_updated":"2024-07-12T22:15:02Z","snapshot_observed_at":"2026-07-06T18:44:53.587276Z","submitted_at":"2024-07-11T15:44:48Z","title":"FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-20T19:45:36.337956Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2407.08608"},"observation_digest":"sha256:62893ce15bff4f5ab1b997f3740cd7a3215a169abe63b665750bef3b598e827a","observation_id":"27b91132-d50d-4583-87fa-e5e625d4ff0f","resolution":{"observed_at":"2026-05-20T19:45:36.416769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.05997","snapshot_observed_at":"2026-07-14T14:50:03.831572Z","title":"[Teh et al.(2006)] Y","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.09889","last_updated":"2026-07-10T18:28:21Z","snapshot_observed_at":"2026-08-02T12:00:29.141267Z","submitted_at":"2026-07-10T18:28:21Z","title":"Remembering Distinct Items, Not Tokens: A Learnable Dirichlet-Process Cache Between State-Space Models and Attention","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T14:50:03.831572Z"},"links":{"cited_paper":"/paper/2003.05997","citing_paper":"/paper/2607.09889"},"observation_digest":"sha256:8921327926b464babea4696acd1ded555c6b0900d956d62c1090ce3ecbd826be","observation_id":"6b6f5401-5fb3-4b33-9ff4-d87bb92c3783","resolution":{"observed_at":"2026-07-14T14:50:03.831572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2003.05997/citation-record","integrity":"/paper/2003.05997/integrity","json":"/paper/2003.05997/citation-record.json","paper":"/paper/2003.05997"},"outbound":[],"paper":{"arxiv_id":"2003.05997","last_updated":"2020-10-24T19:41:17Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T10:51:49.042823Z","submitted_at":"2020-03-12T19:50:14Z","title":"Efficient Content-Based Sparse Attention with Routing Transformers"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2003.05997."}