{"as_of":"2026-08-09T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2f7d43166db02c29c1986858dc9eaae3efd96e8fdb2ea0750734d716f360325f","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T04:10:44.036518Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T21:25:26.862900Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-30T21:35:04.979211Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"cited_work":{"arxiv_id":"2602.05790","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.05790","snapshot_observed_at":"2026-06-30T21:35:04.979211Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","venue":"cs.IT","work_id":"d3dc1ffe-1b84-4186-b051-76f4c38e8f28","year":2026},"citing_paper":{"arxiv_id":"2605.13768","last_updated":"2026-06-08T15:33:38Z","snapshot_observed_at":"2026-08-01T18:18:03.683548Z","submitted_at":"2026-05-13T16:47:25Z","title":"High-Rate Quantized Matrix Multiplication II","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-14T19:29:22.250363Z"},"links":{"cited_paper":"/paper/2602.05790","citing_paper":"/paper/2605.13768"},"observation_digest":"sha256:28f2905240c84ece16a89b9681deeec5ee03324425b683412f3387a0b5c9d7d9","observation_id":"534b9087-c437-449c-8103-64f9796ebae1","resolution":{"observed_at":"2026-06-19T17:09:51.143232Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"cited_work":{"arxiv_id":"2602.05790","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.05790","snapshot_observed_at":"2026-06-30T21:35:04.979211Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","venue":"cs.IT","work_id":"d3dc1ffe-1b84-4186-b051-76f4c38e8f28","year":2026},"citing_paper":{"arxiv_id":"2605.13768","last_updated":"2026-06-08T15:33:38Z","snapshot_observed_at":"2026-08-01T18:18:03.683548Z","submitted_at":"2026-05-13T16:47:25Z","title":"High-Rate Quantized Matrix Multiplication II","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T21:25:26.862900Z"},"links":{"cited_paper":"/paper/2602.05790","citing_paper":"/paper/2605.13768"},"observation_digest":"sha256:68b672fbaed9f8d6b824b61237627337c4a7343ac0f9f4fe96f0521cf3aced71","observation_id":"626bde3c-2e81-4a0f-b0f0-e2fe2df91142","resolution":{"observed_at":"2026-06-30T21:35:04.980874Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.05790/citation-record","integrity":"/paper/2602.05790/integrity","json":"/paper/2602.05790/citation-record.json","paper":"/paper/2602.05790"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.00456","last_updated":"2024-10-29T11:09:12Z","snapshot_observed_at":"2026-08-05T10:45:45.389337Z","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-03T04:10:41.127884Z","title":"Croci, Bo Li, Pashmina Cameron, Martin Jaggi, Dan Alistarh, Torsten Hoefler, and James Hensman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.127884Z"},"links":{"cited_paper":"/paper/2404.00456","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:eb1d53e42c7d95ff19a489cf92f6cdd2c50fd3be6117f85e51ab8cdc6c1d2a5f","observation_id":"4f62bff6-9c1a-4a4c-9cfd-ef3d41f8566d","resolution":{"observed_at":"2026-08-03T04:10:41.127884Z","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-03T04:10:41.196324Z","title":"On lov \\'a sz’lattice reduction and the nearest lattice point problem","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.196324Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:cff9bd0d03d93a71555f13d109bf807630bb7615c041477562d63a3094031f0e","observation_id":"cc69f899-c711-44aa-a42d-9d32d6950156","resolution":{"observed_at":"2026-08-03T04:10:41.196324Z","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-03T04:10:41.266860Z","title":"The lattice geometry of neural network quantization--a short equivalence proof of gptq and babai's algorithm","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.266860Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:66f85c6abc1cd79e159ba5bb2304ff4c7ad67eaa6623c2f3d35dc6480653da3a","observation_id":"06792d0b-bc54-42e0-a213-4e385e2b8dcb","resolution":{"observed_at":"2026-08-03T04:10:41.266860Z","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-03T04:10:41.344664Z","title":"Half-quadratic quantization of large machine learning models, November 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.344664Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:552b50a4e1cce55b2b7762ec55efdeced24847311ffd542d1590ac7ffcbc3e08","observation_id":"8c89d8ff-1c88-4b27-97c0-0a3ecb0a2edd","resolution":{"observed_at":"2026-08-03T04:10:41.344664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13304","last_updated":"2024-01-15T21:54:28Z","snapshot_observed_at":"2026-08-07T08:10:21.413901Z","submitted_at":"2023-07-25T07:44:06Z","title":"QuIP: 2-Bit Quantization of Large Language Models With Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13304","snapshot_observed_at":"2026-08-03T04:10:41.398130Z","title":"Quip: 2-bit quantization of large language models with guarantees, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.398130Z"},"links":{"cited_paper":"/paper/2307.13304","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:9a15c9cd08127a5001a79f836db44972d81abd5cf6466ed7a6fe08eccfdd74d4","observation_id":"d6ae2ed5-037e-4513-95bc-ff86ef9107fc","resolution":{"observed_at":"2026-08-03T04:10:41.398130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.00956","last_updated":"2026-05-30T00:18:33Z","snapshot_observed_at":"2026-08-03T19:25:39.020625Z","submitted_at":"2025-11-30T16:17:34Z","title":"WUSH: Near-Optimal Adaptive Transforms for LLM Quantization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.00956","snapshot_observed_at":"2026-08-03T04:10:41.504220Z","title":"Wush: Near-optimal adaptive transforms for llm quantization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.504220Z"},"links":{"cited_paper":"/paper/2512.00956","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:ba1d1b194fe9e06395dbae69db3a8909e268afae0a6c14675cc571aae2c07f87","observation_id":"4317878c-912d-4b9d-b2e4-968fbb2cf9a4","resolution":{"observed_at":"2026-08-03T04:10:41.504220Z","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-03T04:10:41.569842Z","title":"Fast quantizing and decoding and algorithms for lattice quantizers and codes","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.569842Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:376c808703aff79349473a2a83db5921c246c998f4007811f4a9f1d23e7928a1","observation_id":"2d23c87a-600e-46ed-ac05-d6ecd780caa3","resolution":{"observed_at":"2026-08-03T04:10:41.569842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.18553","last_updated":"2026-05-13T13:18:37Z","snapshot_observed_at":"2026-08-02T23:33:27.427966Z","submitted_at":"2025-07-24T16:22:18Z","title":"The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.18553","snapshot_observed_at":"2026-08-03T04:10:41.611324Z","title":"The geometry of llm quantization: Gptq as babai's nearest plane algorithm","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.611324Z"},"links":{"cited_paper":"/paper/2507.18553","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:34fea5d922e7e619d6ab22d45679be98d53e49d37f8e8213dc21049063694d88","observation_id":"67efbb61-6392-414d-8ec1-1c20f0ef88a9","resolution":{"observed_at":"2026-08-03T04:10:41.611324Z","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-03T04:10:41.736296Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.736296Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:3b74ce21cf0a1091d4513156b90077ce38415eb55245183c244f4a52cee8743d","observation_id":"da6b7aef-d9af-46fc-9a1a-292484af2af4","resolution":{"observed_at":"2026-08-03T04:10:41.736296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-03T04:10:41.874388Z","title":"Gptq: Accurate post-training quantization for generative pre-trained transformers, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:41.874388Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:6aab47ac13845111d827d4c3b5cdccf1e60321a6cd6935ebaa0ec6444723a7a5","observation_id":"2cdb6287-5e61-40c7-a763-15d0633c2ac0","resolution":{"observed_at":"2026-08-03T04:10:41.874388Z","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-03T04:10:42.044382Z","title":"Vector quantization and signal compression , volume 159","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.044382Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:de3c44271458039fb5232fb1aa508ce35db3090d12da79bcf1be1c395dce1d76","observation_id":"1d43ca59-0d24-420e-b0c9-76b5df9414e7","resolution":{"observed_at":"2026-08-03T04:10:42.044382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16406","last_updated":"2025-02-20T06:07:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-26T02:15:49Z","title":"SpinQuant: LLM quantization with learned rotations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16406","snapshot_observed_at":"2026-08-03T04:10:42.231360Z","title":"Spinquant: Llm quantization with learned rotations, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.231360Z"},"links":{"cited_paper":"/paper/2405.16406","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:4cf256a461a9d4f72c57f51060a7c9532d7fbe0756e113d82cbd11c3a01d0aff","observation_id":"6cef30d5-c022-417b-964e-7b740219d768","resolution":{"observed_at":"2026-08-03T04:10:42.231360Z","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-03T04:10:42.316280Z","title":"Wornell, and Ram Zamir","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.316280Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:93fccecd7f97d38cdb29ace6f608bcbf2d535fed183f6ec633c99d780c32478f","observation_id":"09f44707-de89-4d78-9f5d-d1f0911baeeb","resolution":{"observed_at":"2026-08-03T04:10:42.316280Z","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-03T04:10:42.429791Z","title":"Pretraining large language models with NVFP4","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.429791Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:85fb84a61b3df589159fff687ceadae14f90fdfb6f5fd2ca4cd8a3fe805a758e","observation_id":"098f487c-44b9-4ee7-8b9e-af0ac3764e92","resolution":{"observed_at":"2026-08-03T04:10:42.429791Z","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-03T04:10:42.591052Z","title":"Optimal quantization for matrix multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.591052Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:ebfccc5ef10d03e8bff66012b10ad716886e0fd92758b5b9005913b31236f7a1","observation_id":"f010f97f-c22d-48f6-bcfb-ffeb706f9b06","resolution":{"observed_at":"2026-08-03T04:10:42.591052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.17187","last_updated":"2026-05-13T16:41:48Z","snapshot_observed_at":"2026-08-06T05:31:02.944877Z","submitted_at":"2026-01-23T21:32:44Z","title":"High-Rate Quantized Matrix Multiplication I","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.17187","snapshot_observed_at":"2026-08-03T04:10:42.730330Z","title":"High-rate quantized matrix multiplication: Theory and practice","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.730330Z"},"links":{"cited_paper":"/paper/2601.17187","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:fe3e091184eb4fb83e079c4c717754d42fd1a5e2a252f911887cc1fcc9adfe52","observation_id":"3f6d98ed-e780-4776-9349-02a0708f678c","resolution":{"observed_at":"2026-08-03T04:10:42.730330Z","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-03T04:10:42.876947Z","title":"OCP microscaling formats ( MX ) specification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.876947Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:895f79eff143b9c74696de4975947f7d73d115dc06217c7ed11b1feb4879c75e","observation_id":"1ee16f05-d472-43aa-ac88-04a3155ff2b0","resolution":{"observed_at":"2026-08-03T04:10:42.876947Z","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-03T04:10:42.987094Z","title":"New bounds on the density of lattice coverings","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:42.987094Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:b9ae426a8f4101b31168445a47e5addb7bcede016fb80e8d6e28878e44f87ee6","observation_id":"04ed03de-53d9-414e-ac03-fb54dbc9ac55","resolution":{"observed_at":"2026-08-03T04:10:42.987094Z","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-03T04:10:43.096631Z","title":"Incremental refinement using a gaussian test channel","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.096631Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:21eccddcab590791534e5c699045c24d2c517aa77d19149e392472ea90a71157","observation_id":"6a19a0f0-a425-48e9-ba03-7f78ca65feb9","resolution":{"observed_at":"2026-08-03T04:10:43.096631Z","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-03T04:10:43.201899Z","title":"Information theory: From coding to learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.201899Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:2ac8715dcfb0f4d42fb2bc9faa740fe266d55d0c64382be980576255cb74a839","observation_id":"b0668cfc-4f26-4ffe-a9ff-79c10daf4dc9","resolution":{"observed_at":"2026-08-03T04:10:43.201899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09720","last_updated":"2025-07-26T15:13:56Z","snapshot_observed_at":"2026-08-07T20:40:25.154569Z","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-03T04:10:43.267220Z","title":"Nestquant: Nested lattice quantization for matrix products and llms, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.267220Z"},"links":{"cited_paper":"/paper/2502.09720","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:06d078a71c3a95d567a4061db3f24653e85d94de78adcbc65a7fde604c5f891e","observation_id":"fa87b4cd-1a48-401d-bb3a-6b47d236c780","resolution":{"observed_at":"2026-08-03T04:10:43.267220Z","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-07-06T17:26:31.326736Z","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-03T04:10:43.337679Z","title":"Quip\\#: Even better llm quantization with hadamard incoherence and lattice codebooks, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.337679Z"},"links":{"cited_paper":"/paper/2402.04396","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:5b38c921e5338a3a34932f14fa44067898f3dac9a3e36435f3fce8e911c4ba44","observation_id":"29b21c0b-812c-4736-98e7-520c6166b220","resolution":{"observed_at":"2026-08-03T04:10:43.337679Z","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-07-06T18:31:57.866202Z","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-03T04:10:43.426592Z","title":"Qtip: Quantization with trellises and incoherence processing, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.426592Z"},"links":{"cited_paper":"/paper/2406.11235","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:3e59f954d05db0b61412e27ea93b9497f2319bfb3a691d189242d1d3e5b231dd","observation_id":"72c6a244-9d6b-45b1-8a0c-2af1019fca79","resolution":{"observed_at":"2026-08-03T04:10:43.426592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22988","last_updated":"2026-06-03T05:56:05Z","snapshot_observed_at":"2026-08-07T12:53:31.543703Z","submitted_at":"2025-05-29T01:53:00Z","title":"Model-Preserving Adaptive Rounding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22988","snapshot_observed_at":"2026-08-03T04:10:43.570058Z","title":"Model-preserving adaptive rounding, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.570058Z"},"links":{"cited_paper":"/paper/2505.22988","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:fd2b0052598b337d40c4d1539085ac81e05e843c33ad91c82c133c22f233a33e","observation_id":"a4a88437-d021-4df4-89be-964fb58da721","resolution":{"observed_at":"2026-08-03T04:10:43.570058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10438","last_updated":"2024-03-29T19:21:58Z","snapshot_observed_at":"2026-08-07T09:04:32.994880Z","submitted_at":"2022-11-18T18:59:33Z","title":"SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.10438","snapshot_observed_at":"2026-08-03T04:10:43.720124Z","title":"Smoothquant: Accurate and efficient post-training quantization for large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.720124Z"},"links":{"cited_paper":"/paper/2211.10438","citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:fe2a44e47c3bea0e9376ffdc5811937e8d923c173d1efb86eae6a41a4b72ce24","observation_id":"f743ca3e-6e8a-4d90-ae6c-ef47fbb62a9e","resolution":{"observed_at":"2026-08-03T04:10:43.720124Z","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-03T04:10:43.860364Z","title":"The rate loss in the wyner-ziv problem","venue":null,"work_id":null,"year":2073},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:43.860364Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:50279bd85ccf38752563f8455958099514aa8a8c7afaa3ffb1aadf1a3f129770","observation_id":"cb41887f-70fd-498e-8b76-140fc4add164","resolution":{"observed_at":"2026-08-03T04:10:43.860364Z","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-03T04:10:44.036518Z","title":"Multiterminal source coding with high resolution","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-03T04:10:44.036518Z"},"links":{"citing_paper":"/paper/2602.05790"},"observation_digest":"sha256:41a03a64c46195bf9a6c67ee0b844fcaff1045911587a90a0d3b07bab0fd4d90","observation_id":"2e3a646c-f632-41ea-8b03-9b4814c72eaf","resolution":{"observed_at":"2026-08-03T04:10:44.036518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.05790","last_updated":"2026-06-15T20:50:08Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-03T04:10:38.797902Z","submitted_at":"2026-02-05T15:46:53Z","title":"Price of metric universality in vector quantization is at most 0.11 bit"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 2 inbound Pith citation observations for arXiv:2602.05790."}