Pith. sign in

Paper Citation Record · LEDGER

Price of metric universality in vector quantization is at most 0.11 bit

As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 2 inbound Pith citation observations for arXiv:2602.05790.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2602.05790 v2

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T04:10:44.036518Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-30T21:25:26.862900Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-06-30T21:35:04.979211Z

Reference resolution

27 of 27 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved27
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4f62bff6-9c1a-4a4c-9cfd-ef3d41f8566d · outbound

This paper cites QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.

Price of metric universality in vector quantization is at most 0.11 bit QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.127884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.127884Z digest=sha256:eb1d53e42c7d95ff19a489cf92f6cdd2c50fd3be6117f85e51ab8cdc6c1d2a5f

Observation cc69f899-c711-44aa-a42d-9d32d6950156 · outbound

This paper cites On lov \'a sz’lattice reduction and the nearest lattice point problem.

Price of metric universality in vector quantization is at most 0.11 bit On lov \'a sz’lattice reduction and the nearest lattice point problem

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.196324Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.196324Z digest=sha256:cff9bd0d03d93a71555f13d109bf807630bb7615c041477562d63a3094031f0e

Observation 06792d0b-bc54-42e0-a213-4e385e2b8dcb · outbound

This paper cites The lattice geometry of neural network quantization--a short equivalence proof of gptq and babai's algorithm.

Price of metric universality in vector quantization is at most 0.11 bit The lattice geometry of neural network quantization--a short equivalence proof of gptq and babai's algorithm

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.266860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.266860Z digest=sha256:66f85c6abc1cd79e159ba5bb2304ff4c7ad67eaa6623c2f3d35dc6480653da3a

Observation 8c89d8ff-1c88-4b27-97c0-0a3ecb0a2edd · outbound

This paper cites Half-quadratic quantization of large machine learning models, November 2023.

Price of metric universality in vector quantization is at most 0.11 bit Half-quadratic quantization of large machine learning models, November 2023

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.344664Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.344664Z digest=sha256:552b50a4e1cce55b2b7762ec55efdeced24847311ffd542d1590ac7ffcbc3e08

Observation d6ae2ed5-037e-4513-95bc-ff86ef9107fc · outbound

This paper cites QuIP: 2-Bit Quantization of Large Language Models With Guarantees.

Price of metric universality in vector quantization is at most 0.11 bit QuIP: 2-Bit Quantization of Large Language Models With Guarantees

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.398130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.398130Z digest=sha256:9a15c9cd08127a5001a79f836db44972d81abd5cf6466ed7a6fe08eccfdd74d4

Observation 4317878c-912d-4b9d-b2e4-968fbb2cf9a4 · outbound

This paper cites WUSH: Near-Optimal Adaptive Transforms for LLM Quantization.

Price of metric universality in vector quantization is at most 0.11 bit WUSH: Near-Optimal Adaptive Transforms for LLM Quantization

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.504220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.504220Z digest=sha256:ba1d1b194fe9e06395dbae69db3a8909e268afae0a6c14675cc571aae2c07f87

Observation 2d23c87a-600e-46ed-ac05-d6ecd780caa3 · outbound

This paper cites Fast quantizing and decoding and algorithms for lattice quantizers and codes.

Price of metric universality in vector quantization is at most 0.11 bit Fast quantizing and decoding and algorithms for lattice quantizers and codes

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.569842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.569842Z digest=sha256:376c808703aff79349473a2a83db5921c246c998f4007811f4a9f1d23e7928a1

Observation 67efbb61-6392-414d-8ec1-1c20f0ef88a9 · outbound

This paper cites The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm.

Price of metric universality in vector quantization is at most 0.11 bit The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.611324Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.611324Z digest=sha256:34fea5d922e7e619d6ab22d45679be98d53e49d37f8e8213dc21049063694d88

Observation da6b7aef-d9af-46fc-9a1a-292484af2af4 · outbound

This paper cites an unresolved cited work.

Price of metric universality in vector quantization is at most 0.11 bit Unresolved cited work

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.736296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.736296Z digest=sha256:3b74ce21cf0a1091d4513156b90077ce38415eb55245183c244f4a52cee8743d

