{"as_of":"2026-08-19T18:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25bf81802f18223d5e27fd0c2af0216eed173d3a0868884039bc3b7bd99c855c","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:15:17.380151Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:11:04.223226Z","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-18T17:51:42.259748Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.16339","snapshot_observed_at":"2026-08-15T21:11:04.223226Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.10909","last_updated":"2025-05-16T06:29:24Z","snapshot_observed_at":"2026-08-19T08:00:32.839178Z","submitted_at":"2025-05-16T06:29:24Z","title":"Phi: Leveraging Pattern-based Hierarchical Sparsity for High-Efficiency Spiking Neural Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:11:04.223226Z"},"links":{"cited_paper":"/paper/2504.16339","citing_paper":"/paper/2505.10909"},"observation_digest":"sha256:e8da5cb36d7f95d7c30d75f6c961b26c2ec35057ba5f0a926db8fb0998587dc0","observation_id":"b4da093f-0f09-4083-89b6-948a31f0d4bd","resolution":{"observed_at":"2026-08-15T21:11:04.223226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"cited_work":{"arxiv_id":"2504.16339","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16339","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ae2f9476-3550-4366-8056-7ab094ff4543","year":2025},"citing_paper":{"arxiv_id":"2509.09505","last_updated":"2026-04-12T10:29:26Z","snapshot_observed_at":"2026-07-06T22:28:48.082201Z","submitted_at":"2025-09-11T14:49:50Z","title":"Combating the Memory Walls: Optimization Pathways for Long-Context Agentic LLM Inference","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T17:47:58.019030Z"},"links":{"cited_paper":"/paper/2504.16339","citing_paper":"/paper/2509.09505"},"observation_digest":"sha256:2b36b82798475e3d8d9e69ede25f3cda6da22fd9465d30741b7581e388ec6c54","observation_id":"1c1fbd05-483f-4ba1-a2c5-8b3ab8736212","resolution":{"observed_at":"2026-05-18T17:51:42.262793Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.16339/citation-record","integrity":"/paper/2504.16339/integrity","json":"/paper/2504.16339/citation-record.json","paper":"/paper/2504.16339"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.361493Z","title":null,"venue":null,"work_id":"fba20c0a-711d-4895-bd29-3b16f6af477c","year":2017},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.053340Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:e0aec1262dca7e61b40db0e0aac743b158137a0890689a4f7d7dbe8b25e41ba0","observation_id":"0e9574c6-6024-45d1-baa3-64eea2dc8f0e","resolution":{"observed_at":"2026-08-16T11:15:18.365623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00456","last_updated":"2024-10-29T11:09:12Z","snapshot_observed_at":"2026-08-16T14:04:57.666315Z","submitted_at":"2024-03-30T19:20:06Z","title":"QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00456","snapshot_observed_at":"2026-08-16T11:15:17.058844Z","title":"Croci, Bo Li, Pashmina Cameron, Martin Jaggi, Dan Alistarh, Torsten Hoefler, and James Hensman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.058844Z"},"links":{"cited_paper":"/paper/2404.00456","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:1028cfd84a811fcf14f670c3c87274d9a0d76fb4e4601bcefb58f83b4f694e6b","observation_id":"cb9f7642-01ef-4a5a-9145-890d875eea04","resolution":{"observed_at":"2026-08-16T11:15:17.058844Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.347397Z","title":null,"venue":null,"work_id":"acbe5249-7df5-4ac7-8b4a-eef64040b8cc","year":1968},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.064308Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:55890d599debf20c23a986e91c0f3c873186f8355bc6ce22160a3cb3b1dd34a2","observation_id":"9f7b9008-0dc5-465d-8da0-bde4f9ec87b7","resolution":{"observed_at":"2026-08-16T11:15:18.351825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.332108Z","title":null,"venue":null,"work_id":"bc0cfe2d-ca9f-4485-a3c7-4857413686a3","year":1964},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.069209Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:955d7ba6308a262937e1c23a2c8bc2e8ae6a46d1dbc2b1b88e2827550d5c8d3d","observation_id":"25aeac61-a66e-460e-8d2e-9a4080ab5ab5","resolution":{"observed_at":"2026-08-16T11:15:18.336900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.317936Z","title":null,"venue":null,"work_id":"51387eb9-026f-4232-840a-b8555daf21c3","year":1992},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.074105Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:08c569f481825423a845919434fd01bfd8894f0cc8f2f39905ffbc158d746c7d","observation_id":"0ae8e78e-b0b6-4a14-974c-e3726fc50c69","resolution":{"observed_at":"2026-08-16T11:15:18.322338Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-16T11:15:17.084448Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.084448Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:b4d02495f1014c10828c0ae3020f5dde2ecd7a7fbb7f03e49c5eb97c785b3a3c","observation_id":"1de1ec1a-3d71-43ab-a7d3-e24b5f2abe69","resolution":{"observed_at":"2026-08-16T11:15:17.084448Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.303039Z","title":"Abdelfattah","venue":null,"work_id":"44f03c6c-810c-4796-98fa-712a0d646182","year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.093772Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:264b91fd187b1584d29a0a576a7d3ecb739c64c6d327b3111835c1edec1910e7","observation_id":"113b59af-2f9d-41f2-a3f9-42f9a76c230a","resolution":{"observed_at":"2026-08-16T11:15:18.308031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.0759","last_updated":"2014-12-18T01:13:16Z","snapshot_observed_at":"2026-08-14T23:17:07.466378Z","submitted_at":"2014-10-03T06:16:43Z","title":"cuDNN: Efficient Primitives for Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.0759","snapshot_observed_at":"2026-08-16T11:15:17.103232Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.103232Z"},"links":{"cited_paper":"/paper/1410.0759","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:02e8b2a534630d76b9ca4b72c3d2236b41290d4489a6d7266cafdbe8e8e2d81b","observation_id":"196e3f77-8aa0-44f3-971e-e9333036da65","resolution":{"observed_at":"2026-08-16T11:15:17.103232Z","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-08-16T11:15:17.108067Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.108067Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:a0393d46234f8a458594b4f6d9a16c7bb34c475dd8beeb37c9aafb47f67c67d3","observation_id":"5ecd13c1-c3b7-41da-b46a-45c28b4345b5","resolution":{"observed_at":"2026-08-16T11:15:17.108067Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.278664Z","title":null,"venue":null,"work_id":"5ec9b550-2fb9-4afa-8777-3ea50ec988b8","year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.112814Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:abf7e371e4b2a704a08cb22cedd3337520932b944232b0ed88e20591656a17ff","observation_id":"de2c65fa-d756-492f-b9bf-ad63add1ba04","resolution":{"observed_at":"2026-08-16T11:15:18.283225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.117720Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.117720Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:d1239c5afa2c9c6046401a34d1d2c3455dbbbf741a8a94ed469f22be38abcf6e","observation_id":"65d12f68-c894-4529-8748-41a50af66fcb","resolution":{"observed_at":"2026-08-16T11:15:17.117720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-16T11:15:17.122296Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.122296Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:76b6a505a9f9b0f5321e72d1010039361a5b15726f2523ebe64d97dab4a820b8","observation_id":"f91deb86-def7-4ea0-bfc4-a30aaa140833","resolution":{"observed_at":"2026-08-16T11:15:17.122296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-16T11:15:17.127128Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.127128Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:f5880339923bd335d809f937dd2171f5923ea5b834007fe793cacdeeed63b8e2","observation_id":"6593b806-e37e-49f4-a81b-fe5559e1df92","resolution":{"observed_at":"2026-08-16T11:15:17.127128Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.254671Z","title":null,"venue":null,"work_id":"826a9532-5ef4-46d2-b16b-cf5a4964f245","year":1972},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.132111Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:4f61165f6e0e120540fa26cf2097070f805272a1ed3f1bdf3ee50411326c851b","observation_id":"d8abeba0-dfac-4a8a-b5e8-c367bd6c84d4","resolution":{"observed_at":"2026-08-16T11:15:18.259277Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.136432Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.136432Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:b3ad26582fa9d1696b3f88745394db5596e250d7cc90c848fde0b019b98a25bb","observation_id":"c6ef31fa-e48f-4803-af6f-74622712e9d0","resolution":{"observed_at":"2026-08-16T11:15:17.136432Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.230791Z","title":null,"venue":null,"work_id":"57e99398-e67e-4796-bcad-ebcf70915e11","year":2025},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.140885Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:fa567706cf426e0b074c417c9b88edcefefccda7a1c3c7cf0da96bb0c1a4e12b","observation_id":"9365476d-a0c7-4400-9d43-2adde60356bc","resolution":{"observed_at":"2026-08-16T11:15:18.235154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.216791Z","title":null,"venue":null,"work_id":"5b6a518d-ca9e-4209-a63e-b3a5965677f4","year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.145029Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:4c1a8a69c9f34d64a18fff4eb93ba937d4240acf08cb0583173ac7d727eacf9b","observation_id":"b197413e-3af1-41d2-a011-e1f04ca4d22d","resolution":{"observed_at":"2026-08-16T11:15:18.220912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.201592Z","title":null,"venue":null,"work_id":"6e9cc5b1-fd77-4cd7-b159-3a382620682b","year":2022},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.149435Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:af5907c520c2a23523e3c144d93d427f9d7de7cd6c33687c5d9c44fffc31cbf5","observation_id":"76e6470c-eb2b-4af9-8429-2d060faaf275","resolution":{"observed_at":"2026-08-16T11:15:18.206513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.153995Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.153995Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:1851ba68bbae2ae734cbe1a5b8ff6dabe48ed6e67c96f8a64430ce09240140a2","observation_id":"8768e18b-e6e1-4b08-9697-2970f0bf0849","resolution":{"observed_at":"2026-08-16T11:15:17.153995Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.176994Z","title":null,"venue":null,"work_id":"6e276583-96fe-4325-921e-487b9b0abe3d","year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.158924Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:51c1aa91341447e64f22ddee2e50b43d794f6852193a12e94e151532d272ac24","observation_id":"18202946-2acb-4ac6-9c3c-dab06d7650ba","resolution":{"observed_at":"2026-08-16T11:15:18.181594Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.163324Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.163324Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:01e24b3fd76f97879598ff8f0ff87973065f238bcf01b32c412a2cd1e3166ee5","observation_id":"a8446370-53b7-4b27-be0e-81e74efd3093","resolution":{"observed_at":"2026-08-16T11:15:17.163324Z","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-08-16T11:15:17.167629Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.167629Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:d234a5bc4ad94d0485535f816e24a869b450a511809c38a7389403ce9c59f044","observation_id":"03f8b7a7-b2af-43c5-881b-e4d5e206c181","resolution":{"observed_at":"2026-08-16T11:15:17.167629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-16T11:15:17.171941Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.171941Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:85558af34d8e49577740a544f1bcd8d3f950a3dc9846e255f39878dc825d8253","observation_id":"82372e44-789a-44ba-b8e4-d3f2602eaf81","resolution":{"observed_at":"2026-08-16T11:15:17.171941Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.143190Z","title":null,"venue":null,"work_id":"5056ca37-8732-4ef1-8461-6e3f97cb8036","year":1967},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.177082Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:273cb4010221cc0afd6b16675d5ef5c336f64843f9f271c8c37ff0054caaead4","observation_id":"bdfe701f-70cc-466f-8b1b-5cbe38de0701","resolution":{"observed_at":"2026-08-16T11:15:18.147780Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.181451Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.181451Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:7d7a501b61785cf58f54680c714db5bbe61dbeb665ff716efa47e4cd104cdfb5","observation_id":"f5c00fb2-1ddf-4588-bb63-86f6bb0f6ee8","resolution":{"observed_at":"2026-08-16T11:15:17.181451Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.119263Z","title":null,"venue":null,"work_id":"b4e15f6f-1938-4067-addb-8610ad3e32f2","year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.185837Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:cf11df050e3fb4916843c1eea26fdead99b12f3b746305677bd983e69e41979b","observation_id":"9e766ac7-d08d-401d-8259-8fb01bd8f0cc","resolution":{"observed_at":"2026-08-16T11:15:18.123716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.104096Z","title":null,"venue":null,"work_id":"5bf39947-06c5-4e02-a775-1dc83fc50665","year":2025},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.189725Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:ac8168bc337b81d7b45e60f8f324a7681a40fc00c5ad04538f7ff911a56656c7","observation_id":"dde4a580-7b77-4d4b-a3a8-fc4e666c9fe3","resolution":{"observed_at":"2026-08-16T11:15:18.109067Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.05877","last_updated":"2017-12-15T23:56:52Z","snapshot_observed_at":"2026-08-14T20:03:06.929797Z","submitted_at":"2017-12-15T23:56:52Z","title":"Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.05877","snapshot_observed_at":"2026-08-16T11:15:17.193524Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.193524Z"},"links":{"cited_paper":"/paper/1712.05877","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:d8f2426f2e03369579f0a567692f5eed41a1c8c0b37960d99b158d530dc0ccb5","observation_id":"04468aad-d906-4215-a1f6-21cf55292b24","resolution":{"observed_at":"2026-08-16T11:15:17.193524Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.089977Z","title":null,"venue":null,"work_id":"eeb04469-e95f-406f-886f-11cfb14de8c3","year":2017},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.197721Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:e3462c3628d048c46808afb76b8ec15ca7121b3650dfa80efe39ee99ffe9bd28","observation_id":"3882ba1e-a685-4efa-8aee-c4dc91062c9e","resolution":{"observed_at":"2026-08-16T11:15:18.094407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04760","last_updated":"2017-04-16T12:07:54Z","snapshot_observed_at":"2026-08-14T21:06:33.189868Z","submitted_at":"2017-04-16T12:07:54Z","title":"In-Datacenter Performance Analysis of a Tensor Processing Unit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04760","snapshot_observed_at":"2026-08-16T11:15:17.201725Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.201725Z"},"links":{"cited_paper":"/paper/1704.04760","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:0ecd7be33ee568ba87f9a9955bd7a1e6ce8fc0acad34579887f9ee237747d271","observation_id":"caf4d046-e899-438f-a2cb-16553933dd40","resolution":{"observed_at":"2026-08-16T11:15:17.201725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-16T11:15:17.206834Z","title":"Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.206834Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:5496b5eb4feaf7e7a23e05a5e0d821e86cec5e92c7add7c90bef364dc53cf5ef","observation_id":"a16ae938-ddad-4dd0-9f55-2dfba0624dbb","resolution":{"observed_at":"2026-08-16T11:15:17.206834Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.075860Z","title":null,"venue":null,"work_id":"91142107-b303-4e92-8bb6-1f998694d726","year":2009},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.211801Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:307a94557b34408d464767a9f6ab7103c9355f7361a46f303b7c4f18f66af721","observation_id":"668d188f-634d-4606-8bf9-e83b86bbf109","resolution":{"observed_at":"2026-08-16T11:15:18.080183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.216194Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.216194Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:303c552afb3b7b1905169f826d17ccba434c1c902db45028942e217e4c162f3a","observation_id":"c0fbce41-387a-4e64-b83d-98b958adb715","resolution":{"observed_at":"2026-08-16T11:15:17.216194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12930","last_updated":"2024-06-16T09:51:55Z","snapshot_observed_at":"2026-08-16T13:42:35.257059Z","submitted_at":"2024-06-16T09:51:55Z","title":"Tender: Accelerating Large Language Models via Tensor Decomposition and Runtime Requantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12930","snapshot_observed_at":"2026-08-16T11:15:17.220735Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.220735Z"},"links":{"cited_paper":"/paper/2406.12930","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:26b3fcbc26c51e61b473d265f1f47be91a27f12f1cf1be1fd3cdb47e1935b795","observation_id":"d4581649-9da4-4127-b0ed-a2068e2f1d0d","resolution":{"observed_at":"2026-08-16T11:15:17.220735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.03759","last_updated":"2022-01-25T17:15:43Z","snapshot_observed_at":"2026-08-16T17:43:38.223718Z","submitted_at":"2021-11-05T23:38:44Z","title":"MQBench: Towards Reproducible and Deployable Model Quantization Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.03759","snapshot_observed_at":"2026-08-16T11:15:17.225505Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.225505Z"},"links":{"cited_paper":"/paper/2111.03759","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:b7c52ef445c8d8ad16e46f6c22656a70fedf8180c0b8aef74e9d3dc628555e07","observation_id":"7195f874-1ace-4d0c-8ea6-1ffd56833bc0","resolution":{"observed_at":"2026-08-16T11:15:17.225505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00978","last_updated":"2026-04-25T06:58:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-01T17:59:10Z","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00978","snapshot_observed_at":"2026-08-16T11:15:17.230211Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.230211Z"},"links":{"cited_paper":"/paper/2306.00978","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:ef2393a4cbbd65f1de4f8e9e927e6f6fc4f4186f28e10c4b337cdb95de60e25e","observation_id":"062f3281-9585-4c11-a958-ec53c3b37ad1","resolution":{"observed_at":"2026-08-16T11:15:17.230211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04532","last_updated":"2025-05-01T02:14:05Z","snapshot_observed_at":"2026-08-19T14:44:32.329439Z","submitted_at":"2024-05-07T17:59:30Z","title":"QServe: W4A8KV4 Quantization and System Co-design for Efficient LLM Serving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04532","snapshot_observed_at":"2026-08-16T11:15:17.235263Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.235263Z"},"links":{"cited_paper":"/paper/2405.04532","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:caa706692599b5dad0cdf9f868892dd797e87f62a3752ada8091921386a5753f","observation_id":"101fe573-18cd-4288-976c-7dda1f2a97bb","resolution":{"observed_at":"2026-08-16T11:15:17.235263Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.051467Z","title":null,"venue":null,"work_id":"350fe73d-8474-4bf1-87bb-e9af6dc99b39","year":2025},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.240115Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:22d0f0210752a1ff1da1e64f476bd59a6b4aed6288df5ad5a6b1a10aa99813de","observation_id":"b33c0425-1911-4dd2-89b9-08138ee9f2c5","resolution":{"observed_at":"2026-08-16T11:15:18.055994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16406","last_updated":"2025-02-20T06:07:00Z","snapshot_observed_at":"2026-08-16T17:18:05.876361Z","submitted_at":"2024-05-26T02:15:49Z","title":"SpinQuant: LLM quantization with learned rotations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16406","snapshot_observed_at":"2026-08-16T11:15:17.245173Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.245173Z"},"links":{"cited_paper":"/paper/2405.16406","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:22b5e3d0dee5a81ebe900441f4e868ac03a0f8ee039e8269e92d085589317a65","observation_id":"195a5021-184c-446a-87b4-18f36b181f42","resolution":{"observed_at":"2026-08-16T11:15:17.245173Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.036077Z","title":null,"venue":null,"work_id":"079ed679-943b-4ba0-b8b7-e89f86679e2d","year":2021},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.250116Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:1a1fd6f5564e02890b3fa2882e1b74f6e6f228dd0762dfa20dd95ae5013e094b","observation_id":"e39b371a-1b76-4815-93bc-90ef01350366","resolution":{"observed_at":"2026-08-16T11:15:18.041007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-16T11:15:17.254652Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.254652Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:75bdb11c525947a885e710a9ab6c4952982f4cd88d849a1e27febe7681976be4","observation_id":"a2e2ba3e-8bdd-4a7b-b431-9f86a6649de3","resolution":{"observed_at":"2026-08-16T11:15:17.254652Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.020939Z","title":null,"venue":null,"work_id":"4123dc13-f8e4-415b-84c3-87f76815af5d","year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.259608Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:90a77bd0d9ebd85be77d40613a86996412e9d030b010b85551777202f84465ad","observation_id":"bb2acb50-3f6c-438b-8334-2476cc121e37","resolution":{"observed_at":"2026-08-16T11:15:18.025155Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:18.005948Z","title":null,"venue":null,"work_id":"0fe8f044-206b-4259-babd-2ca8a83f23c4","year":2018},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.264386Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:93ff8b05d8e99b29c9be96f74f83d9d2afdf9468167afe74f987ed0862430dc3","observation_id":"92a09ad9-6c2b-4151-851b-561cb8fc0efa","resolution":{"observed_at":"2026-08-16T11:15:18.010635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.269803Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.269803Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:8aacdcbe1a1f90646d2d38adbae1a08f5b71066e8de9e2a317e969f290479ecd","observation_id":"43714106-ac93-43f9-9d76-b766f38633f9","resolution":{"observed_at":"2026-08-16T11:15:17.269803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.13137","last_updated":"2024-03-18T05:33:22Z","snapshot_observed_at":"2026-08-16T15:05:54.961547Z","submitted_at":"2023-08-25T02:28:35Z","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.13137","snapshot_observed_at":"2026-08-16T11:15:17.275664Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.275664Z"},"links":{"cited_paper":"/paper/2308.13137","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:92e9a8b279234ed2f573562d9f55270a4f8c3a82f3828b3daa97e0c58b78d446","observation_id":"d18ae70c-65cd-49c2-80cf-bb90e3184af7","resolution":{"observed_at":"2026-08-16T11:15:17.275664Z","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-08-16T11:15:17.280792Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.280792Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:51ecaa85893633ee99b3a697541b76fae25b8145941aa643724395ea4e02eda1","observation_id":"1322eeca-8671-4b5d-b307-9a6c4ad6383f","resolution":{"observed_at":"2026-08-16T11:15:17.280792Z","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-08-16T11:15:17.285493Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.285493Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:98a314a2687d90f40572ac9a7bf178b9e820a305206f97e1eabef6c06fb1a9e8","observation_id":"c5700650-6a0d-4192-8e50-34cfe25f8f56","resolution":{"observed_at":"2026-08-16T11:15:17.285493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.08053","last_updated":"2020-03-13T23:45:18Z","snapshot_observed_at":"2026-08-12T10:50:46.357243Z","submitted_at":"2019-09-17T19:42:54Z","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.08053","snapshot_observed_at":"2026-08-16T11:15:17.295028Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.295028Z"},"links":{"cited_paper":"/paper/1909.08053","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:b97a17016ddc04cacad49323b23dd1ebd0210f2640212cd27ebcbdfe980cfca5","observation_id":"f09985f4-b4ab-4936-8a60-ae6e6d2ef6ef","resolution":{"observed_at":"2026-08-16T11:15:17.295028Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.962503Z","title":"Proceedings of the 30th IEEE International Symposium on High- Performance Computer Architecture (HPCA) (2024)","venue":null,"work_id":"8dad8fec-daf3-4c98-8fc6-ca579120f113","year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.290531Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:5d44cfb0eb820ce65d2c9a2c95a9a79071f281013df25262d0f52ebde5ab2b69","observation_id":"a6e2f894-10b0-4495-8d64-16a3eec3809f","resolution":{"observed_at":"2026-08-16T11:15:17.967037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-16T11:15:17.304952Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.304952Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:734a47044615c3b230bd193a033629e17bda11076e6dbaed513e0119ae643c1a","observation_id":"8aaf99d2-cfc7-4d56-aea0-f7b903ee82bc","resolution":{"observed_at":"2026-08-16T11:15:17.304952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-16T11:15:17.299971Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.299971Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:7dbbbdf439cbf61d01e4d92ee3970e554bc3edb94af8df2742336eadcdecc029","observation_id":"cb3f0cab-99e4-43ea-8738-dc4449cce6ff","resolution":{"observed_at":"2026-08-16T11:15:17.299971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-08-19T04:42:40.974785Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-16T11:15:17.313419Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.313419Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:57dd8e3ea55d5aef49076e897f5e22cfe00f9bcf6b6323ed03e91ca2d51155de","observation_id":"3ff4507c-3375-4811-9865-36b616f63d86","resolution":{"observed_at":"2026-08-16T11:15:17.313419Z","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-08-16T11:15:17.309459Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.309459Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:435519627832d07b8d1a531d51855aeeb6106a4a0ee38c0819266df73d003a47","observation_id":"4fa8c6ae-cc8f-4807-9b6f-67cbc302775e","resolution":{"observed_at":"2026-08-16T11:15:17.309459Z","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-08-16T11:15:17.321992Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.321992Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:b59d7c7df56f74a9fca102cb70c1ee5f0ebdc5931666f069fb83d8bbd6dc2654","observation_id":"074d3444-4da7-4055-9ec8-a5161da5b4ac","resolution":{"observed_at":"2026-08-16T11:15:17.321992Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.937909Z","title":null,"venue":null,"work_id":"17f20dcc-7f7d-4704-bfb6-5d12a76f641d","year":1968},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.317655Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:33d034fdc3201f89655a4bccb3f413769bddccccb3ef78c8a0e93336ffcbcb88","observation_id":"55f09a0b-2caa-4fe4-80b4-381f4d2296d5","resolution":{"observed_at":"2026-08-16T11:15:17.942664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-16T11:15:17.335367Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.335367Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:084731569a6af898a0a9f09920d1009538bed7e94152cd9e3e2b7596a4ca090f","observation_id":"b5d4b10d-e576-4a40-ad20-dce76b73176d","resolution":{"observed_at":"2026-08-16T11:15:17.335367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03863","last_updated":"2024-05-23T06:08:37Z","snapshot_observed_at":"2026-08-19T14:32:38.763371Z","submitted_at":"2023-12-06T19:18:42Z","title":"Efficient Large Language Models: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03863","snapshot_observed_at":"2026-08-16T11:15:17.326433Z","title":"arXiv:2312.03863 [cs.CL] https://arxiv.org/abs/2312.03863","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.326433Z"},"links":{"cited_paper":"/paper/2312.03863","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:c20f5504b38ce94f67fda224bffef0696df76f9e146a132599b82d4395910ba0","observation_id":"3f0d3d76-8678-430e-bfc6-829538528806","resolution":{"observed_at":"2026-08-16T11:15:17.326433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11453","last_updated":"2023-10-17T17:59:15Z","snapshot_observed_at":"2026-08-15T04:43:14.762539Z","submitted_at":"2023-10-17T17:59:15Z","title":"BitNet: Scaling 1-bit Transformers for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11453","snapshot_observed_at":"2026-08-16T11:15:17.331072Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.331072Z"},"links":{"cited_paper":"/paper/2310.11453","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:2dda48e2dd6ef7e293fc0670d6b6f341a1f5f5e0228836e12f77b4f4859f53b4","observation_id":"d819415c-f16e-4c77-8e8c-d7ca2adafb9f","resolution":{"observed_at":"2026-08-16T11:15:17.331072Z","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-08-16T11:15:17.352531Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.352531Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:9e2213a9be75b683c54f4009e43ac668c24594c6d7da7abd7e400bcf48186c47","observation_id":"bb288000-5c73-4e83-a00d-8fa5f1b717eb","resolution":{"observed_at":"2026-08-16T11:15:17.352531Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.847801Z","title":null,"venue":null,"work_id":"d12a21a3-a68b-4c62-81cd-cc4b3c0ed682","year":2022},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.362216Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:e25bfeb5ec48de78995d2885ddbcff84f92dcf620770612223f4af792fd73511","observation_id":"2af9f54b-0db6-4dd1-b2f2-f7620dc89652","resolution":{"observed_at":"2026-08-16T11:15:17.852648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.887967Z","title":null,"venue":null,"work_id":"06f7e983-4c1b-4c10-a8cc-0de88bb7ac6a","year":2025},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.343912Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:dfeaf8f29d63806455caae17dffb61cda9023b7a73a2fc810f8cd09c4654449a","observation_id":"36ce66e6-c587-4627-b216-565718ac23da","resolution":{"observed_at":"2026-08-16T11:15:17.892908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.872798Z","title":null,"venue":null,"work_id":"a8fe7489-db8d-4841-8a2f-6684a675265e","year":2016},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.348238Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:a361ad4a7e1bd2fc94d86ba9c4db792671edf53a3722e0ee6acd051846e8ad4a","observation_id":"ff0eb8d4-7ee3-4a33-b97c-199d231e5a21","resolution":{"observed_at":"2026-08-16T11:15:17.877785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14048","snapshot_observed_at":"2026-08-16T11:15:17.375490Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.375490Z"},"links":{"cited_paper":"/paper/2306.14048","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:4c8e26481d54764e34f598b6527ea1915968f84e032c211f83047eeca0c1db29","observation_id":"bcd7f306-3a42-45d5-82e8-7c030712d8ba","resolution":{"observed_at":"2026-08-16T11:15:17.375490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10438","last_updated":"2024-03-29T19:21:58Z","snapshot_observed_at":"2026-08-16T16:15:00.962632Z","submitted_at":"2022-11-18T18:59:33Z","title":"SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.10438","snapshot_observed_at":"2026-08-16T11:15:17.356930Z","title":"arXiv:2211.10438 [cs.CL] https://arxiv.org/abs/2211.10438","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.356930Z"},"links":{"cited_paper":"/paper/2211.10438","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:2053b7b7ea95c1c2c83e804f428eee75a353cb94f5430120217383e3e23788da","observation_id":"1fda7c50-b846-4a38-9b96-5038e7adea4a","resolution":{"observed_at":"2026-08-16T11:15:17.356930Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.832792Z","title":null,"venue":null,"work_id":"d5a2720f-3317-4ce7-b78d-07e635ce0a0c","year":2020},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.366661Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:4f11f0296eb2f33aa88f22a286174c911abd56facc3da00ae6b91b58f3e24356","observation_id":"9645fa51-1bcd-4df8-b1ae-f951e414ac60","resolution":{"observed_at":"2026-08-16T11:15:17.837682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.817832Z","title":null,"venue":null,"work_id":"adeb858d-7ec8-4ad3-9486-b719ef7efbfa","year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.371007Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:f6f9f5ed1fc4f3c3fa2d4af1017a1a4c198b0550486477e625c6435169784f06","observation_id":"aadfcd31-0565-4866-bc4e-d37ea1d252f7","resolution":{"observed_at":"2026-08-16T11:15:17.822640Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.803458Z","title":null,"venue":null,"work_id":"f0e63f1f-79c8-45d5-b251-9a23df46d39e","year":2019},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.380151Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:12ff8ae24d70426f8a5b43448a9dc18188d603255879060386a5cef23c640bcc","observation_id":"7cf83951-4c37-4887-9fb4-969489ff274b","resolution":{"observed_at":"2026-08-16T11:15:17.808231Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:15:17.902749Z","title":"In 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA)","venue":null,"work_id":"915cc431-fbf6-4609-b6a3-d70548f5cb1f","year":2021},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.339527Z"},"links":{"citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:a645704dd5ae2fc153180a84d9015f4341a384dafa7f304187006001053bbab8","observation_id":"14d21183-5259-4979-b103-d8897b355cb9","resolution":{"observed_at":"2026-08-16T11:15:17.907748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05227","last_updated":"2024-09-08T21:45:12Z","snapshot_observed_at":"2026-08-19T16:24:48.440384Z","submitted_at":"2024-09-08T21:45:12Z","title":"BBS: Bi-directional Bit-level Sparsity for Deep Learning Acceleration","version":1},"cited_work":{"arxiv_id":"2409.05227","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05227","snapshot_observed_at":"2026-08-16T11:15:17.754679Z","title":"BBS: Bi-directional Bit-level Sparsity for Deep Learning Acceleration","venue":"cs.LG","work_id":"2d0e3648-ce55-4718-8ff1-b71a868dfb7e","year":2024},"citing_paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:17.098457Z"},"links":{"cited_paper":"/paper/2409.05227","citing_paper":"/paper/2504.16339"},"observation_digest":"sha256:7f35968e7da3d2715791370fc058907edda6e86d8a8e0d7f85c41e9388936f14","observation_id":"04d3adb7-3dc9-40a5-9267-8b570738326b","resolution":{"observed_at":"2026-08-16T11:15:17.761648Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16339","last_updated":"2025-04-23T01:23:41Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-19T05:29:46.818016Z","submitted_at":"2025-04-23T01:23:41Z","title":"Transitive Array: An Efficient GEMM Accelerator with Result Reuse"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":65,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":69},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 2 inbound Pith citation observations for arXiv:2504.16339."}