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 "bi directional half duplex protocols with multiple relays"):
  Abstract: In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has considered information theoretic limits of the bi-directional relay channel with a single relay. In this work we consider bi-directional relaying with multiple relays. We derive achievable rate regions and outer bounds for half-duplex protocols with multiple decode and forward relays and compare these to the same protocols with amplify and forward relays in an additive white Gaussian noise channel. We consider three novel classes of half-duplex protocols: the (m,2) 2 phase protocol with m relays, the (m,3) 3 phase protocol with m relays, and general (m, t) Multiple Hops and Multiple Relays (MHMR) protocols, where m is the total number of relays and 3<t< m+3 is the number of temporal phases in the protocol. The (m,2) and (m,3) protocols extend previous bi-directional relaying protocols for a single m=1 relay, while the new (m,t) protocol efficiently combines multi-hop routing with message-level network coding. Finally, we provide a comprehensive treatment of the MHMR protocols with decode and forward relaying and amplify and forward relaying in the Gaussian noise, obtaining their respective achievable rate regions, outer bounds and relative performance under different SNRs and relay geometries, including an analytical comparison on the protocols at low and high SNR.

Includes members:
  Member "capacity region of the deterministic multi pair bi directional relay network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity region of the deterministic y channel with common and private messages")
  Member "broadcast capacity region of two phase bidirectional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "to code or not to code in multi hop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable rate regions and outer bounds for a multi pair bi directional relay network")
  Member "on the capacity and diversity multiplexing tradeoff of the two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "achievable rate regions for bi directional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation and outage analysis for an adaptive cognitive two way relay network")
  Member "capacity of gaussian mimo bidirectional broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "achievable rate regions and outer bounds for a multi pair bi directional relay network")
  Member "performance bounds for bi directional coded cooperation protocols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "integer forcing and forward transceiver design for mimo multipair two way relaying")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)