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 "on secure computation over the binary modulo 2 adder multiple access wiretap channel"):
  Abstract: In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matches the algebraic structure of the channel and the joint source distribution fulfills certain conditions, the secrecy computation-capacity equals the computation capacity, which is the supremum of all achievable computation rates without secrecy constraints. Unlike the case of securely transmitting messages, no additional randomness is needed at the encoders nor does the legitimate receiver need any advantage over the eavesdropper. The results therefore show that the problem of securely computing a function over a multiple-access wiretap channel may significantly differ from the one of securely communicating messages.

Includes members:
  Member "nomographic functions efficient computation in clustered gaussian sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing and communicating functions in disorganized wireless networks")
  Member "two shannon type problems on secure multi party computations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "how to securely compute the modulo two sum of binary sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure modulo sum via multiple access channel")
  Member "distributed function computation with confidentiality":
    also connected through other hyperedges:
      (none)
  Member "computation over mismatched channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "homologous codes for multiple access channels")
  Member "robust analog function computation via wireless multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "one bit over the air aggregation for communication efficient federated edge learning design and convergence analysis")
  Member "when is a function securely computable":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interactive secure function computation")
  Member "the gaussian multiple access wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages")

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.IT(Information Theory)