{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GEPQSRBUKIX2UABVQ3DSEJCDNQ","short_pith_number":"pith:GEPQSRBU","schema_version":"1.0","canonical_sha256":"311f094434522faa003586c72224436c20df12a261ddea9606a6f7c4ec735791","source":{"kind":"arxiv","id":"2607.27042","version":1},"attestation_state":"computed","paper":{"title":"GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Dan Alistarh, Jiale Chen, Torsten Hoefler","submitted_at":"2026-07-29T15:34:00Z","abstract_excerpt":"Adaptive rounding methods such as GPTQ, or equivalently Babai's nearest plane algorithm, round a real matrix to integers under a quadratic metric. They process the entries in a fixed order, one at a time, propagating each rounding error to the entries not yet processed through a triangular feedback matrix. We study the two-sided version of this task, in which fixed nonsingular basis matrices act on both the left and the right of the residual; the familiar one-sided case is the special case of an identity right basis. Vectorizing the matrix turns the two-sided objective into a quadratic metric "},"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":"2607.27042","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T15:34:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"547fa7bae4cf21f3391a845b1cdb5a7d840a1eb9d50fddcd3d8141bbc531b9ae","abstract_canon_sha256":"da8e8ec02f0b59d2f0be0e887a0ab4f85b24b82f52c286285c1b97f428b5ef19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311f094434522faa003586c72224436c20df12a261ddea9606a6f7c4ec735791","last_reissued_at":"2026-07-30T01:23:25.134318Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:25.134318Z"},"graph_snapshot":{"paper":{"title":"GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Dan Alistarh, Jiale Chen, Torsten Hoefler","submitted_at":"2026-07-29T15:34:00Z","abstract_excerpt":"Adaptive rounding methods such as GPTQ, or equivalently Babai's nearest plane algorithm, round a real matrix to integers under a quadratic metric. They process the entries in a fixed order, one at a time, propagating each rounding error to the entries not yet processed through a triangular feedback matrix. We study the two-sided version of this task, in which fixed nonsingular basis matrices act on both the left and the right of the residual; the familiar one-sided case is the special case of an identity right basis. Vectorizing the matrix turns the two-sided objective into a quadratic metric "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27042","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/2607.27042/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":"2607.27042","created_at":"2026-07-30T01:23:25.139375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27042v1","created_at":"2026-07-30T01:23:25.139375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27042","created_at":"2026-07-30T01:23:25.139375+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEPQSRBUKIX2","created_at":"2026-07-30T01:23:25.139375+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEPQSRBUKIX2UABV","created_at":"2026-07-30T01:23:25.139375+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEPQSRBU","created_at":"2026-07-30T01:23:25.139375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06291","citing_title":"BaKron: Efficient Quantization with Kronecker-Factored Hessians","ref_index":2026,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ","json":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ.json","graph_json":"https://pith.science/api/pith-number/GEPQSRBUKIX2UABVQ3DSEJCDNQ/graph.json","events_json":"https://pith.science/api/pith-number/GEPQSRBUKIX2UABVQ3DSEJCDNQ/events.json","paper":"https://pith.science/paper/GEPQSRBU"},"agent_actions":{"view_html":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ","download_json":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ.json","view_paper":"https://pith.science/paper/GEPQSRBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27042&json=true","fetch_graph":"https://pith.science/api/pith-number/GEPQSRBUKIX2UABVQ3DSEJCDNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GEPQSRBUKIX2UABVQ3DSEJCDNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ/action/storage_attestation","attest_author":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ/action/author_attestation","sign_citation":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ/action/citation_signature","submit_replication":"https://pith.science/pith/GEPQSRBUKIX2UABVQ3DSEJCDNQ/action/replication_record"}},"created_at":"2026-07-30T01:23:25.139375+00:00","updated_at":"2026-07-30T01:23:25.139375+00:00"}