{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MG7EZWKKI2GBFH36L5LODOS3ED","short_pith_number":"pith:MG7EZWKK","canonical_record":{"source":{"id":"2309.05550","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-11T15:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"ac91eca679db91799f54c63c6178f325ac9b18860645e7a598b8daf081fe9ca1","abstract_canon_sha256":"a4275b899c77f0055143a31471755dc9edf779b410f052eb1c86ad6e59ddc181"},"schema_version":"1.0"},"canonical_sha256":"61be4cd94a468c129f7e5f56e1ba5b20f6a2b20aca8f8ae082d2ae04065df178","source":{"kind":"arxiv","id":"2309.05550","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.05550","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"2309.05550v2","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05550","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"MG7EZWKKI2GB","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"pith_short_16","alias_value":"MG7EZWKKI2GBFH36","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"pith_short_8","alias_value":"MG7EZWKK","created_at":"2026-07-05T06:49:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MG7EZWKKI2GBFH36L5LODOS3ED","target":"record","payload":{"canonical_record":{"source":{"id":"2309.05550","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-11T15:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"ac91eca679db91799f54c63c6178f325ac9b18860645e7a598b8daf081fe9ca1","abstract_canon_sha256":"a4275b899c77f0055143a31471755dc9edf779b410f052eb1c86ad6e59ddc181"},"schema_version":"1.0"},"canonical_sha256":"61be4cd94a468c129f7e5f56e1ba5b20f6a2b20aca8f8ae082d2ae04065df178","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:44.578002Z","signature_b64":"yYRnm2R6fBjvBI2sAFPn5nk4H9IMQpq2qnwnLLhOj5Riv9Siw52gqTpnBPScyA/9ravqm2hQ6HJLUqAbaItrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61be4cd94a468c129f7e5f56e1ba5b20f6a2b20aca8f8ae082d2ae04065df178","last_reissued_at":"2026-07-05T06:49:44.577559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:44.577559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.05550","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AcAyw1liA+H2pd5DfnoQeIsA+nDHib7tfeYBp8NeuS9p+8KwtGJWJ26asWFsH6c3vuWG8epVFfzgUvC+soMpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:23:40.144985Z"},"content_sha256":"c27b926333ef5e21bb90b676046f76864d0f29e3fbc2ba8119a0b9fa28891832","schema_version":"1.0","event_id":"sha256:c27b926333ef5e21bb90b676046f76864d0f29e3fbc2ba8119a0b9fa28891832"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MG7EZWKKI2GBFH36L5LODOS3ED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplierless Design of High-Speed Very Large Constant Multiplications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Debapriya Basu Roy, Levent Aksoy, Malik Imran, Samuel Pagliarini","submitted_at":"2023-09-11T15:35:02Z","abstract_excerpt":"In cryptographic algorithms, the constants to be multiplied by a variable can be very large due to security requirements. Thus, the hardware complexity of such algorithms heavily depends on the design architecture handling large constants. In this paper, we introduce an electronic design automation tool, called LEIGER, which can automatically generate the realizations of very large constant multiplications for low-complexity and high-speed applications, targeting the ASIC design platform. LEIGER can utilize the shift-adds architecture and use 3-input operations, i.e., carry-save adders (CSAs),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05550","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/2309.05550/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGVZmMjtVv9C0EEeeudupfv6XngJEhtQD9eU2Jy8MI/bIkfBxHdHdeS7LQM+mf4/7qZS/jXJcSNZY9NIdPJCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:23:40.146673Z"},"content_sha256":"64ab7e57b9a60a7e41e813e23eadb45d5de3ae0e3ab1511a78be14717aaa9a53","schema_version":"1.0","event_id":"sha256:64ab7e57b9a60a7e41e813e23eadb45d5de3ae0e3ab1511a78be14717aaa9a53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG7EZWKKI2GBFH36L5LODOS3ED/bundle.json","state_url":"https://pith.science/pith/MG7EZWKKI2GBFH36L5LODOS3ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG7EZWKKI2GBFH36L5LODOS3ED/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T22:23:40Z","links":{"resolver":"https://pith.science/pith/MG7EZWKKI2GBFH36L5LODOS3ED","bundle":"https://pith.science/pith/MG7EZWKKI2GBFH36L5LODOS3ED/bundle.json","state":"https://pith.science/pith/MG7EZWKKI2GBFH36L5LODOS3ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG7EZWKKI2GBFH36L5LODOS3ED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MG7EZWKKI2GBFH36L5LODOS3ED","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a4275b899c77f0055143a31471755dc9edf779b410f052eb1c86ad6e59ddc181","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-11T15:35:02Z","title_canon_sha256":"ac91eca679db91799f54c63c6178f325ac9b18860645e7a598b8daf081fe9ca1"},"schema_version":"1.0","source":{"id":"2309.05550","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.05550","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"2309.05550v2","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05550","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"MG7EZWKKI2GB","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"pith_short_16","alias_value":"MG7EZWKKI2GBFH36","created_at":"2026-07-05T06:49:44Z"},{"alias_kind":"pith_short_8","alias_value":"MG7EZWKK","created_at":"2026-07-05T06:49:44Z"}],"graph_snapshots":[{"event_id":"sha256:64ab7e57b9a60a7e41e813e23eadb45d5de3ae0e3ab1511a78be14717aaa9a53","target":"graph","created_at":"2026-07-05T06:49:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.05550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In cryptographic algorithms, the constants to be multiplied by a variable can be very large due to security requirements. Thus, the hardware complexity of such algorithms heavily depends on the design architecture handling large constants. In this paper, we introduce an electronic design automation tool, called LEIGER, which can automatically generate the realizations of very large constant multiplications for low-complexity and high-speed applications, targeting the ASIC design platform. LEIGER can utilize the shift-adds architecture and use 3-input operations, i.e., carry-save adders (CSAs),","authors_text":"Debapriya Basu Roy, Levent Aksoy, Malik Imran, Samuel Pagliarini","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-11T15:35:02Z","title":"Multiplierless Design of High-Speed Very Large Constant Multiplications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05550","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c27b926333ef5e21bb90b676046f76864d0f29e3fbc2ba8119a0b9fa28891832","target":"record","created_at":"2026-07-05T06:49:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a4275b899c77f0055143a31471755dc9edf779b410f052eb1c86ad6e59ddc181","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-11T15:35:02Z","title_canon_sha256":"ac91eca679db91799f54c63c6178f325ac9b18860645e7a598b8daf081fe9ca1"},"schema_version":"1.0","source":{"id":"2309.05550","kind":"arxiv","version":2}},"canonical_sha256":"61be4cd94a468c129f7e5f56e1ba5b20f6a2b20aca8f8ae082d2ae04065df178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61be4cd94a468c129f7e5f56e1ba5b20f6a2b20aca8f8ae082d2ae04065df178","first_computed_at":"2026-07-05T06:49:44.577559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:44.577559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yYRnm2R6fBjvBI2sAFPn5nk4H9IMQpq2qnwnLLhOj5Riv9Siw52gqTpnBPScyA/9ravqm2hQ6HJLUqAbaItrAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:44.578002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.05550","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c27b926333ef5e21bb90b676046f76864d0f29e3fbc2ba8119a0b9fa28891832","sha256:64ab7e57b9a60a7e41e813e23eadb45d5de3ae0e3ab1511a78be14717aaa9a53"],"state_sha256":"adfc3477440dfa2cbfa753b14d1ec936e125de187bbc194fa2d29aef15fb71cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QR/iDXGkR5fJvGzlgsJUCxAtJCx1izZp1OBg9ReFQn3OxTrHAsME8eHMn7lZESPEtNTMcPdSRax8emSOl7HOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:23:40.153346Z","bundle_sha256":"47a9973fac6adcaa3d9241b574caf6b38f400a7ea3e9bd9f3e14a72ea7e16306"}}