{"as_of":"2026-08-15T21:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f36d136682b7862d0e96988d2d4517d85314d84ff1eda6e2b752f8105297c44c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:37:51.893158Z","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-08-06T19:51:09.709482Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.06965","last_updated":"2023-06-14T17:38:09Z","snapshot_observed_at":"2026-08-13T11:19:08.921519Z","submitted_at":"2023-06-12T08:52:14Z","title":"NF4 Isn't Information Theoretically Optimal (and that's Good)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.06965","snapshot_observed_at":"2026-08-12T12:07:30.266478Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17525","last_updated":"2024-11-26T15:35:44Z","snapshot_observed_at":"2026-08-15T19:17:17.234176Z","submitted_at":"2024-11-26T15:35:44Z","title":"Pushing the Limits of Large Language Model Quantization via the Linearity Theorem","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T12:07:30.266478Z"},"links":{"cited_paper":"/paper/2306.06965","citing_paper":"/paper/2411.17525"},"observation_digest":"sha256:15924ee156b1ab01c8043053f9241a072130c26d381b37e35643795cfe0b6d33","observation_id":"12283b9e-4a4e-4c96-8559-9caae4e85edd","resolution":{"observed_at":"2026-08-12T12:07:30.266478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06965","last_updated":"2023-06-14T17:38:09Z","snapshot_observed_at":"2026-08-13T11:19:08.921519Z","submitted_at":"2023-06-12T08:52:14Z","title":"NF4 Isn't Information Theoretically Optimal (and that's Good)","version":2},"cited_work":{"arxiv_id":"2306.06965","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.06965","snapshot_observed_at":"2026-08-06T19:51:09.709482Z","title":"NF4 Isn't Information Theoretically Optimal (and that's Good)","venue":"cs.LG","work_id":"0d7fd965-a550-4c45-9ab7-6728231485d6","year":2023},"citing_paper":{"arxiv_id":"2507.04610","last_updated":"2025-07-07T01:59:47Z","snapshot_observed_at":"2026-08-10T21:34:40.509076Z","submitted_at":"2025-07-07T01:59:47Z","title":"any4: Learned 4-bit Numeric Representation for LLMs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T19:51:09.539923Z"},"links":{"cited_paper":"/paper/2306.06965","citing_paper":"/paper/2507.04610"},"observation_digest":"sha256:87698051db1365006f5f755647aab6d1fedd661e7a5723a92e6d929fadc46017","observation_id":"425cb4e0-d38a-46f6-bd53-a8b6163f938a","resolution":{"observed_at":"2026-08-06T19:51:09.715540Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06965","last_updated":"2023-06-14T17:38:09Z","snapshot_observed_at":"2026-08-13T11:19:08.921519Z","submitted_at":"2023-06-12T08:52:14Z","title":"NF4 Isn't Information Theoretically Optimal (and that's Good)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.06965","snapshot_observed_at":"2026-08-15T14:37:51.893158Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06763","last_updated":"2026-08-07T03:36:07Z","snapshot_observed_at":"2026-08-15T14:27:58.688235Z","submitted_at":"2026-08-07T03:36:07Z","title":"CubicQuant: Parametric Non-Uniform Codebooks for High-Throughput LLM Inference with 1-8-Bit Weights","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T14:37:51.893158Z"},"links":{"cited_paper":"/paper/2306.06965","citing_paper":"/paper/2608.06763"},"observation_digest":"sha256:3ce2bafb031ea090610c88754041e7376a474df67a2a8f7dcd06725d1a805725","observation_id":"7798a314-f5f4-4792-b3e9-94eb94066060","resolution":{"observed_at":"2026-08-15T14:37:51.893158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2306.06965/citation-record","integrity":"/paper/2306.06965/integrity","json":"/paper/2306.06965/citation-record.json","paper":"/paper/2306.06965"},"outbound":[],"paper":{"arxiv_id":"2306.06965","last_updated":"2023-06-14T17:38:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T11:19:08.921519Z","submitted_at":"2023-06-12T08:52:14Z","title":"NF4 Isn't Information Theoretically Optimal (and that's Good)"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2306.06965."}