{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HJY7O7SWX7O6C3KQECZNN52JPW","short_pith_number":"pith:HJY7O7SW","schema_version":"1.0","canonical_sha256":"3a71f77e56bfdde16d5020b2d6f7497d934193aedb3a9d0d6f229fa586450b8a","source":{"kind":"arxiv","id":"2412.16700","version":1},"attestation_state":"computed","paper":{"title":"TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haocheng Huang, Jiaxin Chen, Jinyang Guo, Ruiyi Zhan, Yunhong Wang","submitted_at":"2024-12-21T16:57:54Z","abstract_excerpt":"Diffusion models have achieved remarkable success in the image and video generation tasks. Nevertheless, they often require a large amount of memory and time overhead during inference, due to the complex network architecture and considerable number of timesteps for iterative diffusion. Recently, the post-training quantization (PTQ) technique has proved a promising way to reduce the inference cost by quantizing the float-point operations to low-bit ones. However, most of them fail to tackle with the large variations in the distribution of activations across distinct channels and timesteps, as w"},"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":"2412.16700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-21T16:57:54Z","cross_cats_sorted":[],"title_canon_sha256":"275f8536814ca85bf3ce62e3963a3ed2822a8a1025ffd578c995505cf580df8e","abstract_canon_sha256":"9c93b5c2f78e03359748e9dd3edf17117983984df7e9aa01b19a78bf8f06fc3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:11.644823Z","signature_b64":"07POt9nFLBFfHK5qoxEbldZ3QjjwxOdXy4/rvrHj3JrAKcUQwGQ6VcbWHzyZts9eBvmKo/uXxjM6MN+387wIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a71f77e56bfdde16d5020b2d6f7497d934193aedb3a9d0d6f229fa586450b8a","last_reissued_at":"2026-07-05T09:53:11.644294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:11.644294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haocheng Huang, Jiaxin Chen, Jinyang Guo, Ruiyi Zhan, Yunhong Wang","submitted_at":"2024-12-21T16:57:54Z","abstract_excerpt":"Diffusion models have achieved remarkable success in the image and video generation tasks. Nevertheless, they often require a large amount of memory and time overhead during inference, due to the complex network architecture and considerable number of timesteps for iterative diffusion. Recently, the post-training quantization (PTQ) technique has proved a promising way to reduce the inference cost by quantizing the float-point operations to low-bit ones. However, most of them fail to tackle with the large variations in the distribution of activations across distinct channels and timesteps, as w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16700","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/2412.16700/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":"2412.16700","created_at":"2026-07-05T09:53:11.644355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16700v1","created_at":"2026-07-05T09:53:11.644355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16700","created_at":"2026-07-05T09:53:11.644355+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJY7O7SWX7O6","created_at":"2026-07-05T09:53:11.644355+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJY7O7SWX7O6C3KQ","created_at":"2026-07-05T09:53:11.644355+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJY7O7SW","created_at":"2026-07-05T09:53:11.644355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18117","citing_title":"LoRaQ: Optimized Low Rank Approximation for 4-bit Quantization","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW","json":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW.json","graph_json":"https://pith.science/api/pith-number/HJY7O7SWX7O6C3KQECZNN52JPW/graph.json","events_json":"https://pith.science/api/pith-number/HJY7O7SWX7O6C3KQECZNN52JPW/events.json","paper":"https://pith.science/paper/HJY7O7SW"},"agent_actions":{"view_html":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW","download_json":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW.json","view_paper":"https://pith.science/paper/HJY7O7SW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16700&json=true","fetch_graph":"https://pith.science/api/pith-number/HJY7O7SWX7O6C3KQECZNN52JPW/graph.json","fetch_events":"https://pith.science/api/pith-number/HJY7O7SWX7O6C3KQECZNN52JPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW/action/storage_attestation","attest_author":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW/action/author_attestation","sign_citation":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW/action/citation_signature","submit_replication":"https://pith.science/pith/HJY7O7SWX7O6C3KQECZNN52JPW/action/replication_record"}},"created_at":"2026-07-05T09:53:11.644355+00:00","updated_at":"2026-07-05T09:53:11.644355+00:00"}