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: "resource allocation for low latency vehicular communications with packet retransmission"
  Abstract: Vehicular communications have stringent latency requirements on safety-critical information transmission. However, lack of instantaneous channel state information due to high mobility poses a great challenge to meet these requirements and the situation gets more complicated when packet retransmission is considered. Based on only the obtainable large-scale fading channel information, this paper performs spectrum and power allocation to maximize the ergodic capacity of vehicular-to-infrastructure (V2I) links while guaranteeing the latency requirements of vehicular-to-vehicular (V2V) links. First, for each possible spectrum reusing pair of a V2I link and a V2V link, we obtain the closed-form expression of the packets' average sojourn time (the queueing time plus the service time) for the V2V link. Then, an optimal power allocation is derived for each possible spectrum reusing pair. Afterwards, we optimize the spectrum reusing pattern by addressing a polynomial time solvable bipartite matching problem. Numerical results show that the proposed queueing analysis is accurate in terms of the average packet sojourn time. Moreover, the developed resource allocation always guarantees the V2V links' requirements on latency.

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)