{"as_of":"2026-08-11T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b8e2e4578c099c8b4ac210964adfd7a062e4475c5c615a35f2abda179b13a28","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:08:08.088488Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-04T18:00:22.893297Z","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":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10658","snapshot_observed_at":"2026-08-04T18:00:22.893297Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-10T06:59:43.190955Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.893297Z"},"links":{"cited_paper":"/paper/2501.10658","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:a570bb807794cddd0a79fa83ded8cc2f73e138f06d1411d927d0792f71211e06","observation_id":"28d25403-e5eb-461c-858a-f3f9b86db23f","resolution":{"observed_at":"2026-08-04T18:00:22.893297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.10658/citation-record","integrity":"/paper/2501.10658/integrity","json":"/paper/2501.10658/citation-record.json","paper":"/paper/2501.10658"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3656643","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:08:08.388448Z","title":"Pqa: Exploring the potential of product quantization in dnn hardware acceleration,","venue":null,"work_id":"20122071-ddb4-4a7d-b809-c19f60d347ca","year":2024},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.712531Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:f6e2b67e05f1005cfe1461ecbeaf6a6b2bbfde2d03ad566a51373c668ecde7df","observation_id":"dde9fbb6-d633-4f91-85d0-43d7555a4b07","resolution":{"observed_at":"2026-08-10T19:08:08.394053Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.718313Z","title":"Hardware approximate techniques for deep neural network accelerators: A survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.718313Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:f412597734fdaa8049d6e8be96cdb83bed296e96799a3c10f56a6d7e23cf0e99","observation_id":"945d3ae2-6be6-4cbb-97b5-737f22d6a72f","resolution":{"observed_at":"2026-08-10T19:08:07.718313Z","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-10T19:08:10.831839Z","title":"Chisel: constructing hardware in a scala embedded language,","venue":null,"work_id":"71d1129b-f281-4f1c-9cbd-b2264effb263","year":2012},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.725229Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:0338dfaae0909456b86da99f0edcfcb962accf42dfd4ea09204725c91bde69d5","observation_id":"bbc4cb98-bf31-46c3-948a-67510288076e","resolution":{"observed_at":"2026-08-10T19:08:10.836405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.817085Z","title":"Multiplying matrices without multiplying,","venue":null,"work_id":"c4cc8fd9-993b-44ed-bf75-13ba2df81a68","year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.730969Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:b8d9a8d29d835035a46b376e1fa7feade11c5666ca7047284ce7055125e70390","observation_id":"9ab3a886-df53-48af-9201-8a805059bf48","resolution":{"observed_at":"2026-08-10T19:08:10.821872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.747163Z","title":"RTX on - the NVIDIA turing GPU,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.747163Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:7027fea5a4dbe4c67029faa29b7505b7acd61fe25bbeef4f2537ed289a9992ef","observation_id":"783eddc8-83de-4095-86f1-d8b7ec4e726b","resolution":{"observed_at":"2026-08-10T19:08:07.747163Z","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":"2022.00094","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:08:10.258585Z","title":"Deepburning-seg: Generating DNN accelerators of segment-grained pipeline architecture,","venue":null,"work_id":"ab91b749-852f-4122-8e3d-34d318c43d0b","year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.753984Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:5972a94d366a91f5c817d863a0a6682ce514282635268836427c6a85dfac388b","observation_id":"c91d9d9d-71ef-4756-860f-83f49123470e","resolution":{"observed_at":"2026-08-10T19:08:10.265703Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.803213Z","title":"QuIP: 2-bit quantization of large language models with guarantees,","venue":null,"work_id":"10fed974-c14f-4411-99b5-74313618454c","year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.759918Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:9fe1dc0d25c2063c7333aaf286db487537ac1f998109557c0db67a734df936ff","observation_id":"c7254e08-8015-43ef-8ad3-5f6c41868bbd","resolution":{"observed_at":"2026-08-10T19:08:10.807946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.764296Z","title":"NVIDIA hopper H100 GPU: scaling performance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.764296Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:f4a65016617b7743e49aebb7eccbec75a16a18befaf9e674a3964fbeddcf9821","observation_id":"d08fa562-8aa5-41b1-b13d-f3f962dbb987","resolution":{"observed_at":"2026-08-10T19:08:07.764296Z","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-10T19:08:07.769457Z","title":"NVIDIA A100 tensor core GPU: performance and innovation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.769457Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:9f5fbdd4ed1a1c11c9adc168681e88e5f1d16df709c26b8baf9ee4e9969317a6","observation_id":"18d4721f-2d83-4053-9ae7-c8e9d6285243","resolution":{"observed_at":"2026-08-10T19:08:07.769457Z","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-10T19:08:10.788666Z","title":"Using vector quantization for image processing,","venue":null,"work_id":"0fa878b6-f5a9-44e2-8d15-99aabf47dc26","year":1993},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.775199Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:214bd2965ac37865004e1403cee92a5ba33d0164b65ff359069d3acbcb01ad44","observation_id":"46756d9c-9a17-49be-a18c-214454343e9b","resolution":{"observed_at":"2026-08-10T19:08:10.793785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17323","last_updated":"2023-03-22T13:10:47Z","snapshot_observed_at":"2026-08-07T08:38:54.025062Z","submitted_at":"2022-10-31T13:42:40Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17323","snapshot_observed_at":"2026-08-10T19:08:07.780471Z","title":"GPTQ: accurate post-training quantization for generative pre-trained transformers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.780471Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:04faa3730f52adfb1ce856203e25b826f7ba0c3c9c7df71c7f720f02b3875053","observation_id":"9b678fd2-7b24-405e-852e-d641dc64c74e","resolution":{"observed_at":"2026-08-10T19:08:07.780471Z","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-10T19:08:07.790592Z","title":"The accelerator wall: Limits of chip specialization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.790592Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:6c061ed578022fd055791617d09fa1929b5f0601b53f05266652768fda71ccc2","observation_id":"16d6186e-d5f9-4e56-934d-2c7bb7a96dfd","resolution":{"observed_at":"2026-08-10T19:08:07.790592Z","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-10T19:08:07.795884Z","title":"Optimized product quantization for approximate nearest neighbor search,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.795884Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:239441f89775523bba547012193298873dab368cce42b4e14655d1c84429c16e","observation_id":"793fbf82-31c7-4e1e-8895-ccbe81c2d5cc","resolution":{"observed_at":"2026-08-10T19:08:07.795884Z","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-10T19:08:10.642384Z","title":"Optimized product quantization,","venue":null,"work_id":"82706f55-a91b-4543-8591-b598a4164cdd","year":2014},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.801309Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:401461d58be100b21e69d44eb3b3e9b5dd15d44f8bd49b564b768c3dfb74e425","observation_id":"fcec88cd-2518-4c13-bd8d-1e70ced5ed30","resolution":{"observed_at":"2026-08-10T19:08:10.646686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.806370Z","title":"Gemmini: Enabling systematic deep- learning architecture evaluation via full-stack integration,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.806370Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:2add9a17411698a844da90429bc77af096bfcb758a00a269a90923c22b0ef23e","observation_id":"dbc75e92-730d-421e-9c05-40f26a291deb","resolution":{"observed_at":"2026-08-10T19:08:07.806370Z","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-10T19:08:07.811273Z","title":"Vector quantization,","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.811273Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:8418165bdd41f30ca1dbfba4dc67033017086c0946a8253018b822f05e9b2253","observation_id":"4682dfed-12d2-464f-9701-188e401d7273","resolution":{"observed_at":"2026-08-10T19:08:07.811273Z","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-10T19:08:10.607640Z","title":"Ant: Exploiting adaptive numerical data type for low-bit deep neural network quantization,","venue":null,"work_id":"541010ee-a54e-47a7-b49b-f10454eab2d6","year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.820427Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:c6cec04c625afc7635ff378e65b864054c5c6dbf817f20eafd85ea5e0d6c6c8e","observation_id":"9f359ad4-4431-455c-ad50-209be68b37b5","resolution":{"observed_at":"2026-08-10T19:08:10.613050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.29030","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:08:09.795208Z","title":"NNPIM: A processing in-memory architecture for neural network acceleration,","venue":null,"work_id":"d7c7a1a1-f3ae-437d-b13f-695af4e62733","year":2019},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.825297Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:af1fb9bb64cc6f34818915f8e75c239076d38c369991c01d56c61e68acc940e9","observation_id":"07d1ff8b-fa36-4731-b148-6b0a2e64bac8","resolution":{"observed_at":"2026-08-10T19:08:09.803651Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.832016Z","title":"ELSA: hardware-software co-design for efficient, lightweight self- attention mechanism in neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.832016Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:9b2d3e40f0f3b25c1044b1beb4b8d75da70188a654c3d2994ddfae9062979a9f","observation_id":"61babdbf-e420-48c3-be3f-707aad83937d","resolution":{"observed_at":"2026-08-10T19:08:07.832016Z","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-10T19:08:10.586412Z","title":"Approximate computing: An emerging paradigm for energy-efficient design,","venue":null,"work_id":"c029e784-f0e4-4924-b7ae-693bead509b1","year":2013},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.835902Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:ec0c178fa121b93909ec1de4639285929750d3022a961ebe94f2b68e3c1da884","observation_id":"f3712130-205e-4ee7-b700-c2e737a97e00","resolution":{"observed_at":"2026-08-10T19:08:10.591967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.844929Z","title":"EIE: efficient inference engine on compressed deep neural network,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.844929Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:752615fedf95403a7ada4c822616f994cb844764caf8220106ea153ec4c4a88c","observation_id":"6aea3903-ec86-4658-a4a0-ce23f50477a1","resolution":{"observed_at":"2026-08-10T19:08:07.844929Z","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-10T19:08:10.570379Z","title":"Limits to the energy efficiency of cmos microprocessors,","venue":null,"work_id":"afa897f9-f9f3-41fa-b870-2f23297ad10e","year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.851928Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:568724b7bed68b39c8c66c0b1a64513f685dbe7b4ba7476dc211ef4f58888810","observation_id":"ee4ad6f5-7bf9-4ae6-b0d3-149fa17d5785","resolution":{"observed_at":"2026-08-10T19:08:10.575332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-08-09T19:52:33.533277Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-10T19:08:07.857696Z","title":"Training compute-optimal large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.857696Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:ca2421beeed8478d0d1ab428623d1558b7a9adca69141489acacb9a5a53f8621","observation_id":"1845a48b-614d-489c-941b-9610a8d040cd","resolution":{"observed_at":"2026-08-10T19:08:07.857696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05794","last_updated":"2019-04-11T18:36:50Z","snapshot_observed_at":"2026-07-06T06:44:58.350748Z","submitted_at":"2018-06-15T03:07:55Z","title":"RAPIDNN: In-Memory Deep Neural Network Acceleration Framework","version":4},"cited_work":{"arxiv_id":"1806.05794","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.05794","snapshot_observed_at":"2026-08-10T19:08:09.625877Z","title":"RAPIDNN: In-Memory Deep Neural Network Acceleration Framework","venue":"cs.NE","work_id":"551e7999-b67f-4a81-b488-c5b4fffae370","year":2018},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.862921Z"},"links":{"cited_paper":"/paper/1806.05794","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:bc8d6ae0c1d8b08e1b19f3fdcd6e38adb449a424ddb89d3a9d84cdc96b7d7468","observation_id":"038586c4-963a-4aa8-8c00-199abc84f01b","resolution":{"observed_at":"2026-08-10T19:08:09.631026Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01951","last_updated":"2023-09-05T19:55:48Z","snapshot_observed_at":"2026-08-11T11:31:31.345703Z","submitted_at":"2023-04-03T12:41:46Z","title":"TransPimLib: A Library for Efficient Transcendental Functions on Processing-in-Memory Systems","version":5},"cited_work":{"arxiv_id":"2304.01951","doi":"10.48550/arxiv.2304.01951","metadata_source":"pith","pith_arxiv_id":"2304.01951","snapshot_observed_at":"2026-08-11T00:16:15.729268Z","title":"TransPimLib: A Library for Efficient Transcendental Functions on Processing-in-Memory Systems","venue":"cs.MS","work_id":"7a1ec981-fd79-4f87-a14a-23b8107e68b1","year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.871950Z"},"links":{"cited_paper":"/paper/2304.01951","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:845011022236a892618b5ca8e3e42fc9db32e75bf7293a4430c1a12db7070ddc","observation_id":"d0595540-0190-4271-9341-1cf654343799","resolution":{"observed_at":"2026-08-10T19:08:08.293056Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.881118Z","title":"TPU v4: An optically reconfigurable supercomputer for machine learning with hardware support for embeddings,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.881118Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:45702cad0469b8e4c7a1a3a176f4ce0054d7935d7f8a3c5920b1d2d10facd1fa","observation_id":"a26c901e-d9a5-4fce-a306-0d6e9c499026","resolution":{"observed_at":"2026-08-10T19:08:07.881118Z","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-10T19:08:07.888027Z","title":"In-datacenter performance analysis of a tensor processing unit,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.888027Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:d5d1df59c10f3846efd8a0cad92db5762fac9863791ad0fba74f5435564b949d","observation_id":"2afc66ba-96b0-462c-9154-7931e7cbda62","resolution":{"observed_at":"2026-08-10T19:08:07.888027Z","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-10T19:08:07.895541Z","title":"Product quantization for nearest neighbor search,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.895541Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:c46aacf0687a4b0a23cc30196291799ce48e4d2f383f34c2e120a81c43a3be09","observation_id":"87c11917-38dd-4b71-82d8-f2f341604ecb","resolution":{"observed_at":"2026-08-10T19:08:07.895541Z","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-07-06T08:52:12.656082Z","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-10T19:08:07.901478Z","title":"Scaling laws for neural language models,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.901478Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:d7be25c40087e4b48755f1f99c6bc733570b807f4379682e0b41787fb111029a","observation_id":"0515ce70-0426-461b-ab6c-bd9d4c477f36","resolution":{"observed_at":"2026-08-10T19:08:07.901478Z","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-10T19:08:07.907761Z","title":"Irreversibility and heat generation in the computing process,","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.907761Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:69c899d7bf51022ad31074bf69a46b552e57a774217ac3f3577ac64650752a0a","observation_id":"126d5574-bd54-4211-93b8-b6c73934c7cd","resolution":{"observed_at":"2026-08-10T19:08:07.907761Z","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-10T19:08:10.531686Z","title":"Pim-dl: Expanding the applicability of commodity dram-pims for deep learning via algorithm-system co-optimization,","venue":null,"work_id":"a4b99afd-df25-499b-a264-0058ee87266c","year":2024},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.913077Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:789b670505ba891b24555bc67e5d4ac1d664f541611dcad13a75311022098854","observation_id":"bbce58c6-aa07-4017-8078-cba08ea1f1c9","resolution":{"observed_at":"2026-08-10T19:08:10.538600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:07.918603Z","title":"Boosting mobile CNN inference through semantic memory,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.918603Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:467d436d07cd58b538ed7597e1f9a99daa33b0aa2c3160b28d70666a64973670","observation_id":"3ff823bc-901a-4202-b945-66d37befa08f","resolution":{"observed_at":"2026-08-10T19:08:07.918603Z","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-10T19:08:07.922958Z","title":"RRAM-DNN: an RRAM and model-compression empowered all-weights-on-chip DNN accelerator,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.922958Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:af8ddaddc3d5dc1c3d3270bed92de94add66c94eabfe45adcddd4212a84f4cb8","observation_id":"7e70fbcb-1e67-459a-97cc-1ab0134b9100","resolution":{"observed_at":"2026-08-10T19:08:07.922958Z","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-10T19:08:07.927464Z","title":"AWQ: activation-aware weight quantization for LLM compression and acceleration,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.927464Z"},"links":{"cited_paper":"/paper/2306.00978","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:2cfd07f26fed60081a0bee3e99ec1a07aa2abd88fa2939d26ef176a309ffa85d","observation_id":"6ac19495-ff49-4400-a00e-ab74d6173202","resolution":{"observed_at":"2026-08-10T19:08:07.927464Z","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-10T19:08:10.516199Z","title":"LLM-FP4: 4-bit floating-point quantized transformers,","venue":null,"work_id":"f0db4ee6-a3db-45d3-9154-1a076493f2f2","year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.932216Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:a3dde7649d1e903dbfdb7331ea84f01a5cb97563d1ccdbdfffcb0501c3916a98","observation_id":"be3c4794-779c-4a50-b11c-7a24aa41e8f1","resolution":{"observed_at":"2026-08-10T19:08:10.521015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17764","last_updated":"2024-02-27T18:56:19Z","snapshot_observed_at":"2026-08-03T00:59:01.026576Z","submitted_at":"2024-02-27T18:56:19Z","title":"The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17764","snapshot_observed_at":"2026-08-10T19:08:07.937338Z","title":"The era of 1-bit llms: All large language models are in 1.58 bits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.937338Z"},"links":{"cited_paper":"/paper/2402.17764","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:245600a2ec8591e6ceeede6a4283775cf63e36bed6c16dcab2005be0a5361c68","observation_id":"9132cc3c-5d72-4be5-9d55-e4a14c08dcfd","resolution":{"observed_at":"2026-08-10T19:08:07.937338Z","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-10T19:08:10.499638Z","title":"Vector quantization in speech coding,","venue":null,"work_id":"df3beb43-1a4d-4cfa-ac13-a6e125340d1e","year":1985},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.943687Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:fdadf44a4b3c117a8e10abf3e3d09a01e28cef35d22a7dd160577cf87ca9e0af","observation_id":"d842961a-9f1c-494f-bace-2b4ea4b5e1fe","resolution":{"observed_at":"2026-08-10T19:08:10.505268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.05433","last_updated":"2022-09-29T20:47:07Z","snapshot_observed_at":"2026-08-10T16:19:00.326414Z","submitted_at":"2022-09-12T17:39:55Z","title":"FP8 Formats for Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.05433","snapshot_observed_at":"2026-08-10T19:08:07.956374Z","title":"FP8 formats for deep learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.956374Z"},"links":{"cited_paper":"/paper/2209.05433","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:7b355df8b977a241d9e2c9a928295cfdfa097f205bd65bf15c2a9c4d40305761","observation_id":"752d69fb-7f16-4d81-9aa1-58bcb390921e","resolution":{"observed_at":"2026-08-10T19:08:07.956374Z","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":"2019.87148","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:08:09.325384Z","title":"Energy-efficient convolutional neural networks via recurrent data reuse,","venue":null,"work_id":"8cfc4aaa-25c5-4cb9-824a-43d66612a2e5","year":2019},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.962053Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:d0a14280af26c6d12faae79420572166d74f2ddbc91f554d4b9feb592e4a0020","observation_id":"09f60f27-6cc7-4046-bed8-f3959c9cdf38","resolution":{"observed_at":"2026-08-10T19:08:09.332192Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.480010Z","title":"Evoapprox8b: Library of approximate adders and multipliers for circuit design and benchmarking of approximation methods,","venue":null,"work_id":"7e0e3d3a-0f2f-4c26-ab6a-10f62ff13035","year":2017},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.966968Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:93930e9f31a309be488fb3b0ca8a84f0f2bfb2d29755e079ef19ee77c616e536","observation_id":"91425202-83e9-4ab6-81ba-451124866bb2","resolution":{"observed_at":"2026-08-10T19:08:10.486576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20000","last_updated":"2023-09-13T18:53:05Z","snapshot_observed_at":"2026-08-05T23:00:02.859255Z","submitted_at":"2023-05-31T16:21:20Z","title":"Memory-Centric Computing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20000","snapshot_observed_at":"2026-08-10T19:08:07.973238Z","title":"Memory-centric computing,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.973238Z"},"links":{"cited_paper":"/paper/2305.20000","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:1ebc84f12b90f6aeff7db71e7ec62f3fe40aa4f75dc970c0151ce3af8473a3d1","observation_id":"7559f981-faeb-4cdf-b3d9-7aad4f53aab6","resolution":{"observed_at":"2026-08-10T19:08:07.973238Z","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-10T19:08:10.464506Z","title":"Nvdla open source hardware performance","venue":null,"work_id":"935a1664-e6b4-48ed-a276-3b1bc2b24913","year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.984840Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:60537a21dbd6cbf5b769ba997702e19a5068b807c09bdf489fe4e3abcb323e3d","observation_id":"c2cab699-1c35-48b8-a9e7-c13c56cbc549","resolution":{"observed_at":"2026-08-10T19:08:10.470316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.446479Z","title":"Nvidia deep learning accelerator","venue":null,"work_id":"d560dd5a-da21-4e1e-b300-2a9462aeca82","year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.989596Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:b9325524c5e14ce7bf86d0d2362001de8f44a6a3cd44a5bd362d6d4126b06453","observation_id":"bcb94b94-b06a-4006-a3ac-334198fc5ff3","resolution":{"observed_at":"2026-08-10T19:08:10.452041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.430506Z","title":"(2024) Nvidia dgx b200 datasheet","venue":null,"work_id":"d25bef64-cdb9-46bd-95d0-30c1167a6b34","year":2024},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.994255Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:7953795aaf24307a1b2e48e976e89bbdb091ea458a70d0c96143bac033b6d123","observation_id":"2ce3b791-eca7-433b-be86-81b764246440","resolution":{"observed_at":"2026-08-10T19:08:10.434661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:08.001932Z","title":"SCNN: an accelerator for compressed-sparse convolutional neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.001932Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:43ed7b614d6b8e9fb754dc2f90363da098dac3d694018a2969970716eab9e212","observation_id":"a44c2e24-f800-4e0f-9873-dd6cd074b41a","resolution":{"observed_at":"2026-08-10T19:08:08.001932Z","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-10T19:08:10.416572Z","title":"LUT-GEMM: quantized matrix multiplication based on luts for efficient inference in large- scale generative language models,","venue":null,"work_id":"3a97abdb-cad8-4d20-b899-9bbddb221286","year":2024},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.007871Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:0fcfabb71d1842f6ccb589bc6f625e55da1a536afd4ccd55b0081ead06c1be2e","observation_id":"9d1d1dd8-d926-4de9-ad7e-b567fac39aba","resolution":{"observed_at":"2026-08-10T19:08:10.421304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:08.012930Z","title":"FACT: ffn-attention co-optimized transformer architecture with eager correlation prediction,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.012930Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:534be3e1e4abd35b89d28acc91080b7ec9cc406e97e9b559373743340dcbc058","observation_id":"8d789c1a-f89d-4a41-a8e7-66b87787142a","resolution":{"observed_at":"2026-08-10T19:08:08.012930Z","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-10T19:08:08.017830Z","title":"PECAN: A product-quantized content addressable memory network,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.017830Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:117ccc97846c9ecfac67eb74b8ea587b5cb905195eb2ab5d494a803d23f4ba6d","observation_id":"e074848e-62cb-43ca-8783-0029119ad8af","resolution":{"observed_at":"2026-08-10T19:08:08.017830Z","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-10T19:08:08.022431Z","title":"Computation reuse in dnns by exploiting input similarity,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.022431Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:65cc339d1a53d6f7e19e48872755d53abbf71eadc3120a724c95a698fda0c61e","observation_id":"93570ab9-6cf5-4a8f-a4d0-fed8eee6a97b","resolution":{"observed_at":"2026-08-10T19:08:08.022431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10207","last_updated":"2025-07-25T07:29:36Z","snapshot_observed_at":"2026-08-09T14:32:20.731826Z","submitted_at":"2023-11-16T21:43:05Z","title":"Stella Nera: A Differentiable Maddness-Based Hardware Accelerator for Efficient Approximate Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10207","snapshot_observed_at":"2026-08-10T19:08:08.027112Z","title":"Stella nera: Achieving 161 top/s/w with multiplier-free DNN acceleration based on approximate matrix multiplication,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.027112Z"},"links":{"cited_paper":"/paper/2311.10207","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:fded7fb9da2aac98709bda9c6861185206dc6b65c24e838a5e9088f5cfb87dea","observation_id":"2cdcfb90-4557-4fc7-be28-93cc6995a168","resolution":{"observed_at":"2026-08-10T19:08:08.027112Z","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-10T19:08:08.032545Z","title":"Softermax: Hardware/software co-design of an efficient softmax for transformers,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.032545Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:edfaf11005ec82f5e48bf19ebb5711bcf677685697e1403d25cd4a4133111192","observation_id":"9b500f3b-6d8c-477e-877f-309bda87e8bc","resolution":{"observed_at":"2026-08-10T19:08:08.032545Z","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-10T19:08:08.038426Z","title":"Scaling equations for the accurate prediction of CMOS device performance from 180 nm to 7 nm,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.038426Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:5a885df3f71063c59d157376db929ca1704dd48195bb3dd8820dbe96dc4f9f95","observation_id":"34abd2e0-41a2-4c6e-9026-7e80254b06ab","resolution":{"observed_at":"2026-08-10T19:08:08.038426Z","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-10T19:08:08.043432Z","title":"LUT-NN: empower efficient neural network inference with centroid learning and table lookup,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.043432Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:1f4496a13c708b53c44116f07759f305f94aab28bdfffcf781557c00d68d6fd4","observation_id":"9599c695-f274-447c-aedc-86d642f01950","resolution":{"observed_at":"2026-08-10T19:08:08.043432Z","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-10T19:08:10.399261Z","title":"Weight-oriented approximation for energy-efficient neural network inference accelerators,","venue":null,"work_id":"d1fd1961-38ed-4450-92c9-80a01d1d5a40","year":2020},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.049699Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:e0ba2b7aa81ed4813117c0091812823d983deeb562b1315db438e954b3a5c31a","observation_id":"cf9e661f-2d46-4e89-8a27-1cf8ec9f2291","resolution":{"observed_at":"2026-08-10T19:08:10.404860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.382843Z","title":"Quip#: Even better llm quantization with hadamard incoherence and lattice codebooks,","venue":null,"work_id":"9937d694-7ac2-4c14-bee3-4233748302dd","year":2024},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.054646Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:e35d67630b36e43e7a10b0fd8390a0f95a2502f09d98885589a075d49e4860f5","observation_id":"9a70b770-46a9-4cc0-854a-c80316aa0560","resolution":{"observed_at":"2026-08-10T19:08:10.387874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T19:08:10.366624Z","title":"GLUE: A multi-task benchmark and analysis platform for natural language understanding,","venue":null,"work_id":"bd6bb2ac-316d-41f6-bb74-384e20d41a2d","year":2018},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.066099Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:66a1cedd89618776842622860b2d78bc8211b7c8a6c92919856b7d09453ee177","observation_id":"d656427d-278e-486d-8a91-0e9c0e7afe32","resolution":{"observed_at":"2026-08-10T19:08:10.373313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11453","last_updated":"2023-10-17T17:59:15Z","snapshot_observed_at":"2026-08-11T03:44:43.109946Z","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-10T19:08:08.073599Z","title":"Bitnet: Scaling 1-bit transformers for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.073599Z"},"links":{"cited_paper":"/paper/2310.11453","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:89c05228b13ad03e3f733a3559b653d8fa9c0e5cc859347a3a6f37dc1626592b","observation_id":"cd5792ab-8f03-4ca8-816f-b9a23f5f0670","resolution":{"observed_at":"2026-08-10T19:08:08.073599Z","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-10T19:08:08.079050Z","title":"Learnable lookup table for neural network quantization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.079050Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:4769860a9fa29aa179b0a65b8555dfec0579da8b95c92c210331cc2032b8c387","observation_id":"4d89cb65-52f9-4215-b743-6cbd1c109726","resolution":{"observed_at":"2026-08-10T19:08:08.079050Z","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-10T19:08:08.083496Z","title":"Nn-lut: Neural approximation of non-linear operations for efficient transformer inference,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.083496Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:da89073d2de1a2f5d9cd86c2f1324423dbc577c65f316f3d6ee534afbfddfce5","observation_id":"6924ed70-2c7d-43c5-9098-8eba4c1818c3","resolution":{"observed_at":"2026-08-10T19:08:08.083496Z","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-10T19:08:08.088488Z","title":"Dnnbuilder: an automated tool for building high-performance DNN hardware accelerators for fpgas,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:08.088488Z"},"links":{"citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:907061a794fbe09a487d3378fba23639ed5d356eb85406be50abc5bfa2ba2ebb","observation_id":"7f1218e3-960b-49f8-89f6-3f7bbf203cd4","resolution":{"observed_at":"2026-08-10T19:08:08.088488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20000","last_updated":"2023-09-13T18:53:05Z","snapshot_observed_at":"2026-08-05T23:00:02.859255Z","submitted_at":"2023-05-31T16:21:20Z","title":"Memory-Centric Computing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20000","snapshot_observed_at":"2026-08-10T19:08:07.978735Z","title":"Available: https://doi.org/10.48550/arXiv.2305.20000","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:07.978735Z"},"links":{"cited_paper":"/paper/2305.20000","citing_paper":"/paper/2501.10658"},"observation_digest":"sha256:f62ca416ef11efe02c7c64018ac8d49d2ca606e51a64763115ac6ee12aec8dbf","observation_id":"21ea5814-1250-4946-a557-02e033d83060","resolution":{"observed_at":"2026-08-10T19:08:07.978735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-11T05:35:14.813751Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":36,"verified_exact":4,"verified_fuzzy":19},"total_outbound_references":61},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 1 inbound Pith citation observation for arXiv:2501.10658."}