{"as_of":"2026-08-21T04:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e65b5fd81f9e603f6f1d2e6de02dbce5e26de6f06ddd31e322280fddb00a064","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:27:29.753722Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2505.13164/citation-record","integrity":"/paper/2505.13164/integrity","json":"/paper/2505.13164/citation-record.json","paper":"/paper/2505.13164"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.6115","last_updated":"2014-12-18T21:09:01Z","snapshot_observed_at":"2026-08-14T23:06:53.533484Z","submitted_at":"2014-12-18T21:09:01Z","title":"Compressing Deep Convolutional Networks using Vector Quantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6115","snapshot_observed_at":"2026-08-15T20:27:29.625401Z","title":"Compressing deep convolutional networks using vector quantization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.625401Z"},"links":{"cited_paper":"/paper/1412.6115","citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:02bc6837a33fe49087e63951f16b79c2ef1bbea10d2efac93ef3b82486c9f6b5","observation_id":"cfcd4678-25ba-491e-9adc-2ef5f88cd577","resolution":{"observed_at":"2026-08-15T20:27:29.625401Z","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-15T20:27:29.630893Z","title":"Quantization and training of neural networks for efficient integer-arithmetic-only inference,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.630893Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:e0fad48c6c1d3761220f99b0eda2e09b3c3a0ec5e47e57ee35171574214a9a68","observation_id":"e7c7c6e3-52db-40b5-aeeb-019f534be5e0","resolution":{"observed_at":"2026-08-15T20:27:29.630893Z","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-15T20:27:30.160531Z","title":"Gpt3. int8 (): 8-bit matrix multiplication for transformers at scale,","venue":null,"work_id":"c5fdb914-68c2-49f3-9200-3c772579f224","year":2022},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.635461Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:d79fee8a3e6a0c1942ebb149f69e2716610acc50f451cb577e348c88b8dc373c","observation_id":"18d6db65-efec-424e-a9c5-eb54c0b95db5","resolution":{"observed_at":"2026-08-15T20:27:30.165420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.147220Z","title":"Zeroquant: Efficient and affordable post-training quantization for large- scale transformers,","venue":null,"work_id":"3f903f2d-cf4b-4658-8f09-829b6e4fb943","year":2022},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.639544Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:1fd9a0f867814718d02fde40e9e59752fbe11ec04ca9404639d24fa1d122022b","observation_id":"a11b0224-4413-4098-af92-6cb19d52d6e2","resolution":{"observed_at":"2026-08-15T20:27:30.151857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.644553Z","title":"Smoothquant: Accurate and efficient post-training quantization for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.644553Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:21f0f41307555547e546e521f7445817f84c177b11f1cb0ab74f2fc9bf57c506","observation_id":"e4c2b83e-4f53-499b-8b80-fca1d0a05a2f","resolution":{"observed_at":"2026-08-15T20:27:29.644553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17764","last_updated":"2024-02-27T18:56:19Z","snapshot_observed_at":"2026-08-14T15:17:37.878305Z","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-15T20:27:29.649154Z","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":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.649154Z"},"links":{"cited_paper":"/paper/2402.17764","citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:c95804052645dab67ad541d5e29c83515381d25fb4bdc81a5821ed6aca2b4718","observation_id":"1e9e0c47-6543-46ff-8b9e-8bc589e39399","resolution":{"observed_at":"2026-08-15T20:27:29.649154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04396","last_updated":"2024-06-04T04:51:52Z","snapshot_observed_at":"2026-08-18T15:55:18.958104Z","submitted_at":"2024-02-06T20:52:12Z","title":"QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04396","snapshot_observed_at":"2026-08-15T20:27:29.653760Z","title":"Quip#: Even better llm quantization with hadamard incoherence and lattice codebooks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.653760Z"},"links":{"cited_paper":"/paper/2402.04396","citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:f0551f02fbc89a1c7684da3fde44b83e77806964259be2fd4d529bf88f76f812","observation_id":"960df4e4-6bd5-4ba9-a664-f4c54df000b8","resolution":{"observed_at":"2026-08-15T20:27:29.653760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11235","last_updated":"2025-06-18T02:49:59Z","snapshot_observed_at":"2026-08-16T13:42:25.847371Z","submitted_at":"2024-06-17T06:03:13Z","title":"QTIP: Quantization with Trellises and Incoherence Processing","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11235","snapshot_observed_at":"2026-08-15T20:27:29.659559Z","title":"Qtip: Quantization with trellises and incoherence processing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.659559Z"},"links":{"cited_paper":"/paper/2406.11235","citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:ca0d6a2f08cb9a8699af30804c18e7d28e850d4725fabc5f9a7ca2f94421d2ee","observation_id":"c80f9dc4-ef72-4c96-ad71-0a6ffb78c8bb","resolution":{"observed_at":"2026-08-15T20:27:29.659559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T20:27:29.664458Z","title":"Quarot: Outlier-free 4-bit inference in rotated llms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.664458Z"},"links":{"cited_paper":"/paper/2404.00456","citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:76d3d4edc3a4fe038561669862b3d4f0047a85b0d85bbc592e974f0100346f5f","observation_id":"4d59a662-c6d1-4752-9828-d4624d0dd2ab","resolution":{"observed_at":"2026-08-15T20:27:29.664458Z","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-15T20:27:30.127028Z","title":"Dynamic network surgery for efficient dnns,","venue":null,"work_id":"ea4ab782-50b8-4518-8242-cb21dbf6fbfc","year":2016},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.668653Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:9bd580e5d1351b7666cfa8d96bb9df5ccf62f4f0c76d16bf85083a5092601254","observation_id":"9c32f403-609a-4771-88bd-946905ea6757","resolution":{"observed_at":"2026-08-15T20:27:30.131077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.114101Z","title":"OPTQ: Accurate quantization for generative pre-trained transformers,","venue":null,"work_id":"27d60a4a-8975-43dd-b54f-7f237d22b900","year":2023},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.672855Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:b233c3a5d347e53d2a3c2e5bd276a8634735fab6bf3281c1eb287ddc62cc7b6f","observation_id":"9eac15a7-5607-4db6-8643-3ddd28d9dc4a","resolution":{"observed_at":"2026-08-15T20:27:30.118526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.677191Z","title":"Optimal quantization for matrix multiplication,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.677191Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:dabd0a0a6a151903a5330afdf381dcb8adf884a0bf7f7eb39c3edb7ec79cd066","observation_id":"77aa0b1c-6b83-4287-9c76-3335576266de","resolution":{"observed_at":"2026-08-15T20:27:29.677191Z","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-15T20:27:30.101375Z","title":"A fast encoding method for lattice codes and quantizers,","venue":null,"work_id":"abcc542d-07c4-492d-92f8-02c1c0221105","year":1983},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.682041Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:5c4af9b91068335312b89314f29fe0f7ff2cf6c3402b0e2279805caab51aeae7","observation_id":"34e577fc-05f7-4521-9c6a-4867d50ab5f4","resolution":{"observed_at":"2026-08-15T20:27:30.105664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09720","last_updated":"2025-07-26T15:13:56Z","snapshot_observed_at":"2026-08-20T03:39:04.034729Z","submitted_at":"2025-02-13T19:11:40Z","title":"NestQuant: Nested Lattice Quantization for Matrix Products and LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09720","snapshot_observed_at":"2026-08-15T20:27:29.686673Z","title":"NestQuant: Nested lattice quantization for matrix products and LLMs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.686673Z"},"links":{"cited_paper":"/paper/2502.09720","citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:039e7458835ddd19b1fda0797659c697f90b989f7cfe5d2398e3bcb0e10f7194","observation_id":"4cae989b-5ae2-4544-850a-b7d43c5f7a1b","resolution":{"observed_at":"2026-08-15T20:27:29.686673Z","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-15T20:27:30.086636Z","title":"A python package for neseted-lattice LUT,","venue":null,"work_id":"729e8c9c-35ae-4dc5-a030-b5b864e6daf7","year":2025},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.692253Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:2c414755c38774ab857bf4bd340ce74eec5fed79a712ecc841af37332623a7ea","observation_id":"6c34160a-5f35-42d8-b448-722bf6c2372f","resolution":{"observed_at":"2026-08-15T20:27:30.093077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.074012Z","title":"A C package for neseted-lattice LUT,","venue":null,"work_id":"38ce2c12-53b0-46f1-a6a9-81e1c6f41f05","year":2025},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.697075Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:b8fe8957e7fb18e7a596d69c96d059034f543aed60853ea522cc7578f15aa337","observation_id":"4c8b9188-f90a-461b-b1bd-0cae6c2eb744","resolution":{"observed_at":"2026-08-15T20:27:30.078405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.058389Z","title":"Successive refinement of information,","venue":null,"work_id":"ca92b150-4e8d-4d90-8834-de0bac5e69fa","year":1991},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.701995Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:80b76ad201ed5f3dc5285d31b3f28fdd686ccf5def4ef2cb17295641442b1b08","observation_id":"b26c6051-6d97-4445-92eb-8e87d0df38cc","resolution":{"observed_at":"2026-08-15T20:27:30.063287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.042731Z","title":"Embedded image coding using zerotrees of wavelet coefficients,","venue":null,"work_id":"01b2e9c9-dc6d-4ee5-ab8b-d7aba1b6f61e","year":1993},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.706994Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:45da80f25b8ff0020f3e18dba413326b7cb196d4daa43b581a8d068f9c4736ff","observation_id":"7827bfd8-1bd2-443d-b55c-139d0b4228a7","resolution":{"observed_at":"2026-08-15T20:27:30.047974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.025992Z","title":"A new, fast, and efficient image codec based on set partitioning in hierarchical trees,","venue":null,"work_id":"e6d9511a-ed76-4a10-959f-71a66e8d0f4f","year":1996},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.711636Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:9a3a5890d6db9bbe414c03d289e608969053f7bbc4e0fc9e7bb423407318e8c0","observation_id":"d98b87f9-84d8-4aae-9e98-bd8ce7c41dde","resolution":{"observed_at":"2026-08-15T20:27:30.032975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:30.009247Z","title":"Successive refinement lattice vector quantization,","venue":null,"work_id":"95f0d8ab-60ef-4b42-8893-804a0f5373c7","year":2002},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.716204Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:8658d2588d1a61b5c93223556fb43d913c966c64709eb9599fe5277ceb9132d8","observation_id":"1c1c9a24-1784-4224-96a3-500c378aa00e","resolution":{"observed_at":"2026-08-15T20:27:30.013535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.995660Z","title":"Embedded voronoi codes for successive refinement lattice vector quantization,","venue":null,"work_id":"962a5351-637f-4c01-8bf4-7417730f99ab","year":2013},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.720549Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:865a968197f31b2addf1ae39f3ae3af08b0c6944fb92794f71847f4837c31abb","observation_id":"a10c2d90-ad19-4bb5-ba7d-1f22c3ce8b9a","resolution":{"observed_at":"2026-08-15T20:27:30.000119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.983402Z","title":"Quantization,","venue":null,"work_id":"953f928d-2df3-471e-b956-8e9893a90de3","year":1998},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.726072Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:4c9a72ea8d97057aa677e18d3fca39b54a477ee262caa467458d068b69fb6ccd","observation_id":"0d5c3e81-b541-420c-b889-97b71cc2e43e","resolution":{"observed_at":"2026-08-15T20:27:29.987174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.731467Z","title":"Gersho and R","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.731467Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:6611386906a4d3332cf26f3432cbda9aab8d92f1d360b35593e5c8cb5e79f4da","observation_id":"bb85f1fd-2d49-4263-84e9-163f372ccec6","resolution":{"observed_at":"2026-08-15T20:27:29.731467Z","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-15T20:27:29.735582Z","title":"Product quantization for nearest neighbor search,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.735582Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:8a0b229c57227d9bf69e7badf19c354db4301ed07845440ba4b64b5010457c88","observation_id":"02d9e522-77fc-4e17-bb89-9c3f107971da","resolution":{"observed_at":"2026-08-15T20:27:29.735582Z","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-15T20:27:29.956861Z","title":"Additive quantization for extreme vector compression,","venue":null,"work_id":"f3025eb0-6a02-4290-a976-3e33153c3ad9","year":2014},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.739821Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:31cbd9e25c1e437366cae2113b26ceb0b98d4d732c8176500283f12f27c59576","observation_id":"70168b8b-cb58-4a56-8f90-52a0164d22ff","resolution":{"observed_at":"2026-08-15T20:27:29.961276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.941082Z","title":"Bolt: Accelerated data mining with fast vector compression,","venue":null,"work_id":"67ef9485-ac18-4a47-95ab-ce36d1b66acb","year":2017},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.744233Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:3ddd57b45815fb6769977842926ec631c2f88df7ccd3bca33bc55d852c0dbdb2","observation_id":"a2617b95-5439-44ee-a1c4-b51ffa561b69","resolution":{"observed_at":"2026-08-15T20:27:29.947756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T20:27:29.749024Z","title":"Multiplying matrices without multiplying,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.749024Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:2683092df49fcb51268ef3a3df990ac6f35cf925b5f2a4ceb96fa823dba741c8","observation_id":"3d5406e3-6300-40a6-8782-67b28daf8448","resolution":{"observed_at":"2026-08-15T20:27:29.749024Z","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-15T20:27:29.753722Z","title":"Zamir,Lattice Coding for Signals and Networks: A Structured Cod- ing Approach to Quantization, Modulation, and Multiuser Information Theory","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:29.753722Z"},"links":{"citing_paper":"/paper/2505.13164"},"observation_digest":"sha256:75275e67d7d9e64232b17b35dcaaf57378e5fef8eca14a42424fd6b861b40e0d","observation_id":"5f5c9b11-432c-4103-8dc3-268e64a8ab58","resolution":{"observed_at":"2026-08-15T20:27:29.753722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.13164","last_updated":"2025-05-19T14:22:30Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T15:57:32.995560Z","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":28},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2505.13164."}