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: "parity forwarding for multiple relay networks"
  Abstract: This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwards parities of the decoded codewords. This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages from relays with strong links to it. Hence, each relay may have several choices as to which messages to decode, and for a given network many different parity forwarding protocols may exist. A tree structure is devised to characterize a class of parity forwarding protocols for an arbitrary multirelay network. Based on this tree structure, closed-form expressions for the achievable rates of these DF schemes are derived. It is shown that parity forwarding is capacity achieving for new forms of degraded relay networks.

Connected through hyperedge HE-1 (induced by source paper "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "incremental relaying for the gaussian interference channel with a degraded broadcasting relay"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "symmetric capacity of the gaussian interference channel with an out of band relay to within 1 15 bits"
    - "interference channel with an out of band relay"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "interference mitigation through limited receiver cooperation"
    - "interference relay channels part i transmission rates"

Connected through hyperedge HE-2 (induced by source paper "joint source channel cooperative transmission over relay broadcast networks"):
  with members:
    - "lossy source transmission over the relay channel"

Connected through hyperedge HE-3 (induced by source paper "the impact of channel feedback on opportunistic relay selection for hybrid arq in wireless networks"):
  with members:
    - "opportunistic relay selection with limited feedback"
    - "hybrid arq in multihop networks with opportunistic relay selection"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-4 (induced by source paper "relay assisted user scheduling in wireless networks with hybrid arq"):
  with members:
    - "on the scalability of cooperative time synchronization in pulse connected networks"

Connected through hyperedge HE-5 (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"
    - "resource allocation for wireless fading relay channels max min solution"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-6 (induced by source paper "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying"):
  with members:
    - "recovering multiplexing loss through successive relaying using repetition coding"
    - "towards the optimal amplify and forward cooperative diversity scheme"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative channels"

Connected through hyperedge HE-7 (induced by source paper "deterministic capacity of mimo relay networks"):
  with members:
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-8 (induced by source paper "analysis of a mixed strategy for multiple relay networks"):
  with members:
    - "approximate capacity of gaussian relay networks"

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)