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 mmse properties of codes for the gaussian broadcast and wiretap channels"):
  Abstract: This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the Gaussian wiretap channel, the Gaussian broadcast channel (BC) and the Gaussian BC with confidential messages (BCC). In particular this work addresses the effects of transmitting such codes on unintended receivers, that is, receivers that neither require reliable decoding of the transmitted messages nor are they eavesdroppers that must be kept ignorant, to some extent, of the transmitted message. This work also examines the effect on the capacity region that occurs when we limit the allowed disturbance in terms of MMSE on some unintended receiver. This trade-off between the capacity region and the disturbance constraint is given explicitly for the Gaussian BC and the secrecy capacity region of the Gaussian BCC.

Includes members:
  Member "polar coding for the broadcast channel with confidential messages and constrained randomization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "polynomial time semantically secure encryption achieving the secrecy capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semantic security on wiretap channels using universal hashing with fading applications")
  Member "mmse of bad codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on communication through a gaussian channel with an mmse disturbance constraint")
  Member "statistical physics of signal estimation in gaussian noise theory and examples of phase transitions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding phase transitions via mutual information and mmse")
  Member "estimation in gaussian noise properties of the minimum mean square error":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "construction of wiretap codes from ordinary channel codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)