human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "privacy preserving inference in machine learning services using trusted execution environments"):
  Abstract: This work presents Origami, which provides privacy-preserving inference for large deep neural network (DNN) models through a combination of enclave execution, cryptographic blinding, interspersed with accelerator-based computation. Origami partitions the ML model into multiple partitions. The first partition receives the encrypted user input within an SGX enclave. The enclave decrypts the input and then applies cryptographic blinding to the input data and the model parameters. Cryptographic blinding is a technique that adds noise to obfuscate data. Origami sends the obfuscated data for computation to an untrusted GPU/CPU. The blinding and de-blinding factors are kept private by the SGX enclave, thereby preventing any adversary from denoising the data, when the computation is offloaded to a GPU/CPU. The computed output is returned to the enclave, which decodes the computation on noisy data using the unblinding factors privately stored within SGX. This process may be repeated for each DNN layer, as has been done in prior work Slalom. #R##N#However, the overhead of blinding and unblinding the data is a limiting factor to scalability. Origami relies on the empirical observation that the feature maps after the first several layers can not be used, even by a powerful conditional GAN adversary to reconstruct input. Hence, Origami dynamically switches to executing the rest of the DNN layers directly on an accelerator without needing any further cryptographic blinding intervention to preserve privacy. We empirically demonstrate that using Origami, a conditional GAN adversary, even with an unlimited inference budget, cannot reconstruct the input. We implement and demonstrate the performance gains of Origami using the VGG-16 and VGG-19 models. Compared to running the entire VGG-19 model within SGX, Origami inference improves the performance of private inference from 11x while using Slalom to 15.1x.

Includes members:
  Member "shredder learning noise distributions to protect inference privacy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the deep learning compiler a comprehensive survey")
  Member "partially encrypted machine learning using functional encryption":
    also connected through other hyperedges:
      (none)
  Member "sgxpectre stealing intel secrets from sgx enclaves via speculative execution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed systems and trusted execution environments trade offs and challenges")
  Member "x gans image reconstruction made easy for extreme cases":
    also connected through other hyperedges:
      (none)
  Member "spectre attacks exploiting speculative execution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards probabilistic verification of machine unlearning")
  Member "the alexnet moment for homomorphic encryption hcnn the first homomorphic cnn on encrypted data with gpus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "heaan demystified accelerating fully homomorphic encryption through architecture centric analysis and optimization")
  Member "gazelle a low latency framework for secure neural network inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep quaternion features for privacy protection")
  Member "not just privacy improving performance of private deep learning in mobile cloud":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "neural architecture search over decentralized data")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)