{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FPVBV7C4WAJP36SHBCVYMVSSIK","short_pith_number":"pith:FPVBV7C4","schema_version":"1.0","canonical_sha256":"2bea1afc5cb012fdfa4708ab86565242ab40bfb190845258be69836a9122a356","source":{"kind":"arxiv","id":"2206.07527","version":3},"attestation_state":"computed","paper":{"title":"QONNX: Representing Arbitrary-Precision Quantized Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Pappalardo, Ben Hawks, Hendrik Borras, Javier Duarte, Jovan Mitrevski, Jules Muhizi, Matthew Trahms, Michaela Blott, Nhan Tran, Scott Hauck, Shih-Chieh Hsu, Sioni Summers, Vladimir Loncar, Yaman Umuroglu","submitted_at":"2022-06-15T13:18:00Z","abstract_excerpt":"We present extensions to the Open Neural Network Exchange (ONNX) intermediate representation format to represent arbitrary-precision quantized neural networks. We first introduce support for low precision quantization in existing ONNX-based quantization formats by leveraging integer clipping, resulting in two new backward-compatible variants: the quantized operator format with clipping and quantize-clip-dequantize (QCDQ) format. We then introduce a novel higher-level ONNX format called quantized ONNX (QONNX) that introduces three new operators -- Quant, BipolarQuant, and Trunc -- in order to r"},"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":"2206.07527","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-15T13:18:00Z","cross_cats_sorted":["cs.AR","cs.PL","stat.ML"],"title_canon_sha256":"f14eaa06dad60b89b35ac3996928d6dddc181ecfc5d00fc6d9c0f515c91feac6","abstract_canon_sha256":"0b1d171bfdf45047f5e37828ba7885e6ecec22ff654ec02b4d946b4235bbe4a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:29.857155Z","signature_b64":"tU82TWVRr8aZrfrJDeAHPKfnO7Uel5BxzOS+Ci/C/Q+eJzoyUq7d2PJjZwGa2smBPm9FD8rRKaMBiVJqo/kCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bea1afc5cb012fdfa4708ab86565242ab40bfb190845258be69836a9122a356","last_reissued_at":"2026-07-05T04:34:29.856662Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:29.856662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QONNX: Representing Arbitrary-Precision Quantized Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Pappalardo, Ben Hawks, Hendrik Borras, Javier Duarte, Jovan Mitrevski, Jules Muhizi, Matthew Trahms, Michaela Blott, Nhan Tran, Scott Hauck, Shih-Chieh Hsu, Sioni Summers, Vladimir Loncar, Yaman Umuroglu","submitted_at":"2022-06-15T13:18:00Z","abstract_excerpt":"We present extensions to the Open Neural Network Exchange (ONNX) intermediate representation format to represent arbitrary-precision quantized neural networks. We first introduce support for low precision quantization in existing ONNX-based quantization formats by leveraging integer clipping, resulting in two new backward-compatible variants: the quantized operator format with clipping and quantize-clip-dequantize (QCDQ) format. We then introduce a novel higher-level ONNX format called quantized ONNX (QONNX) that introduces three new operators -- Quant, BipolarQuant, and Trunc -- in order to r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07527","kind":"arxiv","version":3},"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/2206.07527/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":"2206.07527","created_at":"2026-07-05T04:34:29.856724+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07527v3","created_at":"2026-07-05T04:34:29.856724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07527","created_at":"2026-07-05T04:34:29.856724+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPVBV7C4WAJP","created_at":"2026-07-05T04:34:29.856724+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPVBV7C4WAJP36SH","created_at":"2026-07-05T04:34:29.856724+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPVBV7C4","created_at":"2026-07-05T04:34:29.856724+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07286","citing_title":"CADENCE: Context-Adaptive Depth Estimation for Navigation and Computational Efficiency","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK","json":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK.json","graph_json":"https://pith.science/api/pith-number/FPVBV7C4WAJP36SHBCVYMVSSIK/graph.json","events_json":"https://pith.science/api/pith-number/FPVBV7C4WAJP36SHBCVYMVSSIK/events.json","paper":"https://pith.science/paper/FPVBV7C4"},"agent_actions":{"view_html":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK","download_json":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK.json","view_paper":"https://pith.science/paper/FPVBV7C4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07527&json=true","fetch_graph":"https://pith.science/api/pith-number/FPVBV7C4WAJP36SHBCVYMVSSIK/graph.json","fetch_events":"https://pith.science/api/pith-number/FPVBV7C4WAJP36SHBCVYMVSSIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK/action/storage_attestation","attest_author":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK/action/author_attestation","sign_citation":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK/action/citation_signature","submit_replication":"https://pith.science/pith/FPVBV7C4WAJP36SHBCVYMVSSIK/action/replication_record"}},"created_at":"2026-07-05T04:34:29.856724+00:00","updated_at":"2026-07-05T04:34:29.856724+00:00"}