{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NE5AT5TYPH3UZXPC6PRBBR45DI","short_pith_number":"pith:NE5AT5TY","schema_version":"1.0","canonical_sha256":"693a09f67879f74cdde2f3e210c79d1a266b625e36b25113ab9571661407d1e6","source":{"kind":"arxiv","id":"2112.06396","version":2},"attestation_state":"computed","paper":{"title":"Does Fully Homomorphic Encryption Need Compute Acceleration?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Ajay Joshi, Anantha Chandrakasan, Chiraag Juvekar, Leo de Castro, Rabia Yazicigil, Rashmi Agrawal, Vinod Vaikuntanathan","submitted_at":"2021-12-13T03:12:04Z","abstract_excerpt":"Fully Homomorphic Encryption (FHE) allows arbitrarily complex computations on encrypted data without ever needing to decrypt it, thus enabling us to maintain data privacy on third-party systems. Unfortunately, sustaining deep computations with FHE requires a periodic noise reduction step known as bootstrapping. The cost of the bootstrapping operation is one of the primary barriers to the wide-spread adoption of FHE. In this paper, we present an in-depth architectural analysis of the bootstrapping step in FHE. First, we observe that secure implementations of bootstrapping exhibit a low arithmet"},"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":"2112.06396","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-12-13T03:12:04Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"eaf69541997ef25225c32b9a099b90619d1cf31cd178b178437461e88939e28b","abstract_canon_sha256":"5f370f28a55aadb028e28116cfc5960ad07e59b27d04f7db8ffe64ae8514e885"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:05.194202Z","signature_b64":"y+2sqTghu4qgNoXTcOaeiH8xKxBFRPYvPV2MOludFq8slW/ZeAERVsG0lWcVZ5HOEkdjfoYF6EZDbE5HQS63DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693a09f67879f74cdde2f3e210c79d1a266b625e36b25113ab9571661407d1e6","last_reissued_at":"2026-07-05T03:41:05.193669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:05.193669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Does Fully Homomorphic Encryption Need Compute Acceleration?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Ajay Joshi, Anantha Chandrakasan, Chiraag Juvekar, Leo de Castro, Rabia Yazicigil, Rashmi Agrawal, Vinod Vaikuntanathan","submitted_at":"2021-12-13T03:12:04Z","abstract_excerpt":"Fully Homomorphic Encryption (FHE) allows arbitrarily complex computations on encrypted data without ever needing to decrypt it, thus enabling us to maintain data privacy on third-party systems. Unfortunately, sustaining deep computations with FHE requires a periodic noise reduction step known as bootstrapping. The cost of the bootstrapping operation is one of the primary barriers to the wide-spread adoption of FHE. In this paper, we present an in-depth architectural analysis of the bootstrapping step in FHE. First, we observe that secure implementations of bootstrapping exhibit a low arithmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06396","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/2112.06396/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":"2112.06396","created_at":"2026-07-05T03:41:05.193726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.06396v2","created_at":"2026-07-05T03:41:05.193726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06396","created_at":"2026-07-05T03:41:05.193726+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE5AT5TYPH3U","created_at":"2026-07-05T03:41:05.193726+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE5AT5TYPH3UZXPC","created_at":"2026-07-05T03:41:05.193726+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE5AT5TY","created_at":"2026-07-05T03:41:05.193726+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04775","citing_title":"FIDESlib: A Fully-Fledged Open-Source FHE Library for Efficient CKKS on GPUs","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI","json":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI.json","graph_json":"https://pith.science/api/pith-number/NE5AT5TYPH3UZXPC6PRBBR45DI/graph.json","events_json":"https://pith.science/api/pith-number/NE5AT5TYPH3UZXPC6PRBBR45DI/events.json","paper":"https://pith.science/paper/NE5AT5TY"},"agent_actions":{"view_html":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI","download_json":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI.json","view_paper":"https://pith.science/paper/NE5AT5TY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.06396&json=true","fetch_graph":"https://pith.science/api/pith-number/NE5AT5TYPH3UZXPC6PRBBR45DI/graph.json","fetch_events":"https://pith.science/api/pith-number/NE5AT5TYPH3UZXPC6PRBBR45DI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI/action/storage_attestation","attest_author":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI/action/author_attestation","sign_citation":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI/action/citation_signature","submit_replication":"https://pith.science/pith/NE5AT5TYPH3UZXPC6PRBBR45DI/action/replication_record"}},"created_at":"2026-07-05T03:41:05.193726+00:00","updated_at":"2026-07-05T03:41:05.193726+00:00"}