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: "on the capacity of the half duplex diamond channel"
  Abstract: In this paper, a dual-hop communication system composed of a source S and a destination D connected through two non-interfering half-duplex relays, R 1  and R 2 , is considered. In the literature of Information Theory, this configuration is known as the diamond channel. In this setup, four transmission modes are present, namely: 1) S transmits, and R 1  and R 2  listen (broadcast mode), 2) S transmits, R 1  listens, and simultaneously, R 2  transmits and D listens. 3) S transmits, R 2  listens, and simultaneously, R 1  transmits and D listens. 4) R 1 , R 2  transmit, and D listens (multiple-access mode). Assuming a constant power constraint for all transmitters, a parameter Δ is defined, which captures some important features of the channel. It is proven that for Δ=0 the capacity of the channel can be attained by successive relaying, i.e, using modes 2 and 3 defined above in a successive manner. This strategy may have an infinite gap from the capacity of the channel when Δ≠0. To achieve rates as close as 0.71 bits to the capacity, it is shown that the cases of Δ > 0 and Δ   0, respectively. Furthermore, it is established that under average power constraints the aforementioned strategies achieve rates as close as 3.6 bits to the capacity of the channel.

Connected through hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks"):
  with members:
    - "efficiently finding simple schedules in gaussian half duplex relay line networks"
    - "on the optimality of simple schedules for networks with multiple half duplex relays"
    - "softnull many antenna full duplex wireless via digital beamforming"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"
    - "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs"
    - "wireless network simplification beyond diamond networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"

Connected through hyperedge HE-2 (induced by source paper "on the optimality of simple schedules for networks with multiple half duplex relays"):
  with members:
    - "cut set bound is loose for gaussian relay networks"
    - "on the gaussian half duplex relay channel"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "capacity of gaussian channels with duty cycle and power constraints"
    - "on capacity and optimal scheduling for the half duplex multiple relay channel"
    - "efficient capacity computation and power optimization for relay networks"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-3 (induced by source paper "energy harvesting two hop communication networks"):
  with members:
    - "energy harvesting wireless communications a review of recent advances"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "optimal scheduling and power allocation for two hop energy harvesting communication systems"
    - "optimal transmission policies for energy harvesting two hop networks"
    - "two hop communication with energy harvesting"

Connected through hyperedge HE-4 (induced by source paper "the approximate optimality of simple schedules for half duplex multi relay networks"):
  with members:
    - "on the optimality of simple schedules for networks with multiple half duplex relays"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "on capacity and optimal scheduling for the half duplex multiple relay channel"
    - "efficient capacity computation and power optimization for relay networks"
    - "learning with submodular functions a convex optimization perspective"

Connected through hyperedge HE-5 (induced by source paper "on the achievable rates of multihop virtual full duplex relay channels"):
  with members:
    - "short message noisy network coding with a decode forward option"
    - "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying"

Connected through hyperedge HE-6 (induced by source paper "on the gaussian half duplex relay channel"):
  with members:
    - "energy minimization for the half duplex relay channel with decode forward relaying"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "wireless network information flow a deterministic approach"
    - "study of gaussian relay channels with correlated noises"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-7 (induced by source paper "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"):
  with members:
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "on capacity and optimal scheduling for the half duplex multiple relay channel"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "study of gaussian relay channels with correlated noises"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-8 (induced by source paper "full duplex relaying with half duplex relays"):
  with members:
    - "simultaneous nonunique decoding is rate optimal"
    - "experiment driven characterization of full duplex wireless systems"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "the degrees of freedom of compute and forward"
    - "compute and forward harnessing interference through structured codes"
    - "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying"

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)