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: "broadcast approaches to the diamond channel"
  Abstract: The problem of dual-hop transmission from a source to a destination via two parallel full-duplex relays in block Rayleigh fading environment is investigated. All nodes in the network are assumed to be oblivious to their forward channel gains; however, they have perfect information about their backward channel gains. The focus of this paper is on simple, efficient, and practical relaying schemes to increase the expected-rate at the destination. For this purpose, various combinations of relaying protocols and the broadcast approach (multi-layer coding) are proposed. For the decode-forward (DF) relaying, the maximum finite-layer expected-rate as well as two upper-bounds on the continuous-layer expected-rate are obtained. The main feature of the proposed DF scheme is that the layers being decoded at both relays are added coherently at the destination although each relay has no information about the number of layers being successfully decoded by the other relay. It is proved that the optimal coding scheme is transmitting uncorrelated signals via the relays. Next, the maximum expected-rate of ON/OFF based amplify-forward (AF) relaying is analytically derived. For further performance improvement, a hybrid decode-amplify-forward (DAF) relaying strategy, adopting the broadcast approach at the source and relays, is proposed and its maximum throughput and maximum finite-layer expected-rate are presented. Moreover, the maximum throughput and maximum expected-rate in the compress-forward (CF) relaying adopting the broadcast approach, using optimal quantizers and Wyner-Ziv compression at the relays, are fully derived. All theoretical results are illustrated by numerical simulations. As it turns out from the results, when the ratio of the relay power to the source power is high, the CF relaying outperforms DAF (and hence outperforms both DF and AF relaying); otherwise, DAF scheme is superior.

Connected through hyperedge HE-1 (induced by source paper "outage effective capacity of buffer aided diamond relay systems using harq with incremental redundancy"):
  with members:
    - "effective capacity of retransmission schemes a recurrence relation approach"
    - "backlog and delay reasoning in harq systems"
    - "achievable rates for the fading half duplex single relay selection network using buffer aided relaying"
    - "statistical delay tradeoffs in buffer aided two hop wireless communication systems"
    - "using superposition codebooks and partial decode and forward in low snr parallel relay networks"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"

Connected through hyperedge HE-2 (induced by source paper "robust uplink communications over fading channels with variable backhaul connectivity"):
  with members:
    - "robust and efficient distributed compression for cloud radio access networks"
    - "distributed mimo receiver achievable rates and upper bounds"
    - "robust distributed source coding"

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)