human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "two shannon type problems on secure multi party computations"
  Abstract: In secure multi-party computations (SMC), parties wish to compute a function on their private data without revealing more information about their data than what the function reveals. In this paper, we investigate two Shannontype questions on this problem. We first consider the traditional one-shot model for SMC which does not assume a probabilistic prior on the data. In this model, private communication and randomness are the key enablers to secure computing, and we investigate a notion of randomness cost and capacity. We then move to a probabilistic model for the data, and propose a Shannon model for discrete memoryless SMC. In this model, correlations among data are the key enablers for secure computing, and we investigate a notion of dependency which permits the secure computation of a function. While the models and questions are general, this paper focuses on summation functions and relies on polar code constructions.

Connected through hyperedge HE-1 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach"):
  with members:
    - "expand and randomize an algebraic approach to secure computation"
    - "private sequential function computation"
    - "private set intersection a multi message symmetric private information retrieval perspective"
    - "the capacity of anonymous communications"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "on the capacity of secure distributed matrix multiplication"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "blind interference alignment for private information retrieval"

Connected through hyperedge HE-2 (induced by source paper "expand and randomize an algebraic approach to secure computation"):
  with members:
    - "how to compute modulo prime power sums"
    - "on distributed computing for functions with certain structures"
    - "communication and randomness lower bounds for secure computation"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "comments on cut set bounds on network function computation"
    - "network coding for computing cut set bounds"

Connected through hyperedge HE-3 (induced by source paper "secure modulo sum via multiple access channel"):
  with members:
    - "secure computation and forward with linear codes"
    - "secure physical layer network coding versus secure network coding"
    - "physical layer network coding a random coding error exponent perspective"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "on secure computation over the binary modulo 2 adder multiple access wiretap channel"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "adaptive compute and forward with lattice codes over algebraic integers"

Connected through hyperedge HE-4 (induced by source paper "on secure computation over the binary modulo 2 adder multiple access wiretap channel"):
  with members:
    - "nomographic functions efficient computation in clustered gaussian sensor networks"
    - "how to securely compute the modulo two sum of binary sources"
    - "distributed function computation with confidentiality"
    - "computation over mismatched channels"
    - "robust analog function computation via wireless multiple access channels"
    - "when is a function securely computable"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-5 (induced by source paper "communication and randomness lower bounds for secure computation"):
  with members:
    - "assisted common information with an application to secure two party sampling"
    - "how to securely compute the modulo two sum of binary sources"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "the infinite message limit of two terminal interactive source coding"

Connected through hyperedge HE-6 (induced by source paper "on the communication complexity of secure computation"):
  with members:
    - "assisted common information with an application to secure two party sampling"
    - "lower bounds on information complexity via zero communication protocols and applications"

Question: Please tell me which class the center node 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.IT(Information Theory)