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: "generalized diversity multiplexing tradeoff of half duplex relay networks"
  Abstract: Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully characterized, implications are not clear. When all channels in the system are assumed to be independent and identically fading, a fixed schedule where the relay listens half of the total duration for communication and transmits the second half combined with quantize-map-and-forward relaying (static QMF) is known to achieve the full-duplex performance [1]. However, when there is no direct link between the source and the destination, a dynamic decode-and-forward (DDF) strategy is needed [2]. It is not clear which one of these two conclusions would carry to a less idealized setup, where the direct link can be neither as strong as the other links nor fully non-existent. #R##N#In this paper, we provide a generalized diversity-multiplexing trade-off for the half-duplex relay channel which accounts for different channel strengths and recovers the two earlier results as two special cases. We show that these two strategies are sufficient to achieve the diversity-multiplexing trade-off across all channel configurations, by characterizing the best achievable trade-off when channel state information (CSI) is only available at the receivers (CSIR). However, for general relay networks we show that a generalization of these two schemes through a dynamic QMF strategy is needed to achieve optimal performance.

Connected through hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks"):
  with members:
    - "the approximate optimality of simple schedules for half duplex multi relay networks"
    - "wireless network information flow a deterministic approach"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "diversity multiplexing tradeoff of the half duplex relay channel"

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)