Observation 2cdb6287-5e61-40c7-a763-15d0633c2ac0 · outbound

This paper cites GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers.

Price of metric universality in vector quantization is at most 0.11 bit GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:41.874388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:41.874388Z digest=sha256:6aab47ac13845111d827d4c3b5cdccf1e60321a6cd6935ebaa0ec6444723a7a5

Observation 1d43ca59-0d24-420e-b0c9-76b5df9414e7 · outbound

This paper cites Vector quantization and signal compression , volume 159.

Price of metric universality in vector quantization is at most 0.11 bit Vector quantization and signal compression , volume 159

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.044382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.044382Z digest=sha256:de3c44271458039fb5232fb1aa508ce35db3090d12da79bcf1be1c395dce1d76

Observation 6cef30d5-c022-417b-964e-7b740219d768 · outbound

This paper cites SpinQuant: LLM quantization with learned rotations.

Price of metric universality in vector quantization is at most 0.11 bit SpinQuant: LLM quantization with learned rotations

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.231360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.231360Z digest=sha256:4cf256a461a9d4f72c57f51060a7c9532d7fbe0756e113d82cbd11c3a01d0aff

Observation 09f44707-de89-4d78-9f5d-d1f0911baeeb · outbound

This paper cites Wornell, and Ram Zamir.

Price of metric universality in vector quantization is at most 0.11 bit Wornell, and Ram Zamir

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.316280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.316280Z digest=sha256:93fccecd7f97d38cdb29ace6f608bcbf2d535fed183f6ec633c99d780c32478f

Observation 098f487c-44b9-4ee7-8b9e-af0ac3764e92 · outbound

This paper cites Pretraining large language models with NVFP4.

Price of metric universality in vector quantization is at most 0.11 bit Pretraining large language models with NVFP4

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.429791Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.429791Z digest=sha256:85fb84a61b3df589159fff687ceadae14f90fdfb6f5fd2ca4cd8a3fe805a758e

Observation f010f97f-c22d-48f6-bcfb-ffeb706f9b06 · outbound

This paper cites Optimal quantization for matrix multiplication.

Price of metric universality in vector quantization is at most 0.11 bit Optimal quantization for matrix multiplication

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.591052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.591052Z digest=sha256:ebfccc5ef10d03e8bff66012b10ad716886e0fd92758b5b9005913b31236f7a1

Observation 3f6d98ed-e780-4776-9349-02a0708f678c · outbound

This paper cites High-Rate Quantized Matrix Multiplication I.

Price of metric universality in vector quantization is at most 0.11 bit High-Rate Quantized Matrix Multiplication I

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.730330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.730330Z digest=sha256:fe3e091184eb4fb83e079c4c717754d42fd1a5e2a252f911887cc1fcc9adfe52

Observation 1ee16f05-d472-43aa-ac88-04a3155ff2b0 · outbound

This paper cites OCP microscaling formats ( MX ) specification.

Price of metric universality in vector quantization is at most 0.11 bit OCP microscaling formats ( MX ) specification

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.876947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.876947Z digest=sha256:895f79eff143b9c74696de4975947f7d73d115dc06217c7ed11b1feb4879c75e

Observation 04ed03de-53d9-414e-ac03-fb54dbc9ac55 · outbound

This paper cites New bounds on the density of lattice coverings.

Price of metric universality in vector quantization is at most 0.11 bit New bounds on the density of lattice coverings

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:42.987094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:42.987094Z digest=sha256:b9ae426a8f4101b31168445a47e5addb7bcede016fb80e8d6e28878e44f87ee6

Observation 6a19a0f0-a425-48e9-ba03-7f78ca65feb9 · outbound

This paper cites Incremental refinement using a gaussian test channel.

Price of metric universality in vector quantization is at most 0.11 bit Incremental refinement using a gaussian test channel

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.096631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.096631Z digest=sha256:21eccddcab590791534e5c699045c24d2c517aa77d19149e392472ea90a71157

