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 "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages"):
  Abstract: The broadcast channel with confidential messages is a well studied scenario from the theoretical standpoint, but there is still lack of practical schemes able to achieve some fixed level of reliability and security over such a channel. In this paper, we consider a quasi-static fading channel in which both public and private messages must be sent from the transmitter to the receivers, and we aim at designing suitable coding and modulation schemes to achieve such a target. For this purpose, we adopt the error rate as a metric, by considering that reliability (security) is achieved when a sufficiently low (high) error rate is experienced at the receiving side. We show that some conditions exist on the system feasibility, and that some outage probability must be tolerated to cope with the fading nature of the channel. The proposed solution exploits low-density parity-check codes with unequal error protection, which are able to guarantee two different levels of protection against noise for the public and the private information, in conjunction with different modulation schemes for the public and the private message bits.

Includes members:
  Member "new results on multiple input multiple output broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "a physical layer secured key distribution technique for ieee 802 11g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy transmission on block fading channels theoretical limits and performance of practical codes")
  Member "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "broadcast channels with confidential messages by randomness constrained stochastic encoder":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ldpc codes over gaussian multiple access wiretap channel")
  Member "increasing physical layer security through scrambled codes and arq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ldpc coded transmissions over the gaussian broadcast channel with confidential messages")
  Member "secure broadcasting over fading channels with statistical qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure wireless communication and optimal power control under statistical queueing constraints")
  Member "capacity region of gaussian mimo broadcast channels with common and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)