{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L6UUG3GVNK2AC6VWVLEEWL67OA","short_pith_number":"pith:L6UUG3GV","schema_version":"1.0","canonical_sha256":"5fa9436cd56ab4017ab6aac84b2fdf70085310827496d14fc3cdd4348f54c4e0","source":{"kind":"arxiv","id":"2606.01412","version":1},"attestation_state":"computed","paper":{"title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Rayan Saab, Shihao Zhang","submitted_at":"2026-05-31T19:17:39Z","abstract_excerpt":"Post-training quantization is widely used for compressing large neural networks, but aggressive low-bit quantization can significantly degrade model quality. A common remedy is to augment the quantized weights with a low-rank correction, leading to approximations of the form $W\\approx Q+LR$. In this paper, we study this low-precision plus low-rank representation through the layer-wise reconstruction objective $\\|XW-X(Q+LR)\\|_F^2$, where $X$ is a calibration matrix. We establish, to our knowledge, the first information-theoretic lower bounds for this problem under finite-alphabet and bounded lo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.01412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T19:17:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2fe2e709157d90f2d2ba3c99bd4ea1fc9d5e683495dfea3431d7d05d8b8657d1","abstract_canon_sha256":"db30dc812a1185cbc2c9dfa4ac08d6f41a45314a806d58534f2b58d407b72729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:32.639212Z","signature_b64":"FRMdbS9rJ6Ac4Et7jDiMD0s+BYp4ep5pBDAM92NVspo5WEDvHU8ur6CNzBZ4/Ibodw/dZBqT0+uOcqRy0bcRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fa9436cd56ab4017ab6aac84b2fdf70085310827496d14fc3cdd4348f54c4e0","last_reissued_at":"2026-06-02T02:04:32.638861Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:32.638861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Rayan Saab, Shihao Zhang","submitted_at":"2026-05-31T19:17:39Z","abstract_excerpt":"Post-training quantization is widely used for compressing large neural networks, but aggressive low-bit quantization can significantly degrade model quality. A common remedy is to augment the quantized weights with a low-rank correction, leading to approximations of the form $W\\approx Q+LR$. In this paper, we study this low-precision plus low-rank representation through the layer-wise reconstruction objective $\\|XW-X(Q+LR)\\|_F^2$, where $X$ is a calibration matrix. We establish, to our knowledge, the first information-theoretic lower bounds for this problem under finite-alphabet and bounded lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01412","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01412/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.01412","created_at":"2026-06-02T02:04:32.638922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01412v1","created_at":"2026-06-02T02:04:32.638922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01412","created_at":"2026-06-02T02:04:32.638922+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6UUG3GVNK2A","created_at":"2026-06-02T02:04:32.638922+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6UUG3GVNK2AC6VW","created_at":"2026-06-02T02:04:32.638922+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6UUG3GV","created_at":"2026-06-02T02:04:32.638922+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA","json":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA.json","graph_json":"https://pith.science/api/pith-number/L6UUG3GVNK2AC6VWVLEEWL67OA/graph.json","events_json":"https://pith.science/api/pith-number/L6UUG3GVNK2AC6VWVLEEWL67OA/events.json","paper":"https://pith.science/paper/L6UUG3GV"},"agent_actions":{"view_html":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA","download_json":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA.json","view_paper":"https://pith.science/paper/L6UUG3GV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01412&json=true","fetch_graph":"https://pith.science/api/pith-number/L6UUG3GVNK2AC6VWVLEEWL67OA/graph.json","fetch_events":"https://pith.science/api/pith-number/L6UUG3GVNK2AC6VWVLEEWL67OA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA/action/storage_attestation","attest_author":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA/action/author_attestation","sign_citation":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA/action/citation_signature","submit_replication":"https://pith.science/pith/L6UUG3GVNK2AC6VWVLEEWL67OA/action/replication_record"}},"created_at":"2026-06-02T02:04:32.638922+00:00","updated_at":"2026-06-02T02:04:32.638922+00:00"}