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 "secrecy rates for a channel with two senders and two receivers"):
  Abstract: Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are calculated via extensions of a technique due to Chia and El~Gamal and also the method of output statistics of random binning. An intriguing synergy is observed between the achievable rate expressions arising from the two techniques: the rate region of the latter is simplified via a constraint that is discovered while deriving the former rate region. Outer bounds are derived for both the degraded and non-degraded versions of the channel, and examples are provided in which the inner and outer bounds meet. The inner bounds recover known results for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel. An auxiliary result is also produced that characterizes the minimal randomness necessary to achieve secrecy in multiple-access wiretap channels.

Includes members:
  Member "energy efficient multicell multigroup multicasting with joint beamforming and antenna selection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "secure multi source multicast":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "fourier motzkin elimination software for information theoretic inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "secrecy capacity region of some classes of wiretap broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar coding for the wiretap broadcast channel with multiple messages")
  Member "strong secrecy for multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure broadcasting using independent secret keys")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")

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)