human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "resource allocation for wireless fading relay channels max min solution"
  Abstract: As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the capacity is established, and is further demonstrated via the Gaussian case, for which the synchronized and asynchronized capacities are obtained. The capacity achieving power allocation at the source and relay nodes among the subchannels is characterized. The fading relay channel is then studied, for which resource allocations that maximize the achievable rates are obtained for both the full-duplex and half-duplex cases. Capacities are established for fading relay channels that satisfy certain conditions.

Connected through hyperedge HE-1 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit"):
  with members:
    - "achievable secrecy rates over mimome gaussian channels with gmm signals in low noise regime"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "capacity bounds for broadcast channels with confidential messages"
    - "secure communication over fading channels"

Connected through hyperedge HE-2 (induced by source paper "optimal power allocation for two way decode and forward ofdm relay networks"):
  with members:
    - "optimal real time spectrum sharing between cooperative relay and ad hoc networks"
    - "joint subcarrier pairing and power allocation for ofdm transmission with decode and forward relaying"

Connected through hyperedge HE-3 (induced by source paper "secure broadcasting over fading channels with statistical qos constraints"):
  with members:
    - "secure communication over fading channels with statistical qos constraints"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "secure communication over fading channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-4 (induced by source paper "optimal relay subset selection and time allocation in decode and forward cooperative networks"):
  with members:
    - "optimal routing for decode and forward based cooperation in wireless networks"
    - "parity forwarding for multiple relay networks"
    - "a simple cooperative diversity method based on network path selection"

Question: Please tell me which class the center node 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)