{"as_of":"2026-08-09T11:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df93442d5ad9c22a455cea6e94315cca8b94c31050988c655a6f01f446dea7a0","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T22:32:56.444150Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:08:09.010538Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.07713","snapshot_observed_at":"2026-08-01T13:08:09.010538Z","title":"Attention at the Theoretical Minimum: A Mathematics of Ar- rays Framework for Memory-Optimal Trans- former Kernels,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19456","last_updated":"2026-07-21T15:50:28Z","snapshot_observed_at":"2026-08-04T23:13:05.102371Z","submitted_at":"2026-07-21T15:50:28Z","title":"MoA-Structured Decode Attention DNF Derivation, KV-Cache Accumulation, GQA/MQA, and OpenACC Kernel","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T13:08:09.010538Z"},"links":{"cited_paper":"/paper/2606.07713","citing_paper":"/paper/2607.19456"},"observation_digest":"sha256:2cd62295a4b47c10e84acfcb6cff1622c2ddbb5edb605a1ab757db25f4f2863e","observation_id":"487c3671-2490-403b-b5b6-ecbcad1095be","resolution":{"observed_at":"2026-08-01T13:08:09.010538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.07713/citation-record","integrity":"/paper/2606.07713/integrity","json":"/paper/2606.07713/citation-record.json","paper":"/paper/2606.07713"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"FATHOM: Fast attention through optimizing memory","venue":null,"work_id":null,"year":2025},"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":1,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:856ebb6fe15a6aa3dcab9c29e5ed66e42c38379131e1ef27218499596a7d4bb2","observation_id":"3cce840d-df48-4bb0-a082-325f5c2d61b8","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"MOSA: Matrix optimized self-attention hardware accelerator for mobile device","venue":null,"work_id":null,"year":2025},"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":2,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:b98adb880d6c891f62b059f6d447cad451f17256b67f3e69bd7fb2a4695147e8","observation_id":"a35b2311-1aa3-49ac-a113-eb678af4a77a","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":"2307.08691","doi":"10.48550/arxiv.2307.08691","metadata_source":"pith","pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","venue":"cs.LG","work_id":"fff3953b-5efb-4753-bee4-002f59995810","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":3,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:069d79921da9420ca1fc135dafe2c8375391f0dce8cc9c0902f52ffe11ffe8bd","observation_id":"2ff700ae-f76d-4b9c-b841-57e88d6cbaff","resolution":{"observed_at":"2026-07-02T16:37:09.301147Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-13T15:50:18.243793+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T15:50:18.243793+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14135","last_updated":"2022-06-23T17:53:32Z","snapshot_observed_at":"2026-07-06T13:14:48.753329Z","submitted_at":"2022-05-27T17:53:09Z","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","version":2},"cited_work":{"arxiv_id":"2205.14135","doi":"10.48550/arxiv.2205.14135","metadata_source":"pith","pith_arxiv_id":"2205.14135","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","venue":"cs.LG","work_id":"efa96825-0830-4cfc-a250-fdaf6af302ab","year":2022},"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":4,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"cited_paper":"/paper/2205.14135","citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:19e99a2278a506e70f406ee65a5968bcadff935fb5c8e03d33e8ec230f63ce0e","observation_id":"9e6bbb37-4863-4ed9-a3e4-4f72e56f162b","resolution":{"observed_at":"2026-07-02T16:37:09.295708Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-13T15:50:18.534404+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T15:50:18.534404+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/electronics7110320","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hardware considerations for tensor implementation and analysis using the field programmable gate array","venue":"Electronics","work_id":"b02270b9-28c5-4886-9332-95152c0b8c4f","year":2018},"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":5,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:6b3daf626c4c755e31d490791133975c73a2363cdbc3c36214fe5121a11baa07","observation_id":"6605622a-6c48-4fd0-b93a-e5e1ab789318","resolution":{"observed_at":"2026-06-27T22:41:23.898840Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/info13110528","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Realizing mathematics of arrays operations as custom architecture hardware-software co-design solutions","venue":"Information","work_id":"9717a3ae-b92a-46ba-86b4-7545b0df3eb9","year":null},"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":6,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:1b4e1317707f51ddc26605fb048f3a4a05401b357a64556e2389160b818be3a9","observation_id":"bc413ab4-7cbb-4e9f-86cf-7049052967c2","resolution":{"observed_at":"2026-06-27T22:41:23.900855Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Processing in memory for mathematics of arrays operations","venue":null,"work_id":null,"year":2022},"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":7,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:b4d5a70d48e41ba04c6162d5b86def55bb7906fe2e02543334bdc28b3a900e52","observation_id":"16216584-1b2d-4b85-8a07-c0fa99c83335","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","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:b267ed019c770239cdc9a11865e8a0e2f40805a93e9d098e48611e411626403e","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":null,"venue":null,"work_id":null,"year":2026},"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":9,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:756971bce257d0e49223f2a9c8a198fd6d890dd5aad1a7b5c7316dd5378017fc","observation_id":"1a516b0c-d999-4a5d-a791-1a5bb6b91bc9","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"A ^3 : Accelerating attention mechanisms in neural networks with approximation","venue":null,"work_id":null,"year":2020},"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":10,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:ffaec55468113ec80c6145a204ec8291f64a25360d3ca36b990841845f33c852","observation_id":"d1055bb5-dbff-4801-914b-ad13cf3a9eb9","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Acceleration of fully connected layers on FPGA using the Strassen matrix multiplication","venue":null,"work_id":null,"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":11,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:895f25abccc6de32965b9fcd8d7a66601708e5d2ccf3c5a78556d56c38fccaf5","observation_id":"318cae26-df65-49f6-b0e8-cce56e9e9e3a","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16731","last_updated":"2025-05-20T20:28:55Z","snapshot_observed_at":"2026-08-07T16:47:55.874142Z","submitted_at":"2025-03-20T22:15:42Z","title":"Design and Implementation of an FPGA-Based Hardware Accelerator for Transformer","version":3},"cited_work":{"arxiv_id":"2503.16731","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.16731","snapshot_observed_at":"2026-07-02T16:37:09.291720Z","title":"Design and implementation of an fpga-based hardware accelerator for transformer","venue":null,"work_id":"e9d6d39a-2aad-4389-9120-69d255303640","year":2025},"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":12,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"cited_paper":"/paper/2503.16731","citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:c79f78a7435c3d825c77846feba86c79a6c118cfc18e37f43d83da6b6ff5fc62","observation_id":"1b2f47cc-08a3-4c42-acf9-80b3ac870984","resolution":{"observed_at":"2026-07-02T16:37:09.293187Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Research on matrix multiplication optimization and deployment method for heterogeneous platforms","venue":null,"work_id":null,"year":2024},"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":13,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:28a726e08c012fee88c65c08ab251833b3741ede38dd31c7b872278d60a82be2","observation_id":"f7372ef7-b175-4c53-93e5-2bf4e08abd07","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Array access and performance regarding numerical algorithms","venue":null,"work_id":null,"year":2026},"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":14,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:0cd91aa72aeb88bf4b2ff467971f40b4b8ad4daafdae9f8019f8967a347416c8","observation_id":"2a5736dd-15d8-49d6-86c5-9d5b4fb35d16","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"A Mathematics of Arrays","venue":null,"work_id":null,"year":1988},"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":15,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:d254b8cd6fbafde33b0313ad8d0a45ff902f36f61a318be808b9198fb342b470","observation_id":"e41d9201-4449-4f98-9682-a16cd1455ac3","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11148","last_updated":"2023-06-19T20:10:23Z","snapshot_observed_at":"2026-07-06T15:44:19.958726Z","submitted_at":"2023-06-19T20:10:23Z","title":"From array algebra to energy efficiency on GPUs: Data and hardware shapes with dimension-lifting to optimize memory-processor layouts","version":1},"cited_work":{"arxiv_id":"2306.11148","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.11148","snapshot_observed_at":"2026-07-02T16:37:09.279396Z","title":"From array algebra to energy efficiency on GPUs","venue":null,"work_id":"5a3ed4b1-5678-46b6-848c-64a40a101e32","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":16,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"cited_paper":"/paper/2306.11148","citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:bfa5f0b79c20948754e51d07e2023aacea6ee6826235c76c85291348ea2e3ae3","observation_id":"de69877b-f1c1-409c-9965-6f0457587a40","resolution":{"observed_at":"2026-07-02T16:37:09.280982Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Towards automatic, predictable and high-performance parallel code generation","venue":null,"work_id":null,"year":2025},"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":17,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:23d9bf80a271ded2ceb31382675833196b24f8e5d0591c8748e6fd71b721ee1c","observation_id":"dc789cdc-e395-4774-b16e-ecbd46091da6","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"New mathematics for computer performance: array algebra and cost functions","venue":null,"work_id":null,"year":2026},"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":18,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:c6a2cfbbaf962dd031f43977de9572c0a1b4dab76a4e4c2422474f7bdf449dd0","observation_id":"82f8b2be-9d72-4e49-927f-43f4e20e1efe","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"OPTIMUS: Optimized matrix multiplication structure for transformer neural network accelerator","venue":null,"work_id":null,"year":2020},"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":19,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:5e0b0c535fa37de34d0725740349f8ab35c9dd8c4a8b26ac24c17fb0ee2bcabe","observation_id":"288b6404-5124-4727-8712-cc421e9ab0a0","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"FACT: FFN-attention co-optimized transformer architecture with eager correlation prediction","venue":null,"work_id":null,"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":20,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:8b231ddbc82ef316c10a60910361ca0c9d93a55f6cfb4823affbbf298bb16b07","observation_id":"411e3766-809e-4e95-b3ab-8e7a5647c639","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"High-performance Gemmini-based matrix multiplication accelerator for deep learning workloads","venue":null,"work_id":null,"year":2025},"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":21,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:59a2a4ff30a635c2f08812798d20ec4f533af46b1dc60a805d1f074b813bbc0c","observation_id":"ebbeb976-a8bf-4c79-a53a-404cc2581dbf","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Design and implementation of a BRAM-banked double-buffered matrix multiplication accelerator for transformer models on edge FPGAs","venue":null,"work_id":null,"year":2025},"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":22,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:ade5f1467322e1e7a4cd13de8e534e823e017ac17163c05007b97ceab1b173be","observation_id":"b09d5781-1cb5-4a9b-9b76-5dc65048c819","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Improving the performance of DGEMM with MoA and cache-blocking","venue":null,"work_id":null,"year":null},"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":23,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:17f5e8c7a2d37d5b69479ecd3541d74fb311b5b117ee9101263ef4c05991c8d3","observation_id":"b706a879-9be6-464d-a411-9e548f1f4de6","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Threaded multicore GEMM with MoA and cache-blocking","venue":null,"work_id":null,"year":null},"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":24,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:2e2596805897a1f023de95107e03caac7740841fb89238d687f2d6ab24060613","observation_id":"2cedba33-dad1-4d9a-9f92-2e71ebd5d115","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"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":25,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:a1d9a1287d951ba267e99a1dbb8b4bb736fd556f498123bc167f5666f03e2196","observation_id":"01cf1fa2-2842-4610-afb9-c30081b9588a","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T22:32:56.444150Z","title":"Hardware friendly transformer optimization with dynamic attention matrix fusion","venue":null,"work_id":null,"year":2025},"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":26,"source":"arxiv_source","source_observed_at":"2026-06-27T22:32:56.444150Z"},"links":{"citing_paper":"/paper/2606.07713"},"observation_digest":"sha256:9728d3a195ae91248e108a00e0f95b95b8dee4dfc35f2abc16003688dd70e08e","observation_id":"357f9832-6c53-4e8a-ad71-fc104d91e53f","resolution":{"observed_at":"2026-06-27T22:32:56.444150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.07713","last_updated":"2026-06-05T14:44:49Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":26},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2606.07713."}