{"as_of":"2026-08-08T17:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7a206b8a9a1551ccdacc4f6f72a0af71d38a4a7eb7633acc5ad77b841652fd4","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:39:14.153603Z","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-07-02T16:37:09.296789Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":"2309.07418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-07-02T16:37:09.296789Z","title":"A fast optimization view: Reformu- lating single layer attention in llm based on tensor and svm trick, and solving it in matrix multiplication time","venue":null,"work_id":"0ba76cfa-67c7-426f-b836-bcce295634c2","year":2023},"citing_paper":{"arxiv_id":"2306.14048","last_updated":"2023-12-18T19:10:00Z","snapshot_observed_at":"2026-08-06T19:19:02.165567Z","submitted_at":"2023-06-24T20:11:14Z","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","version":3},"reference_index":111,"source":"pdf_text","source_observed_at":"2026-05-17T18:00:50.053377Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2306.14048"},"observation_digest":"sha256:ccc640909c5f6040bfb568857c4ba494d7b25e145bbd748cdcc5be083075e1c5","observation_id":"41c6058a-fc62-4869-adc5-76ba5f75b3c6","resolution":{"observed_at":"2026-05-17T18:00:50.319286Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-08-08T16:39:14.153603Z","title":"A fast optimization view: Reformulating single layer attention in llm based on tensor and svm trick, and solving it in matrix multiplication time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-08T16:28:42.719100Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.153603Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:337bfb461eefc6aca391b883bd5226df45639fdb860d5a8088661bc2169bf087","observation_id":"b608b22e-dbe5-4319-80d7-cc00511d4b8e","resolution":{"observed_at":"2026-08-08T16:39:14.153603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-08-07T15:42:52.220796Z","title":"A fast optimization view: Reformulating single layer attention in llm based on tensor and svm trick, and solving it in matrix multiplication time","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14840","last_updated":"2025-05-20T19:12:43Z","snapshot_observed_at":"2026-08-08T17:27:21.465455Z","submitted_at":"2025-05-20T19:12:43Z","title":"Subquadratic Algorithms and Hardness for Attention with Any Temperature","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:42:52.220796Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2505.14840"},"observation_digest":"sha256:2dc22dd68ee814de23bdfc7e4b4714c3b069686defc2dfe3347e0fd3d94f8ece","observation_id":"477ac53f-f88c-4aa6-ab43-da5744a65aa8","resolution":{"observed_at":"2026-08-07T15:42:52.220796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-08-06T23:04:03.550004Z","title":"A fast optimization view: Reformulating single layer attention in llm based on tensor and svm trick, and solving it in matrix multiplication time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.550004Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:72a91467c24e7cc0f17805b389dcb384759e8ddddb20563159c9c07c9644ab42","observation_id":"44853712-05b8-401f-ade7-0b627ecb60f1","resolution":{"observed_at":"2026-08-06T23:04:03.550004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":"2309.07418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-07-02T16:37:09.296789Z","title":"A fast optimization view: Reformu- lating single layer attention in llm based on tensor and svm trick, and solving it in matrix multiplication time","venue":null,"work_id":"0ba76cfa-67c7-426f-b836-bcce295634c2","year":2023},"citing_paper":{"arxiv_id":"2606.07713","last_updated":"2026-06-05T14:44:49Z","snapshot_observed_at":"2026-07-06T23:47:19.773490Z","submitted_at":"2026-06-05T14:44:49Z","title":"Attention at the Theoretical Minimum: A Mathematics of Arrays Framework for Memory-Optimal Transformer Kernels","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:d77e83d04f233e7ec6274009825ed54afadde71c92e011071f9cfc55daad7019","observation_id":"892184b8-f20f-4656-958a-3a9e40760422","resolution":{"observed_at":"2026-07-02T16:37:09.298326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2309.07418/citation-record","integrity":"/paper/2309.07418/integrity","json":"/paper/2309.07418/citation-record.json","paper":"/paper/2309.07418"},"outbound":[],"paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2309.07418."}