{"as_of":"2026-08-10T13:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:347580e435e7b60e48b088447fc150df88b92ecb3f2b0ad6c7c57f44b3f658f5","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-10T06:31:04.303077+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-08-08T05:29:16.636662Z","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-21T07:14:46.000267Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-08-08T05:29:16.636662Z","title":"Memory-efficient transformers via Top-k attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08363","last_updated":"2026-06-16T14:51:28Z","snapshot_observed_at":"2026-08-08T05:20:34.050192Z","submitted_at":"2025-02-12T12:50:15Z","title":"Top-Theta Attention: Sparsifying Transformers by Compensated Thresholding","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T05:29:16.636662Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2502.08363"},"observation_digest":"sha256:4375b1d13ba098beba7e7b7746c64d842d6b4d37927654a65a829580459288bc","observation_id":"7071b526-fca2-4e43-b591-d3875491b258","resolution":{"observed_at":"2026-08-08T05:29:16.636662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-08-07T11:25:59.218497Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.02572","last_updated":"2025-06-03T07:53:32Z","snapshot_observed_at":"2026-08-08T22:46:21.801125Z","submitted_at":"2025-06-03T07:53:32Z","title":"HATA: Trainable and Hardware-Efficient Hash-Aware Top-k Attention for Scalable Large Model Inference","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T11:25:59.218497Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2506.02572"},"observation_digest":"sha256:02cc70d8ff4157095f530a17996201321705dea644f664a4e21f06a458e2c12b","observation_id":"8629c365-fbe6-4024-9823-fe469e099adb","resolution":{"observed_at":"2026-08-07T11:25:59.218497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-08-07T10:24:27.813137Z","title":"Memory-efficient transformers via top-k attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05300","last_updated":"2025-06-05T17:50:32Z","snapshot_observed_at":"2026-08-07T10:19:13.309866Z","submitted_at":"2025-06-05T17:50:32Z","title":"Power Law Guided Dynamic Sifting for Efficient Attention","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:24:27.813137Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2506.05300"},"observation_digest":"sha256:c7dd902aa0429b594d65cef333b1044f9c3e0ae258113970a69476000de5ce43","observation_id":"7e97d933-5039-405c-a9c7-73d870709794","resolution":{"observed_at":"2026-08-07T10:24:27.813137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-08-03T18:21:21.384834Z","title":"Gupta, A., Dar, G., Goodman, S., Ciprut, D., and Berant, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.05865","last_updated":"2026-05-25T10:36:39Z","snapshot_observed_at":"2026-08-08T06:24:17.961399Z","submitted_at":"2025-12-05T16:40:08Z","title":"Intrinsically Interpretable Attention via Sparse Post-Training","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T18:21:21.384834Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2512.05865"},"observation_digest":"sha256:260a35e900f8bd9037b9167c466428110d9379087dec8abb601f7014faa95a64","observation_id":"aa3f98c1-20a4-48dc-a006-317d94de4b5f","resolution":{"observed_at":"2026-08-03T18:21:21.384834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":"2106.06899","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Memory-efficient transformers via top-kattention.arXiv preprint arXiv:2106.06899","venue":null,"work_id":"2ad4d3f8-b641-4d40-a91e-558b90372497","year":2021},"citing_paper":{"arxiv_id":"2604.10539","last_updated":"2026-04-12T09:02:20Z","snapshot_observed_at":"2026-07-06T22:59:09.778842Z","submitted_at":"2026-04-12T09:02:20Z","title":"IceCache: Memory-efficient KV-cache Management for Long-Sequence LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T15:46:43.682254Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2604.10539"},"observation_digest":"sha256:9c15e83888a0f72b2489b2408cd971bfe9056c7c412b2e648ece3d707d55b9fd","observation_id":"b9df8033-0a9d-41dc-af77-8b7542d73854","resolution":{"observed_at":"2026-05-11T09:51:01.173772Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":"2106.06899","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Memory-efficient transformers via top-kattention.arXiv preprint arXiv:2106.06899","venue":null,"work_id":"2ad4d3f8-b641-4d40-a91e-558b90372497","year":2021},"citing_paper":{"arxiv_id":"2605.19893","last_updated":"2026-05-20T15:53:57Z","snapshot_observed_at":"2026-08-01T18:25:14.648621Z","submitted_at":"2026-05-19T14:24:27Z","title":"SSV: Sparse Speculative Verification for Efficient LLM Inference","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T07:14:04.899063Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2605.19893"},"observation_digest":"sha256:2a8682351e68f4192ce515bab449c269b942bf06ddca6d2aea55f13d96b00ca5","observation_id":"fc118f20-937a-4f2d-be8d-71f424da3f34","resolution":{"observed_at":"2026-05-21T07:14:46.002795Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06899","snapshot_observed_at":"2026-07-11T10:13:57.510918Z","title":"Memory-efficient Transformers via Top-k Attention,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.05005","last_updated":"2026-07-06T12:46:15Z","snapshot_observed_at":"2026-08-06T08:10:59.719376Z","submitted_at":"2026-07-06T12:46:15Z","title":"Geometry-aware Depth-guided Representation Learning for Structure-preserving Low-light Image Enhancement","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-11T10:13:57.510918Z"},"links":{"cited_paper":"/paper/2106.06899","citing_paper":"/paper/2607.05005"},"observation_digest":"sha256:7d2c621460d7769a8539277bce0784205b4a5434b7890505ad805d23e019e7fa","observation_id":"88b2ce2c-8f85-4dd2-b493-9b33669d678f","resolution":{"observed_at":"2026-07-11T10:13:57.510918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2106.06899/citation-record","integrity":"/paper/2106.06899/integrity","json":"/paper/2106.06899/citation-record.json","paper":"/paper/2106.06899"},"outbound":[],"paper":{"arxiv_id":"2106.06899","last_updated":"2021-06-13T02:30:23Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T01:15:11.346221Z","submitted_at":"2021-06-13T02:30:23Z","title":"Memory-efficient Transformers via Top-$k$ Attention"},"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-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 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2106.06899."}