{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GALFZWE6OQZBJWKRARTA2JXAA7","short_pith_number":"pith:GALFZWE6","schema_version":"1.0","canonical_sha256":"30165cd89e743214d95104660d26e007c36f3b5289f4eed3896438a62bf6de45","source":{"kind":"arxiv","id":"2507.02654","version":2},"attestation_state":"computed","paper":{"title":"Breaking the HBM Bit Cost Barrier: Domain-Specific ECC for AI Inference Infrastructure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Asad Ul Haq, Linsen Ma, Liu Liu, Rui Xie, Sanchari Sen, Swagath Venkataramani, Tong Zhang, Yunhua Fang","submitted_at":"2025-07-03T14:18:41Z","abstract_excerpt":"High-Bandwidth Memory (HBM) delivers exceptional bandwidth and energy efficiency for AI workloads, but its high cost per bit, driven in part by stringent on-die reliability requirements, poses a growing barrier to scalable deployment. This work explores a system-level approach to cost reduction by eliminating on-die ECC and shifting all fault management to the memory controller. We introduce a domain-specific ECC framework combining large-codeword Reed--Solomon~(RS) correction with lightweight fine-grained CRC detection, differential parity updates to mitigate write amplification, and tunable "},"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":"2507.02654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-07-03T14:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"c039e8ce64e95884d0e85312f5bab846c896ed4c02f9c1cdd91ca17cd88c810b","abstract_canon_sha256":"17f1e8eafba7bbbcdd2b793f9ea7e1df765a6a87946773375ae604a5c3014d6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:16.181949Z","signature_b64":"lBdR5AyeNp4W9xbEh3btE4gfVzjssPKQNRcYJ/F+/6ErY1+GAAaUkf8p3v2GOJ0dxRCkCn7dyz72EQrEmBTdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30165cd89e743214d95104660d26e007c36f3b5289f4eed3896438a62bf6de45","last_reissued_at":"2026-07-05T12:04:16.181436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:16.181436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the HBM Bit Cost Barrier: Domain-Specific ECC for AI Inference Infrastructure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Asad Ul Haq, Linsen Ma, Liu Liu, Rui Xie, Sanchari Sen, Swagath Venkataramani, Tong Zhang, Yunhua Fang","submitted_at":"2025-07-03T14:18:41Z","abstract_excerpt":"High-Bandwidth Memory (HBM) delivers exceptional bandwidth and energy efficiency for AI workloads, but its high cost per bit, driven in part by stringent on-die reliability requirements, poses a growing barrier to scalable deployment. This work explores a system-level approach to cost reduction by eliminating on-die ECC and shifting all fault management to the memory controller. We introduce a domain-specific ECC framework combining large-codeword Reed--Solomon~(RS) correction with lightweight fine-grained CRC detection, differential parity updates to mitigate write amplification, and tunable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02654","kind":"arxiv","version":2},"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/2507.02654/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":"2507.02654","created_at":"2026-07-05T12:04:16.181499+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.02654v2","created_at":"2026-07-05T12:04:16.181499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02654","created_at":"2026-07-05T12:04:16.181499+00:00"},{"alias_kind":"pith_short_12","alias_value":"GALFZWE6OQZB","created_at":"2026-07-05T12:04:16.181499+00:00"},{"alias_kind":"pith_short_16","alias_value":"GALFZWE6OQZBJWKR","created_at":"2026-07-05T12:04:16.181499+00:00"},{"alias_kind":"pith_short_8","alias_value":"GALFZWE6","created_at":"2026-07-05T12:04:16.181499+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.19623","citing_title":"From Bit-Position Sensitivity to Unequal Error Protection for DNN Inference Memory","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7","json":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7.json","graph_json":"https://pith.science/api/pith-number/GALFZWE6OQZBJWKRARTA2JXAA7/graph.json","events_json":"https://pith.science/api/pith-number/GALFZWE6OQZBJWKRARTA2JXAA7/events.json","paper":"https://pith.science/paper/GALFZWE6"},"agent_actions":{"view_html":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7","download_json":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7.json","view_paper":"https://pith.science/paper/GALFZWE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.02654&json=true","fetch_graph":"https://pith.science/api/pith-number/GALFZWE6OQZBJWKRARTA2JXAA7/graph.json","fetch_events":"https://pith.science/api/pith-number/GALFZWE6OQZBJWKRARTA2JXAA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7/action/storage_attestation","attest_author":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7/action/author_attestation","sign_citation":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7/action/citation_signature","submit_replication":"https://pith.science/pith/GALFZWE6OQZBJWKRARTA2JXAA7/action/replication_record"}},"created_at":"2026-07-05T12:04:16.181499+00:00","updated_at":"2026-07-05T12:04:16.181499+00:00"}