{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CNIZZ6BBNJHW7FIV5MSIVXNMGC","short_pith_number":"pith:CNIZZ6BB","canonical_record":{"source":{"id":"2605.17222","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T01:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"39444c6590ae0995d40f1ea25d423e4e69ac9bbd51ce1aeba3d386a543f82bfd","abstract_canon_sha256":"a78470f3cccffd7bce929a0475d4ac77c48c3337ed48cc523bf5eca915f6e3ca"},"schema_version":"1.0"},"canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","source":{"kind":"arxiv","id":"2605.17222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17222","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17222v1","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17222","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"CNIZZ6BBNJHW","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"pith_short_16","alias_value":"CNIZZ6BBNJHW7FIV","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"pith_short_8","alias_value":"CNIZZ6BB","created_at":"2026-05-20T00:03:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CNIZZ6BBNJHW7FIV5MSIVXNMGC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17222","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T01:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"39444c6590ae0995d40f1ea25d423e4e69ac9bbd51ce1aeba3d386a543f82bfd","abstract_canon_sha256":"a78470f3cccffd7bce929a0475d4ac77c48c3337ed48cc523bf5eca915f6e3ca"},"schema_version":"1.0"},"canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:46.009293Z","signature_b64":"BHRItJ3+ewkBShjWqcWaaqS3zBjL5Bt9vEEx2KT2tjf0AqNEnvGy+Y/AqzqDO2fbMaElqd98dhAVrLvnNyoXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","last_reissued_at":"2026-05-20T00:03:46.008502Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:46.008502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17222","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-05-20T00:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjaoBmjn7DICorASJutlNK/2OxA3Y2ZKQDh4sfQ5xuDMMl1wah9XvJAvTk0pgnYDWydMzC4GSfcPAFZzwrFJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:07:21.014392Z"},"content_sha256":"c616b27cf57318d4aef8243e2dcf156998a87e83aad5fdefec715847457d5796","schema_version":"1.0","event_id":"sha256:c616b27cf57318d4aef8243e2dcf156998a87e83aad5fdefec715847457d5796"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CNIZZ6BBNJHW7FIV5MSIVXNMGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Triple-Hoisted Baby-Step Giant-Step Linear Transformation over CKKS Homomorphic Encryption and Hardware Accelerator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Sajjad Akherati, Xinmiao Zhang","submitted_at":"2026-05-17T01:57:35Z","abstract_excerpt":"Computations can be directly carried out over ciphertexts using homomorphic encryption (HE), which is indispensable for privacy-preserving cloud computing. Linear transformation is widely used in neural networks, including large language models. However, the implementation of linear transformation over HE requires a large number of ciphertext rotations, which incur significant memory and hardware overhead despite existing simplification techniques. This paper proposes a triple-hoisted baby-step giant-step algorithm that decomposes the baby step further to substantially reduce the number of cip"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"For a set of typical parameters, the proposed design reduces the off-chip memory access by 2.9x compared to the best prior design and achieves a 5.8x reduction in computational latency compared with the baseline design.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reported gains assume that the chosen decomposition parameters and phase partitioning incur no hidden overheads that would appear in full end-to-end encrypted inference workloads; this premise is stated in the abstract when the authors restrict evaluation to 'a set of typical parameters' without showing workload-level measurements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"f6a3766a43631dd3f9a39348c2c82cff6c97e94019f864c559785a5c8518041e"},"source":{"id":"2605.17222","kind":"arxiv","version":1},"verdict":{"id":"a095b363-50f7-4c2b-99a7-5f82e6de75ea","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-20T00:00:06.000135Z","strongest_claim":"For a set of typical parameters, the proposed design reduces the off-chip memory access by 2.9x compared to the best prior design and achieves a 5.8x reduction in computational latency compared with the baseline design.","one_line_summary":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reported gains assume that the chosen decomposition parameters and phase partitioning incur no hidden overheads that would appear in full end-to-end encrypted inference workloads; this premise is stated in the abstract when the authors restrict evaluation to 'a set of typical parameters' without showing workload-level measurements.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17222/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.916836Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.808450Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c59679a22c37c1eb005131c32c73d826be3f569883ea3c684dfece003224feef"},"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":"a095b363-50f7-4c2b-99a7-5f82e6de75ea"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rj0wRzg70242459dxTzblc0Yp95qsX7rurh5B+nBBLOYHAgtkO+TsifgRu8vc+nmrFGnFllauL4JmMv45Yw8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:07:21.014886Z"},"content_sha256":"1f3e223342931b4c11e0f00b3f49747dd98cc11153897caeaea9b98f11d45475","schema_version":"1.0","event_id":"sha256:1f3e223342931b4c11e0f00b3f49747dd98cc11153897caeaea9b98f11d45475"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/bundle.json","state_url":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/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-05-22T00:07:21Z","links":{"resolver":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC","bundle":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/bundle.json","state":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CNIZZ6BBNJHW7FIV5MSIVXNMGC","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":"a78470f3cccffd7bce929a0475d4ac77c48c3337ed48cc523bf5eca915f6e3ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T01:57:35Z","title_canon_sha256":"39444c6590ae0995d40f1ea25d423e4e69ac9bbd51ce1aeba3d386a543f82bfd"},"schema_version":"1.0","source":{"id":"2605.17222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17222","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17222v1","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17222","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"CNIZZ6BBNJHW","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"pith_short_16","alias_value":"CNIZZ6BBNJHW7FIV","created_at":"2026-05-20T00:03:46Z"},{"alias_kind":"pith_short_8","alias_value":"CNIZZ6BB","created_at":"2026-05-20T00:03:46Z"}],"graph_snapshots":[{"event_id":"sha256:1f3e223342931b4c11e0f00b3f49747dd98cc11153897caeaea9b98f11d45475","target":"graph","created_at":"2026-05-20T00:03:46Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For a set of typical parameters, the proposed design reduces the off-chip memory access by 2.9x compared to the best prior design and achieves a 5.8x reduction in computational latency compared with the baseline design."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The reported gains assume that the chosen decomposition parameters and phase partitioning incur no hidden overheads that would appear in full end-to-end encrypted inference workloads; this premise is stated in the abstract when the authors restrict evaluation to 'a set of typical parameters' without showing workload-level measurements."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs."}],"snapshot_sha256":"f6a3766a43631dd3f9a39348c2c82cff6c97e94019f864c559785a5c8518041e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.916836Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.808450Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17222/integrity.json","findings":[],"snapshot_sha256":"c59679a22c37c1eb005131c32c73d826be3f569883ea3c684dfece003224feef","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computations can be directly carried out over ciphertexts using homomorphic encryption (HE), which is indispensable for privacy-preserving cloud computing. Linear transformation is widely used in neural networks, including large language models. However, the implementation of linear transformation over HE requires a large number of ciphertext rotations, which incur significant memory and hardware overhead despite existing simplification techniques. This paper proposes a triple-hoisted baby-step giant-step algorithm that decomposes the baby step further to substantially reduce the number of cip","authors_text":"Sajjad Akherati, Xinmiao Zhang","cross_cats":[],"headline":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T01:57:35Z","title":"Triple-Hoisted Baby-Step Giant-Step Linear Transformation over CKKS Homomorphic Encryption and Hardware Accelerator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17222","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-20T00:00:06.000135Z","id":"a095b363-50f7-4c2b-99a7-5f82e6de75ea","model_set":{"reader":"grok-4.3"},"one_line_summary":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"For a set of typical parameters, the proposed design reduces the off-chip memory access by 2.9x compared to the best prior design and achieves a 5.8x reduction in computational latency compared with the baseline design.","weakest_assumption":"The reported gains assume that the chosen decomposition parameters and phase partitioning incur no hidden overheads that would appear in full end-to-end encrypted inference workloads; this premise is stated in the abstract when the authors restrict evaluation to 'a set of typical parameters' without showing workload-level measurements."}},"verdict_id":"a095b363-50f7-4c2b-99a7-5f82e6de75ea"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c616b27cf57318d4aef8243e2dcf156998a87e83aad5fdefec715847457d5796","target":"record","created_at":"2026-05-20T00:03:46Z","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":"a78470f3cccffd7bce929a0475d4ac77c48c3337ed48cc523bf5eca915f6e3ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T01:57:35Z","title_canon_sha256":"39444c6590ae0995d40f1ea25d423e4e69ac9bbd51ce1aeba3d386a543f82bfd"},"schema_version":"1.0","source":{"id":"2605.17222","kind":"arxiv","version":1}},"canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","first_computed_at":"2026-05-20T00:03:46.008502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:46.008502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BHRItJ3+ewkBShjWqcWaaqS3zBjL5Bt9vEEx2KT2tjf0AqNEnvGy+Y/AqzqDO2fbMaElqd98dhAVrLvnNyoXDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:46.009293Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c616b27cf57318d4aef8243e2dcf156998a87e83aad5fdefec715847457d5796","sha256:1f3e223342931b4c11e0f00b3f49747dd98cc11153897caeaea9b98f11d45475"],"state_sha256":"20a60b5f8f5001c15f4d1b8d2cdf57323bd93e4635cc687f0736d67dac2f5375"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKDGGQ/c61BbOCeUyuE7KoThQ6Fo2z5BoxiqwAPv+Dcoyk4PLBkwOsH0VZvWS5CUdCxnB9QGIVqLUAQtkMl1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:07:21.017419Z","bundle_sha256":"3445999dac8ffdb5064e14c92230a3170cb04abf0e81e459c9fba22d1331db31"}}