{"as_of":"2026-08-19T06:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:015edf897988d584db42992d961bf9440ae171c6d2aa32e8613eb6eb25a80381","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:21:55.097279Z","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-07T05:21:37.385319Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-12T05:21:55.097279Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-15T12:41:06.726492Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.097279Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:36d51113ea81d119db0ff291bf05c69e235f10289d79d9f104da415dbdf45bbf","observation_id":"e71d45e2-3559-4f95-80c1-a03a31bd19a2","resolution":{"observed_at":"2026-08-12T05:21:55.097279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-08T14:13:38.144287Z","title":"Linear attention mechanism: An efficient attention for semantic segmentation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.06975","last_updated":"2025-02-10T19:14:51Z","snapshot_observed_at":"2026-08-14T08:32:12.525435Z","submitted_at":"2025-02-10T19:14:51Z","title":"Position: Episodic Memory is the Missing Piece for Long-Term LLM Agents","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T14:13:38.144287Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2502.06975"},"observation_digest":"sha256:e3174458072d18bfef35430d82672109803efa49c290f549d94774a16e91676c","observation_id":"4b458f3b-2af0-44ce-920a-2ce3912810d2","resolution":{"observed_at":"2026-08-08T14:13:38.144287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-08T11:23:58.542022Z","title":"Linear attention mechanism: An efficient attention for semantic segmentation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.07962","last_updated":"2025-07-12T19:17:03Z","snapshot_observed_at":"2026-08-16T18:23:17.062928Z","submitted_at":"2025-02-11T21:20:48Z","title":"ESPFormer: Doubly-Stochastic Attention with Expected Sliced Transport Plans","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T11:23:58.542022Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2502.07962"},"observation_digest":"sha256:dc306868d4b90be60123d78247e89468f326f14852574589fad8fe69d65fe6bc","observation_id":"0a7b52bd-8181-448a-9063-78aadb4f44e3","resolution":{"observed_at":"2026-08-08T11:23:58.542022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-07T13:09:53.313519Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.22574","last_updated":"2025-07-23T18:59:36Z","snapshot_observed_at":"2026-08-15T08:49:52.665426Z","submitted_at":"2025-05-28T16:47:02Z","title":"Attention-based Neural Network Emulators for Multi-Probe Data Vectors Part III: Modeling The Next Generation Surveys","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:09:53.313519Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2505.22574"},"observation_digest":"sha256:cddf38e1a2df38f33affa34ad3bf600c0c06014e5c6d07b0c861784a94288f36","observation_id":"23c6d754-f237-4a71-9389-67ef0a8d69e1","resolution":{"observed_at":"2026-08-07T13:09:53.313519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":"2007.14902","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-07T05:21:37.385319Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","venue":"cs.CV","work_id":"56dc6316-add6-4ef1-960c-a076d95bacd7","year":2020},"citing_paper":{"arxiv_id":"2506.08297","last_updated":"2026-07-16T07:47:36Z","snapshot_observed_at":"2026-08-18T19:25:29.709889Z","submitted_at":"2025-06-10T00:03:19Z","title":"SEMA: a Scalable and Efficient Mamba like Attention via Token Localization and Averaging","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:21:37.238100Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2506.08297"},"observation_digest":"sha256:037d7cb24abeb053b47ea02c7449b630fa561308789d564f102eed81d3e5b400","observation_id":"0ac28da9-62f4-44db-b904-ca9b569171bb","resolution":{"observed_at":"2026-08-07T05:21:37.389145Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-11T17:02:06.846478Z","title":"Linear attention mechanism: an efficient attention for semantic segmentation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.09468","last_updated":"2026-08-10T11:38:30Z","snapshot_observed_at":"2026-08-18T19:26:07.425831Z","submitted_at":"2026-08-10T11:38:30Z","title":"MixFormer: Linear Transformer with Mixture of Memory Experts","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T17:02:06.846478Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2608.09468"},"observation_digest":"sha256:156609096347638ecada0d726e76e63eb2c9e2832447b8b4012e108c55cde1bb","observation_id":"e04374ce-f3de-4284-ac12-4545da574cf5","resolution":{"observed_at":"2026-08-11T17:02:06.846478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.14902/citation-record","integrity":"/paper/2007.14902/integrity","json":"/paper/2007.14902/citation-record.json","paper":"/paper/2007.14902"},"outbound":[],"paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","latest_version":3,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-18T19:24:54.162160Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2007.14902."}