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: "the impact of channel feedback on opportunistic relay selection for hybrid arq in wireless networks"
  Abstract: This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol supports hybrid automatic repeat request transmission where relays forward parity information to the destination in the event of a decoding error. Channel feedback is employed for refining the relay selection process and to select an appropriate transmission mode in a proposed adaptive modulation transmission framework. An approximation of the throughput of the proposed adaptive modulation strategy is presented, and the dependence of the throughput on system parameters such as the relay contention probability and the adaptive modulation switching point is illustrated via maximization of this approximation. Simulations show that the throughput of the proposed selection strategy is comparable with that yielded by a centralized selection approach that relies on geographic information.

Connected through hyperedge HE-1 (induced by source paper "link quality control mechanism for selective and opportunistic af relaying in cooperative arqs a mlsd perspective"):
  with members:
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-2 (induced by source paper "two way transmission capacity of wireless ad hoc networks"):
  with members:
    - "optimal reverse carpooling over wireless networks a distributed optimization approach"
    - "an overview of the transmission capacity of wireless networks"
    - "transmission capacity of ad hoc networks with multiple antennas using transmit stream adaptation and interference cancelation"
    - "spatial interference cancellation for multi antenna mobile ad hoc networks"
    - "bandwidth partitioning in decentralized wireless networks"
    - "spectrum sharing between wireless networks"
    - "fractional power control for decentralized wireless networks"
    - "transmission capacity of ad hoc networks with spatial diversity"

Connected through hyperedge HE-3 (induced by source paper "splitting algorithms for fast relay selection generalizations analysis and a unified view"):
  with members:
    - "relay subset selection in wireless networks using partial decode and forward transmission"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-4 (induced by source paper "optimal timer based selection schemes"):
  with members:
    - "splitting algorithms for fast relay selection generalizations analysis and a unified view"
    - "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)