{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RFTDFHOTVU5Q66AH3JKOI2ZCX4","short_pith_number":"pith:RFTDFHOT","schema_version":"1.0","canonical_sha256":"8966329dd3ad3b0f7807da54e46b22bf35889c6b3ce81f74646f79c9e03c2bc8","source":{"kind":"arxiv","id":"2606.09965","version":1},"attestation_state":"computed","paper":{"title":"A Generic Modulo-$(2^n\\pm\\delta)$ RNS Multiplier Based on Twit Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Amirhossein Sadr, Behzad Salami, Dara Rahmati, Saeid Gorgin","submitted_at":"2026-06-08T16:13:44Z","abstract_excerpt":"Modular multiplication is a fundamental arithmetic primitive in Residue Number Systems (RNS) and is often the dominant source of delay, area, and energy consumption in RNS datapaths used in cryptography, signal processing, and machine-learning accelerators. Recent work introduced a twit-based residue representation for moduli of the form $2^n \\pm \\delta$, with $0 \\le \\delta \\le 2^{n-1}-1$, and showed that it enables efficient generic modular addition and subtraction across the full admissible $\\delta$ range. However, an efficient modular multiplier compatible with the same representation has 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":"2606.09965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2026-06-08T16:13:44Z","cross_cats_sorted":[],"title_canon_sha256":"2a5a623cb176b53c3764ffd46394ed801cc17d6de4cd7d75410d2012c0bcf5b4","abstract_canon_sha256":"3a2155d654a98fa26853d1d9f5f5a9ebc38d92c3341d3f515ff25f09828e0f22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T00:08:35.374425Z","signature_b64":"mZutMTjiEEaIdKVYRJU0+bsgkEeFlIxqzt2Suue0hDvbE9JLm5iX41+J3DmGzEuMBH5gguXy1XtZWMRbM4iEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8966329dd3ad3b0f7807da54e46b22bf35889c6b3ce81f74646f79c9e03c2bc8","last_reissued_at":"2026-06-10T00:08:35.373555Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T00:08:35.373555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generic Modulo-$(2^n\\pm\\delta)$ RNS Multiplier Based on Twit Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Amirhossein Sadr, Behzad Salami, Dara Rahmati, Saeid Gorgin","submitted_at":"2026-06-08T16:13:44Z","abstract_excerpt":"Modular multiplication is a fundamental arithmetic primitive in Residue Number Systems (RNS) and is often the dominant source of delay, area, and energy consumption in RNS datapaths used in cryptography, signal processing, and machine-learning accelerators. Recent work introduced a twit-based residue representation for moduli of the form $2^n \\pm \\delta$, with $0 \\le \\delta \\le 2^{n-1}-1$, and showed that it enables efficient generic modular addition and subtraction across the full admissible $\\delta$ range. However, an efficient modular multiplier compatible with the same representation has r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09965","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/2606.09965/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":"2606.09965","created_at":"2026-06-10T00:08:35.373733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.09965v1","created_at":"2026-06-10T00:08:35.373733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09965","created_at":"2026-06-10T00:08:35.373733+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFTDFHOTVU5Q","created_at":"2026-06-10T00:08:35.373733+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFTDFHOTVU5Q66AH","created_at":"2026-06-10T00:08:35.373733+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFTDFHOT","created_at":"2026-06-10T00:08:35.373733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4","json":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4.json","graph_json":"https://pith.science/api/pith-number/RFTDFHOTVU5Q66AH3JKOI2ZCX4/graph.json","events_json":"https://pith.science/api/pith-number/RFTDFHOTVU5Q66AH3JKOI2ZCX4/events.json","paper":"https://pith.science/paper/RFTDFHOT"},"agent_actions":{"view_html":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4","download_json":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4.json","view_paper":"https://pith.science/paper/RFTDFHOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.09965&json=true","fetch_graph":"https://pith.science/api/pith-number/RFTDFHOTVU5Q66AH3JKOI2ZCX4/graph.json","fetch_events":"https://pith.science/api/pith-number/RFTDFHOTVU5Q66AH3JKOI2ZCX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4/action/storage_attestation","attest_author":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4/action/author_attestation","sign_citation":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4/action/citation_signature","submit_replication":"https://pith.science/pith/RFTDFHOTVU5Q66AH3JKOI2ZCX4/action/replication_record"}},"created_at":"2026-06-10T00:08:35.373733+00:00","updated_at":"2026-06-10T00:08:35.373733+00:00"}