{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WO6WFVL7KIQ2YBDJ2PZSQJTXDO","short_pith_number":"pith:WO6WFVL7","schema_version":"1.0","canonical_sha256":"b3bd62d57f5221ac0469d3f32826771b8af47e58f69833152ebf1ffbb65012d9","source":{"kind":"arxiv","id":"2607.18720","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Fault-Tolerance Scheme for CKKS Computation on CPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Ge Yu, Huawei Li, Jianan Mu, Jing Ye, Liang Kong, Meng Li, Tenghui Hua, Xiaowei Li, Xing Hu","submitted_at":"2026-07-21T05:22:05Z","abstract_excerpt":"Fully homomorphic encryption (FHE) enables computation on encrypted data, but its long ciphertext dataflow and high-dimensional modular arithmetic make it vulnerable to silent data corruption caused by transient hardware faults. Existing protection methods either target dedicated accelerators or impose substantial execution, modular-arithmetic, and memory-access overheads on CPUs.\n  This work presents an efficient fault-tolerance scheme for CPU-based CKKS computation. It checks the input-output consistency of polynomial operators while reducing protection overhead at three levels. First, modul"},"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":"2607.18720","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-21T05:22:05Z","cross_cats_sorted":[],"title_canon_sha256":"921036625ee642cbcf6db766d5eed19cf8f64b1069bf544d674e47b27fc41688","abstract_canon_sha256":"af7c9a280cd6bc6228fefb459a90a2be19a19c1e51c1ed9ddb7012419f3fb303"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:23:08.376668Z","signature_b64":"CuRHBAU8jFpxQpSlkrNWgJX564GMwHCH11KNrAJhOK8HgocEizE0Ilr4PD7Q3nEiNOHV4oe1Vpo0K8kniP1kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3bd62d57f5221ac0469d3f32826771b8af47e58f69833152ebf1ffbb65012d9","last_reissued_at":"2026-07-22T01:23:08.375740Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:23:08.375740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Fault-Tolerance Scheme for CKKS Computation on CPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Ge Yu, Huawei Li, Jianan Mu, Jing Ye, Liang Kong, Meng Li, Tenghui Hua, Xiaowei Li, Xing Hu","submitted_at":"2026-07-21T05:22:05Z","abstract_excerpt":"Fully homomorphic encryption (FHE) enables computation on encrypted data, but its long ciphertext dataflow and high-dimensional modular arithmetic make it vulnerable to silent data corruption caused by transient hardware faults. Existing protection methods either target dedicated accelerators or impose substantial execution, modular-arithmetic, and memory-access overheads on CPUs.\n  This work presents an efficient fault-tolerance scheme for CPU-based CKKS computation. It checks the input-output consistency of polynomial operators while reducing protection overhead at three levels. First, modul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18720","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/2607.18720/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":"2607.18720","created_at":"2026-07-22T01:23:08.376223+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18720v1","created_at":"2026-07-22T01:23:08.376223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18720","created_at":"2026-07-22T01:23:08.376223+00:00"},{"alias_kind":"pith_short_12","alias_value":"WO6WFVL7KIQ2","created_at":"2026-07-22T01:23:08.376223+00:00"},{"alias_kind":"pith_short_16","alias_value":"WO6WFVL7KIQ2YBDJ","created_at":"2026-07-22T01:23:08.376223+00:00"},{"alias_kind":"pith_short_8","alias_value":"WO6WFVL7","created_at":"2026-07-22T01:23:08.376223+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/WO6WFVL7KIQ2YBDJ2PZSQJTXDO","json":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO.json","graph_json":"https://pith.science/api/pith-number/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/graph.json","events_json":"https://pith.science/api/pith-number/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/events.json","paper":"https://pith.science/paper/WO6WFVL7"},"agent_actions":{"view_html":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO","download_json":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO.json","view_paper":"https://pith.science/paper/WO6WFVL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18720&json=true","fetch_graph":"https://pith.science/api/pith-number/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/graph.json","fetch_events":"https://pith.science/api/pith-number/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/action/storage_attestation","attest_author":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/action/author_attestation","sign_citation":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/action/citation_signature","submit_replication":"https://pith.science/pith/WO6WFVL7KIQ2YBDJ2PZSQJTXDO/action/replication_record"}},"created_at":"2026-07-22T01:23:08.376223+00:00","updated_at":"2026-07-22T01:23:08.376223+00:00"}