{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GQX365VKOUPBOWHEUJUMVULGSS","short_pith_number":"pith:GQX365VK","schema_version":"1.0","canonical_sha256":"342fbf76aa751e1758e4a268cad1669490d4e3805ae36fa2ddbe19127d8f60aa","source":{"kind":"arxiv","id":"1908.04172","version":2},"attestation_state":"computed","paper":{"title":"nGraph-HE2: A High-Throughput Framework for Neural Network Inference on Encrypted Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anamaria Costache, Casimir Wierzynski, Fabian Boemer, Rosario Cammarota","submitted_at":"2019-08-12T14:30:13Z","abstract_excerpt":"In previous work, Boemer et al. introduced nGraph-HE, an extension to the Intel nGraph deep learning (DL) compiler, that enables data scientists to deploy models with popular frameworks such as TensorFlow and PyTorch with minimal code changes. However, the class of supported models was limited to relatively shallow networks with polynomial activations. Here, we introduce nGraph-HE2, which extends nGraph-HE to enable privacy-preserving inference on standard, pre-trained models using their native activation functions and number fields (typically real numbers). The proposed framework leverages th"},"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":"1908.04172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-12T14:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"ca444defa2dd96c6f58c5efad3a806878c47d1a85d7360167e0a311afa46bdb8","abstract_canon_sha256":"f4d4fabcf51e783f96456e8f230de82dfa10827cdc35c1d4a1c5271edd72da0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:35.164992Z","signature_b64":"2cQLD5bvMbXE7M6xyCYr+N3HgBv3uGXKSE4iR9WQkbamBhc9gbew6u6S+B/XHOeHZ7+a+4MsJXLUiuQZqAY/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"342fbf76aa751e1758e4a268cad1669490d4e3805ae36fa2ddbe19127d8f60aa","last_reissued_at":"2026-07-05T00:00:35.164545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:35.164545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"nGraph-HE2: A High-Throughput Framework for Neural Network Inference on Encrypted Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anamaria Costache, Casimir Wierzynski, Fabian Boemer, Rosario Cammarota","submitted_at":"2019-08-12T14:30:13Z","abstract_excerpt":"In previous work, Boemer et al. introduced nGraph-HE, an extension to the Intel nGraph deep learning (DL) compiler, that enables data scientists to deploy models with popular frameworks such as TensorFlow and PyTorch with minimal code changes. However, the class of supported models was limited to relatively shallow networks with polynomial activations. Here, we introduce nGraph-HE2, which extends nGraph-HE to enable privacy-preserving inference on standard, pre-trained models using their native activation functions and number fields (typically real numbers). The proposed framework leverages th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04172","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/1908.04172/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":"1908.04172","created_at":"2026-07-05T00:00:35.164601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04172v2","created_at":"2026-07-05T00:00:35.164601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04172","created_at":"2026-07-05T00:00:35.164601+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQX365VKOUPB","created_at":"2026-07-05T00:00:35.164601+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQX365VKOUPBOWHE","created_at":"2026-07-05T00:00:35.164601+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQX365VK","created_at":"2026-07-05T00:00:35.164601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.11589","citing_title":"A Training Framework for Optimal and Stable Training of Polynomial Neural Networks","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS","json":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS.json","graph_json":"https://pith.science/api/pith-number/GQX365VKOUPBOWHEUJUMVULGSS/graph.json","events_json":"https://pith.science/api/pith-number/GQX365VKOUPBOWHEUJUMVULGSS/events.json","paper":"https://pith.science/paper/GQX365VK"},"agent_actions":{"view_html":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS","download_json":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS.json","view_paper":"https://pith.science/paper/GQX365VK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04172&json=true","fetch_graph":"https://pith.science/api/pith-number/GQX365VKOUPBOWHEUJUMVULGSS/graph.json","fetch_events":"https://pith.science/api/pith-number/GQX365VKOUPBOWHEUJUMVULGSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS/action/storage_attestation","attest_author":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS/action/author_attestation","sign_citation":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS/action/citation_signature","submit_replication":"https://pith.science/pith/GQX365VKOUPBOWHEUJUMVULGSS/action/replication_record"}},"created_at":"2026-07-05T00:00:35.164601+00:00","updated_at":"2026-07-05T00:00:35.164601+00:00"}