human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "uplinks analysis and optimization of hybrid vehicular networks"):
  Abstract: 5G vehicular communication is one of key enablers in next generation intelligent transportation system (ITS), that require ultra-reliable and low latency communication (URLLC). To meet this requirement, a new hybrid vehicular network structure which supports both centralized network structure and distributed structure is proposed in this paper. Based on the proposed network structure, a new vehicular network utility model considering the latency and reliability in vehicular networks is developed based on Euclidean norm theory. Building on the Pareto improvement theory in economics, a vehicular network uplink optimization algorithm is proposed to optimize the uplink utility of vehicles on the roads. Simulation results show that the proposed scheme can significantly improve the uplink vehicular network utility in vehicular networks to meet the URLLC requirements.

Includes members:
  Member "5g software defined vehicular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of urban mmwave multi hop v2v communications with shifted exponential distribution headway")
  Member "multi hop links quality analysis of 5g enabled vehicular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of urban mmwave multi hop v2v communications with shifted exponential distribution headway")
  Member "vehicular communications for 5g cooperative small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ultra reliable low latency communications in autonomous vehicular networks")
  Member "a survey of motion planning and control techniques for self driving urban vehicles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "5g ultra dense cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "energy efficiency evaluation of cellular networks based on spatial distributions of traffic load and power consumption":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an actor critic based uav bss deploymentmethod for dynamic environments")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)