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 "resource allocation for secure gaussian parallel relay channels with finite length coding and discrete constellations"):
  Abstract: We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee an outage secrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones.

Includes members:
  Member "enhancing physical layer security in af relay assisted multicarrier wireless transmission enhancing physical layer security in af relay assisted multicarrier wireless transmission":
    also connected through other hyperedges:
      (none)
  Member "joint relay selection and power allocation in large scale mimo systems with untrusted relays and passive eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "secrecy optimized resource allocation for device to device communication underlaying heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "security reliability tradeoff for distributed antenna systems in heterogeneous cellular networks")
  Member "optimal power allocation by imperfect hardware analysis in untrusted relaying networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design and performance analysis of secure multicasting cooperative protocol for wireless sensor network applications")
  Member "secure communication over parallel relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the arbitrarily varying relay channel")
  Member "secure and reliable transmission with cooperative relays in two hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploring relay cooperation scheme for load balance control in two hop secure communication system")
  Member "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rethinking secure precoding via interference exploitation a smart eavesdropper perspective")
  Member "on cooperative relaying schemes for wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interplay between noma and other emerging technologies a survey")

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)