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 approach and oblivious cooperative strategies for the wireless relay channel part i sequential decode and forward sdf"
  Abstract: In this two part paper we consider a wireless network in which a source terminal communicates with a destination and a relay terminal is occasionally present in close proximity to the source without source's knowledge, suggesting oblivious protocols. The source-relay channel is assumed to be a fixed gain AWGN due to the proximity while the source-destination and the relay-destination channels are subject to a block flat Rayleigh fading. A perfect CSI at the respective receivers only is assumed. With the average throughput as a performance measure, we incorporate a two-layer broadcast approach into two cooperative strategies based on the decode-and-forward scheme - Sequential Decoded-and Forward (SDF) in part I and the Block-Markov (BM) in part II. The broadcast approach splits the transmitted rate into superimposed layers corresponding to a "bad" and a "good" channel states, allowing better adaptation to the actual channel conditions In part I, the achievable rate expressions for the SDF strategy are derived under the broadcast approach for multiple settings including single user, MISO and the general relay setting using successive decoding technique, both numerically and analytically. Continuous broadcasting lower bounds are derived for the MISO and an oblivious cooperation scenarios.

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)