{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VZJ2XVI4N2XYSLWF4L5KODS7L3","short_pith_number":"pith:VZJ2XVI4","schema_version":"1.0","canonical_sha256":"ae53abd51c6eaf892ec5e2faa70e5f5eec7ae25b643ac4c2ac051890a63e1f32","source":{"kind":"arxiv","id":"2410.00907","version":2},"attestation_state":"computed","paper":{"title":"Addition is All You Need for Energy-efficient Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hongyin Luo, Wei Sun","submitted_at":"2024-10-01T17:53:28Z","abstract_excerpt":"Large neural networks spend most computation on floating point tensor multiplications. In this work, we find that a floating point multiplier can be approximated by one integer adder with high precision. We propose the linear-complexity multiplication L-Mul algorithm that approximates floating point number multiplication with integer addition operations. The new algorithm costs significantly less computation resource than 8-bit floating point multiplication but achieves higher precision. Compared to 8-bit floating point multiplications, the proposed method achieves higher precision but consume"},"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":"2410.00907","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-01T17:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"9706027ae87eb0b76d2b5e11a266864d1509b657de1a26be4820c65e6bb6bde8","abstract_canon_sha256":"9ed9e5d70c953268a9aab6429eaf1910581c85882c32e0c1244a68bfb41319f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:40.559795Z","signature_b64":"5iBVUz8GHAeqj51RPN+28ZoQUnPLWTY5LQtwVOpY1mFJZS0YOj5wtSwHpKTtfrrH7+XfW2RapzIRy7IcQPt0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae53abd51c6eaf892ec5e2faa70e5f5eec7ae25b643ac4c2ac051890a63e1f32","last_reissued_at":"2026-07-05T09:14:40.559401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:40.559401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Addition is All You Need for Energy-efficient Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hongyin Luo, Wei Sun","submitted_at":"2024-10-01T17:53:28Z","abstract_excerpt":"Large neural networks spend most computation on floating point tensor multiplications. In this work, we find that a floating point multiplier can be approximated by one integer adder with high precision. We propose the linear-complexity multiplication L-Mul algorithm that approximates floating point number multiplication with integer addition operations. The new algorithm costs significantly less computation resource than 8-bit floating point multiplication but achieves higher precision. Compared to 8-bit floating point multiplications, the proposed method achieves higher precision but consume"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.00907","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/2410.00907/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":"2410.00907","created_at":"2026-07-05T09:14:40.559459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.00907v2","created_at":"2026-07-05T09:14:40.559459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.00907","created_at":"2026-07-05T09:14:40.559459+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZJ2XVI4N2XY","created_at":"2026-07-05T09:14:40.559459+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZJ2XVI4N2XYSLWF","created_at":"2026-07-05T09:14:40.559459+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZJ2XVI4","created_at":"2026-07-05T09:14:40.559459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17787","citing_title":"Titanus: Enabling KV Cache Pruning and Quantization On-the-Fly for LLM Acceleration","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3","json":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3.json","graph_json":"https://pith.science/api/pith-number/VZJ2XVI4N2XYSLWF4L5KODS7L3/graph.json","events_json":"https://pith.science/api/pith-number/VZJ2XVI4N2XYSLWF4L5KODS7L3/events.json","paper":"https://pith.science/paper/VZJ2XVI4"},"agent_actions":{"view_html":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3","download_json":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3.json","view_paper":"https://pith.science/paper/VZJ2XVI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.00907&json=true","fetch_graph":"https://pith.science/api/pith-number/VZJ2XVI4N2XYSLWF4L5KODS7L3/graph.json","fetch_events":"https://pith.science/api/pith-number/VZJ2XVI4N2XYSLWF4L5KODS7L3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3/action/storage_attestation","attest_author":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3/action/author_attestation","sign_citation":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3/action/citation_signature","submit_replication":"https://pith.science/pith/VZJ2XVI4N2XYSLWF4L5KODS7L3/action/replication_record"}},"created_at":"2026-07-05T09:14:40.559459+00:00","updated_at":"2026-07-05T09:14:40.559459+00:00"}