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: "spectrum sharing between cooperative relay and ad hoc networks dynamic transmissions under computation and signaling limitations"
  Abstract: This paper studies a spectrum sharing scenario between an uplink cognitive relay network (CRN) and some nearby low power ad-hoc networks. In particular, the dynamic resource allocation of the CRN is analyzed, which aims to minimize the average interfering time with the ad-hoc networks subject to a minimal average uplink throughput constraint. A long term average rate formula is considered, which is achieved by a half-duplex decode-and-forward (DF) relay strategy with multi-channel transmissions. Both the source and relay are allowed to queue their data, by which they can adjust the transmission rates flexibly based on sensing and predicting the channel state and ad-hoc traffic. The dynamic resource allocation of the CRN is formulated as a non-convex stochastic optimization problem. By carefully analyzing the optimal transmission time scheduling, it is reduced to a stochastic convex optimization problem and solved by the dual optimization method. The signaling and computation processes are designed carefully to reduce the computations at the source (mobile terminal, MT). The time delay between spectrum sensing and the transmission period is quite short to guarantee the accuracy of ad-hoc traffic prediction. The key idea to achieve these benefits is making use of the analytical structure of the optimal solution. Numerical results are presented to show the benefits of our spectrum sharing strategy.

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)