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: "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying"
  Abstract: We consider the problem of cooperative communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., Simultaneous and Successive relaying, associated with two possible relay orderings are proposed. The simultaneous relaying protocol is based on dynamic decode and forward (DDF) scheme. For the successive relaying protocol, a Non-Cooperative Coding based on dirty paper coding (DPC) is proposed. We also propose a general achievable rate based on the combination of the proposed simultaneous and successive relaying schemes. The optimum ordering of the relays and hence the capacity of the half-duplex Gaussian parallel relay channel in low and high SNR scenarios is derived. In low SNR scenario, we show that under certain conditions for the channel coefficients the ratio of the achievable rate of the simultaneous relaying protocol, based on the DDF scheme, to the cut-set bound of the half-duplex Gaussian parallel relay channel tends to 1. On the other hand, as SNR goes to infinity, we prove that successive relaying protocol, based on the DPC scheme, asymptotically achieves the capacity of the network.

Connected through hyperedge HE-1 (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"
    - "on the capacity of the half duplex diamond channel"

Connected through hyperedge HE-2 (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"
    - "on the capacity of the half duplex diamond channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of the half duplex diamond channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a new achievable rate for the gaussian parallel relay channel"
    - "capacity of a class of diamond channels"
    - "dmt of multi hop cooperative networks part i basic results"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "on the diversity multiplexing tradeoff in multiple relay network"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "a new achievable rate for the gaussian parallel relay channel"):
  with members:
    - "analog matching of colored sources to colored channels"
    - "approximate capacity of gaussian relay networks"
    - "capacity of a class of deterministic relay channels"

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)