{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Q5FBLTRMLYXVONZUSSEXMSFV7X","short_pith_number":"pith:Q5FBLTRM","canonical_record":{"source":{"id":"2205.10591","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-21T13:17:03Z","cross_cats_sorted":[],"title_canon_sha256":"528b685e5edeb035d681d9c116e535c7d72750a66c0195db5fdda6616c0108e5","abstract_canon_sha256":"4bad6708af01318aaa2e78e7ad9a0a79cced8fdf5572e428b6c7292081b1cf19"},"schema_version":"1.0"},"canonical_sha256":"874a15ce2c5e2f57373494897648b5fdc0c87f659fea7e90b362a94e8ba0c772","source":{"kind":"arxiv","id":"2205.10591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.10591","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"arxiv_version","alias_value":"2205.10591v1","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10591","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q5FBLTRMLYXV","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"pith_short_16","alias_value":"Q5FBLTRMLYXVONZU","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"pith_short_8","alias_value":"Q5FBLTRM","created_at":"2026-07-05T04:25:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Q5FBLTRMLYXVONZUSSEXMSFV7X","target":"record","payload":{"canonical_record":{"source":{"id":"2205.10591","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-21T13:17:03Z","cross_cats_sorted":[],"title_canon_sha256":"528b685e5edeb035d681d9c116e535c7d72750a66c0195db5fdda6616c0108e5","abstract_canon_sha256":"4bad6708af01318aaa2e78e7ad9a0a79cced8fdf5572e428b6c7292081b1cf19"},"schema_version":"1.0"},"canonical_sha256":"874a15ce2c5e2f57373494897648b5fdc0c87f659fea7e90b362a94e8ba0c772","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:21.372772Z","signature_b64":"SHoXb0DMhUq0kWpfRuYaOKUcJ6grxc1dfbSq4OLlkz2b1aioDSyOJDZz3UDKwYFAaGlfOMTekGc9f6Jky3d6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874a15ce2c5e2f57373494897648b5fdc0c87f659fea7e90b362a94e8ba0c772","last_reissued_at":"2026-07-05T04:25:21.372381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:21.372381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.10591","source_version":1,"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-05T04:25:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVrd3W1Iv43i2ywFP/Zbn1ciharGeJ4hAHxr/7RSMIATZWDFV37HIiO+EfsMd3WnUPVZ2SKP2pPn9BT9DinCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T10:20:37.894016Z"},"content_sha256":"cb4381a665ed011d0b0f1d22e020e8eafce2633fe0d246cf4911299eea29c5c9","schema_version":"1.0","event_id":"sha256:cb4381a665ed011d0b0f1d22e020e8eafce2633fe0d246cf4911299eea29c5c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Q5FBLTRMLYXVONZUSSEXMSFV7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplierless Design of Very Large Constant Multiplications in Cryptography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Debapriya Basu Roy, Levent Aksoy, Malik Imran, Patrick Karl, Samuel Pagliarini","submitted_at":"2022-05-21T13:17:03Z","abstract_excerpt":"This brief addresses the problem of implementing very large constant multiplications by a single variable under the shift-adds architecture using a minimum number of adders/subtractors. Due to the intrinsic complexity of the problem, we introduce an approximate algorithm, called T\\~OLL, which partitions the very large constants into smaller ones. To reduce the number of operations, T\\~OLL incorporates graph-based and common subexpression elimination methods proposed for the shift-adds design of constant multiplications. It can also consider the delay of a multiplierless design defined in terms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10591","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/2205.10591/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-05T04:25:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0eRQjgnLBF270C7vNQaMcdBbBp4Lkf+4qZCWk6/XnRXjtH7S2FHXohRArdRQ4CbKg4L0vwc71RFvyXFWBYeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T10:20:37.894407Z"},"content_sha256":"fa575259079aef8b0d4a73b53dbac1986a08079e70a7b56c8fa4a2e4def7329c","schema_version":"1.0","event_id":"sha256:fa575259079aef8b0d4a73b53dbac1986a08079e70a7b56c8fa4a2e4def7329c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X/bundle.json","state_url":"https://pith.science/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X/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-07-21T10:20:37Z","links":{"resolver":"https://pith.science/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X","bundle":"https://pith.science/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X/bundle.json","state":"https://pith.science/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5FBLTRMLYXVONZUSSEXMSFV7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Q5FBLTRMLYXVONZUSSEXMSFV7X","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":"4bad6708af01318aaa2e78e7ad9a0a79cced8fdf5572e428b6c7292081b1cf19","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-21T13:17:03Z","title_canon_sha256":"528b685e5edeb035d681d9c116e535c7d72750a66c0195db5fdda6616c0108e5"},"schema_version":"1.0","source":{"id":"2205.10591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.10591","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"arxiv_version","alias_value":"2205.10591v1","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10591","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q5FBLTRMLYXV","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"pith_short_16","alias_value":"Q5FBLTRMLYXVONZU","created_at":"2026-07-05T04:25:21Z"},{"alias_kind":"pith_short_8","alias_value":"Q5FBLTRM","created_at":"2026-07-05T04:25:21Z"}],"graph_snapshots":[{"event_id":"sha256:fa575259079aef8b0d4a73b53dbac1986a08079e70a7b56c8fa4a2e4def7329c","target":"graph","created_at":"2026-07-05T04:25:21Z","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/2205.10591/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This brief addresses the problem of implementing very large constant multiplications by a single variable under the shift-adds architecture using a minimum number of adders/subtractors. Due to the intrinsic complexity of the problem, we introduce an approximate algorithm, called T\\~OLL, which partitions the very large constants into smaller ones. To reduce the number of operations, T\\~OLL incorporates graph-based and common subexpression elimination methods proposed for the shift-adds design of constant multiplications. It can also consider the delay of a multiplierless design defined in terms","authors_text":"Debapriya Basu Roy, Levent Aksoy, Malik Imran, Patrick Karl, Samuel Pagliarini","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-21T13:17:03Z","title":"Multiplierless Design of Very Large Constant Multiplications in Cryptography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10591","kind":"arxiv","version":1},"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:cb4381a665ed011d0b0f1d22e020e8eafce2633fe0d246cf4911299eea29c5c9","target":"record","created_at":"2026-07-05T04:25:21Z","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":"4bad6708af01318aaa2e78e7ad9a0a79cced8fdf5572e428b6c7292081b1cf19","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-21T13:17:03Z","title_canon_sha256":"528b685e5edeb035d681d9c116e535c7d72750a66c0195db5fdda6616c0108e5"},"schema_version":"1.0","source":{"id":"2205.10591","kind":"arxiv","version":1}},"canonical_sha256":"874a15ce2c5e2f57373494897648b5fdc0c87f659fea7e90b362a94e8ba0c772","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"874a15ce2c5e2f57373494897648b5fdc0c87f659fea7e90b362a94e8ba0c772","first_computed_at":"2026-07-05T04:25:21.372381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:25:21.372381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SHoXb0DMhUq0kWpfRuYaOKUcJ6grxc1dfbSq4OLlkz2b1aioDSyOJDZz3UDKwYFAaGlfOMTekGc9f6Jky3d6Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:25:21.372772Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.10591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb4381a665ed011d0b0f1d22e020e8eafce2633fe0d246cf4911299eea29c5c9","sha256:fa575259079aef8b0d4a73b53dbac1986a08079e70a7b56c8fa4a2e4def7329c"],"state_sha256":"49b460d19249c10a0bcae02e19bf11ad19337cc94764726344384e7fa551111f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nb9fmmdgalXmLerjVT32Bjwlke2Xy2GnHQJeBECCwVf1OBZdJ0Q7e+lQW0SsoeRqDjf2ZdQugfjmyA7NODn2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T10:20:37.896525Z","bundle_sha256":"5fc23dfe0eed4dce392cbbce36cb5329fdcba40b5ec22243a723c6087ff8de0e"}}