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: "outage capacity and optimal transmission for dying channels"
  Abstract: In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such circumstances, it is critical to quantify how fast and reliably the information can be collected over attacked links. For a single channel subject to random attacks, named as a dying channel, we model it as a block-fading (BF) channel with a finite and random channel length. For this channel, we first study the outage capacity and the outage probability when the data frame length is fixed and uniform power allocation is assumed. Furthermore, we discuss the optimization over the frame length and/or the power allocation over the constituting data blocks to minimize the outage probability. In addition, we extend the results from the single dying channel to the parallel multi-channel case where each sub-channel is a dying channel, and investigate the asymptotic behavior of the overall outage probability as the number of sub-channels goes to infinity with two different attack models: the independent-attack case and the m-dependent-attack case. It is shown that the asymptotic outage probability diminishes to zero for both cases as the number of sub-channels increases if the rate per unit cost is less than a certain threshold. The outage exponents are also studied to reveal how fast the outage probability improves with the number of sub-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)