{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BG4OWGUSLMB3YZ3U2H5NHPOAZR","short_pith_number":"pith:BG4OWGUS","schema_version":"1.0","canonical_sha256":"09b8eb1a925b03bc6774d1fad3bdc0cc7f8cbda1798ad348744cf22340b543e3","source":{"kind":"arxiv","id":"2403.05465","version":2},"attestation_state":"computed","paper":{"title":"Algorithm-Hardware Co-Design of Distribution-Aware Logarithmic-Posit Encodings for Efficient DNN Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.AR","authors_text":"Akshat Ramachandran, Geonhwa Jeong, John Gustafson, Tushar Krishna, Zishen Wan","submitted_at":"2024-03-08T17:28:49Z","abstract_excerpt":"Traditional Deep Neural Network (DNN) quantization methods using integer, fixed-point, or floating-point data types struggle to capture diverse DNN parameter distributions at low precision, and often require large silicon overhead and intensive quantization-aware training. In this study, we introduce Logarithmic Posits (LP), an adaptive, hardware-friendly data type inspired by posits that dynamically adapts to DNN weight/activation distributions by parameterizing LP bit fields. We also develop a novel genetic-algorithm based framework, LP Quantization (LPQ), to find optimal layer-wise LP param"},"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":"2403.05465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-03-08T17:28:49Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"0eb13eb7821d358a1c449efb3d96499e70cc5b77b797712496131fd5e3a305a4","abstract_canon_sha256":"fcf7b2b2de6cc9d10d4ba6376363e32dcee2f41d2296005473b75f53f3713a2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:01.956912Z","signature_b64":"fPLVvACMQ99PZr8EBPdmk2bvidc+RPSLKQiN6rtAidGQMT5ykKYo/kOB3eG2Q2iAeU3hxxFjDciQXwH4fCp0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09b8eb1a925b03bc6774d1fad3bdc0cc7f8cbda1798ad348744cf22340b543e3","last_reissued_at":"2026-07-05T08:01:01.956439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:01.956439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm-Hardware Co-Design of Distribution-Aware Logarithmic-Posit Encodings for Efficient DNN Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.AR","authors_text":"Akshat Ramachandran, Geonhwa Jeong, John Gustafson, Tushar Krishna, Zishen Wan","submitted_at":"2024-03-08T17:28:49Z","abstract_excerpt":"Traditional Deep Neural Network (DNN) quantization methods using integer, fixed-point, or floating-point data types struggle to capture diverse DNN parameter distributions at low precision, and often require large silicon overhead and intensive quantization-aware training. In this study, we introduce Logarithmic Posits (LP), an adaptive, hardware-friendly data type inspired by posits that dynamically adapts to DNN weight/activation distributions by parameterizing LP bit fields. We also develop a novel genetic-algorithm based framework, LP Quantization (LPQ), to find optimal layer-wise LP param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05465","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/2403.05465/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":"2403.05465","created_at":"2026-07-05T08:01:01.956498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05465v2","created_at":"2026-07-05T08:01:01.956498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05465","created_at":"2026-07-05T08:01:01.956498+00:00"},{"alias_kind":"pith_short_12","alias_value":"BG4OWGUSLMB3","created_at":"2026-07-05T08:01:01.956498+00:00"},{"alias_kind":"pith_short_16","alias_value":"BG4OWGUSLMB3YZ3U","created_at":"2026-07-05T08:01:01.956498+00:00"},{"alias_kind":"pith_short_8","alias_value":"BG4OWGUS","created_at":"2026-07-05T08:01:01.956498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09954","citing_title":"AIRCHITECT v2: Learning the Hardware Accelerator Design Space through Unified Representations","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR","json":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR.json","graph_json":"https://pith.science/api/pith-number/BG4OWGUSLMB3YZ3U2H5NHPOAZR/graph.json","events_json":"https://pith.science/api/pith-number/BG4OWGUSLMB3YZ3U2H5NHPOAZR/events.json","paper":"https://pith.science/paper/BG4OWGUS"},"agent_actions":{"view_html":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR","download_json":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR.json","view_paper":"https://pith.science/paper/BG4OWGUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05465&json=true","fetch_graph":"https://pith.science/api/pith-number/BG4OWGUSLMB3YZ3U2H5NHPOAZR/graph.json","fetch_events":"https://pith.science/api/pith-number/BG4OWGUSLMB3YZ3U2H5NHPOAZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR/action/storage_attestation","attest_author":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR/action/author_attestation","sign_citation":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR/action/citation_signature","submit_replication":"https://pith.science/pith/BG4OWGUSLMB3YZ3U2H5NHPOAZR/action/replication_record"}},"created_at":"2026-07-05T08:01:01.956498+00:00","updated_at":"2026-07-05T08:01:01.956498+00:00"}