{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AIS3L7XEA6SBVKRUIWHAPPLQRT","short_pith_number":"pith:AIS3L7XE","schema_version":"1.0","canonical_sha256":"0225b5fee407a41aaa34458e07bd708cd3a3e47b2c6d32a6e32a9f1635caebea","source":{"kind":"arxiv","id":"2207.03384","version":2},"attestation_state":"computed","paper":{"title":"Efficient Pruning for Machine Learning Under Homomorphic Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Alper Buyuktosunoglu, Ehud Aharoni, Hayim Shaul, Kanthi Sarpatwar, Moran Baruch, Nir Drucker, Omri Soceanu, Pradip Bose, Roman Vaculin, Subhankar Pal, Tomer Pelleg","submitted_at":"2022-07-07T15:49:24Z","abstract_excerpt":"Privacy-preserving machine learning (PPML) solutions are gaining widespread popularity. Among these, many rely on homomorphic encryption (HE) that offers confidentiality of the model and the data, but at the cost of large latency and memory requirements. Pruning neural network (NN) parameters improves latency and memory in plaintext ML but has little impact if directly applied to HE-based PPML.\n  We introduce a framework called HE-PEx that comprises new pruning methods, on top of a packing technique called tile tensors, for reducing the latency and memory of PPML inference. HE-PEx uses permuta"},"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":"2207.03384","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-07-07T15:49:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3ca66280d9ad6595544343ae9a5dbf8099d8bba2867420e2d6bc948592abb2b0","abstract_canon_sha256":"dcb9badb50d15a2d9f8c51205c81d33930d90ccf63e363f761adac04f12523b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:48.185084Z","signature_b64":"2A85jxD2yjv4PDUG3HY9lX0k7bCFLIsKUqIIfRFNCdr9qvXsf3hm6UuByigzkvf60nVIwCSmRojyZwuNYIbtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0225b5fee407a41aaa34458e07bd708cd3a3e47b2c6d32a6e32a9f1635caebea","last_reissued_at":"2026-07-05T09:30:48.184559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:48.184559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Pruning for Machine Learning Under Homomorphic Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Alper Buyuktosunoglu, Ehud Aharoni, Hayim Shaul, Kanthi Sarpatwar, Moran Baruch, Nir Drucker, Omri Soceanu, Pradip Bose, Roman Vaculin, Subhankar Pal, Tomer Pelleg","submitted_at":"2022-07-07T15:49:24Z","abstract_excerpt":"Privacy-preserving machine learning (PPML) solutions are gaining widespread popularity. Among these, many rely on homomorphic encryption (HE) that offers confidentiality of the model and the data, but at the cost of large latency and memory requirements. Pruning neural network (NN) parameters improves latency and memory in plaintext ML but has little impact if directly applied to HE-based PPML.\n  We introduce a framework called HE-PEx that comprises new pruning methods, on top of a packing technique called tile tensors, for reducing the latency and memory of PPML inference. HE-PEx uses permuta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03384","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/2207.03384/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":"2207.03384","created_at":"2026-07-05T09:30:48.184616+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.03384v2","created_at":"2026-07-05T09:30:48.184616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03384","created_at":"2026-07-05T09:30:48.184616+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIS3L7XEA6SB","created_at":"2026-07-05T09:30:48.184616+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIS3L7XEA6SBVKRU","created_at":"2026-07-05T09:30:48.184616+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIS3L7XE","created_at":"2026-07-05T09:30:48.184616+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07954","citing_title":"MOFHEI: Model Optimizing Framework for Fast and Efficient Homomorphically Encrypted Neural Network Inference","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT","json":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT.json","graph_json":"https://pith.science/api/pith-number/AIS3L7XEA6SBVKRUIWHAPPLQRT/graph.json","events_json":"https://pith.science/api/pith-number/AIS3L7XEA6SBVKRUIWHAPPLQRT/events.json","paper":"https://pith.science/paper/AIS3L7XE"},"agent_actions":{"view_html":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT","download_json":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT.json","view_paper":"https://pith.science/paper/AIS3L7XE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.03384&json=true","fetch_graph":"https://pith.science/api/pith-number/AIS3L7XEA6SBVKRUIWHAPPLQRT/graph.json","fetch_events":"https://pith.science/api/pith-number/AIS3L7XEA6SBVKRUIWHAPPLQRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT/action/storage_attestation","attest_author":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT/action/author_attestation","sign_citation":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT/action/citation_signature","submit_replication":"https://pith.science/pith/AIS3L7XEA6SBVKRUIWHAPPLQRT/action/replication_record"}},"created_at":"2026-07-05T09:30:48.184616+00:00","updated_at":"2026-07-05T09:30:48.184616+00:00"}