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 the secrecy capacity region of parallel broadcast channel with common and confidential messages"):
  Abstract: We consider a broadcast communication system over parallel sub-channels where the transmitter sends a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. Assuming perfect channel state information at the transmitter, the characterization of the boundary for the secrecy capacity region turns into solving a power allocation optimization problem. We derive the power allocation algorithm reaching the boundary of the secrecy capacity region under an average total power constraint. Numerical simulations are presented in comparison to existing power allocation schemes, showing the merit of the proposed algorithm.

Includes members:
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "new results on multiple input multiple output broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "capacity region of gaussian mimo broadcast channels with common and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "multiple input multiple output gaussian broadcast channels with common and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "capacity bounds for broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")
  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")

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)