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: "delay optimal buffer aware probabilistic scheduling with adaptive transmission"
  Abstract: Cross-layer scheduling is a promising way to improve Quality of Service (QoS) given a power constraint. In this paper, we investigate the system with random data arrival and adaptive transmission. Probabilistic scheduling strategies aware of the buffer state are applied to generalize conventional deterministic scheduling. Based on this, the average delay and power consumption are analysed by Markov reward process. The optimal delay-power tradeoff curve is the Pareto frontier of the feasible delay-power region. It is proved that the optimal delay-power tradeoff is piecewise-linear, whose vertices are obtained by deterministic strategies. Moreover, the corresponding strategies of the optimal tradeoff curve are threshold-based, hence can be obtained by a proposed effective algorithm. On the other hand, we formulate a linear programming to minimize the average delay given a fixed power constraint. By varying the power constraint, the optimal delay-power tradeoff curve can also be obtained. It is demonstrated that the algorithm result and the optimization result match each other, and are further validated by Monte-Carlo simulation.

Connected through hyperedge HE-1 (induced by source paper "delay optimal buffer aware scheduling with adaptive transmission"):
  with members:
    - "dawn delay aware wi fi offloading and network selection"

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)