Observation b0668cfc-4f26-4ffe-a9ff-79c10daf4dc9 · outbound

This paper cites Information theory: From coding to learning.

Price of metric universality in vector quantization is at most 0.11 bit Information theory: From coding to learning

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.201899Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.201899Z digest=sha256:2ac8715dcfb0f4d42fb2bc9faa740fe266d55d0c64382be980576255cb74a839

Observation fa87b4cd-1a48-401d-bb3a-6b47d236c780 · outbound

This paper cites NestQuant: Nested Lattice Quantization for Matrix Products and LLMs.

Price of metric universality in vector quantization is at most 0.11 bit NestQuant: Nested Lattice Quantization for Matrix Products and LLMs

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.267220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.267220Z digest=sha256:06d078a71c3a95d567a4061db3f24653e85d94de78adcbc65a7fde604c5f891e

Observation 29b21c0b-812c-4736-98e7-520c6166b220 · outbound

This paper cites QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks.

Price of metric universality in vector quantization is at most 0.11 bit QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.337679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.337679Z digest=sha256:5b38c921e5338a3a34932f14fa44067898f3dac9a3e36435f3fce8e911c4ba44

Observation 72c6a244-9d6b-45b1-8a0c-2af1019fca79 · outbound

This paper cites QTIP: Quantization with Trellises and Incoherence Processing.

Price of metric universality in vector quantization is at most 0.11 bit QTIP: Quantization with Trellises and Incoherence Processing

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.426592Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.426592Z digest=sha256:3e59f954d05db0b61412e27ea93b9497f2319bfb3a691d189242d1d3e5b231dd

Observation a4a88437-d021-4df4-89be-964fb58da721 · outbound

This paper cites Model-Preserving Adaptive Rounding.

Price of metric universality in vector quantization is at most 0.11 bit Model-Preserving Adaptive Rounding

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.570058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.570058Z digest=sha256:fd2b0052598b337d40c4d1539085ac81e05e843c33ad91c82c133c22f233a33e

Observation f743ca3e-6e8a-4d90-ae6c-ef47fbb62a9e · outbound

This paper cites SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models.

Price of metric universality in vector quantization is at most 0.11 bit SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.720124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.720124Z digest=sha256:fe2a44e47c3bea0e9376ffdc5811937e8d923c173d1efb86eae6a41a4b72ce24

Observation cb41887f-70fd-498e-8b76-140fc4add164 · outbound

This paper cites The rate loss in the wyner-ziv problem.

Price of metric universality in vector quantization is at most 0.11 bit The rate loss in the wyner-ziv problem

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:43.860364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:43.860364Z digest=sha256:50279bd85ccf38752563f8455958099514aa8a8c7afaa3ffb1aadf1a3f129770

Observation 2e3a646c-f632-41ea-8b03-9b4814c72eaf · outbound

This paper cites Multiterminal source coding with high resolution.

Price of metric universality in vector quantization is at most 0.11 bit Multiterminal source coding with high resolution

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-03T04:10:44.036518Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T04:10:44.036518Z digest=sha256:41a03a64c46195bf9a6c67ee0b844fcaff1045911587a90a0d3b07bab0fd4d90

Pith citing papers

Observation 534b9087-c437-449c-8103-64f9796ebae1 · inbound

High-Rate Quantized Matrix Multiplication II cites this paper.

High-Rate Quantized Matrix Multiplication II Price of metric universality in vector quantization is at most 0.11 bit

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-06-19T17:09:51.143232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-14T19:29:22.250363Z digest=sha256:28f2905240c84ece16a89b9681deeec5ee03324425b683412f3387a0b5c9d7d9

Observation 626bde3c-2e81-4a0f-b0f0-e2fe2df91142 · inbound

High-Rate Quantized Matrix Multiplication II cites this paper.

High-Rate Quantized Matrix Multiplication II Price of metric universality in vector quantization is at most 0.11 bit

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-06-30T21:35:04.980874Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-06-30T21:25:26.862900Z digest=sha256:68b672fbaed9f8d6b824b61237627337c4a7343ac0f9f4fe96f0521cf3aced71