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 "characterizing shortest paths in road systems modeled as manhattan poisson line processes"):
  Abstract: In this paper, we model a transportation network by a Cox process where the road systems are modeled by a Manhattan Poisson line process (MPLP) and the locations of vehicles and desired destination sites, such as gas stations or charging stations, referred to as facilities, are modeled by independent 1D Poisson point processes (PPP) on each of the lines. For this setup, we characterize the length of the shortest path between a typical vehicular user and its nearest facility that can be reached by traveling along the streets. For a typical vehicular user starting from an intersection, we derive the closed-form expression for the exact cumulative distribution function (CDF) of the length of the shortest path to its nearest facility in the sense of path distance. Building on this result, we derive an upper bound and a remarkably accurate but approximate lower bound on the CDF of the shortest path distance to the nearest facility for a typical vehicle starting from an arbitrary position on a road. These results can be interpreted as nearest-neighbor distance distributions (in terms of the path distance) for this Cox process, which is a key technical contribution of this paper. In addition to these analytical results, we also present a simulation procedure to characterize any distance-dependent cost metric between a typical vehicular user and its nearest facility in the sense of path distance using graphical interpretation of the spatial model. We also discuss extension of this work to other cost metrics and possible applications to the areas of urban planning, personnel deployment and wireless communication.

Includes members:
  Member "spatial networks with wireless applications":
    also connected through other hyperedges:
      (none)
  Member "poisson cox point processes for vehicular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coverage and rate analysis of downlink cellular vehicle to everything c v2x communication")
  Member "success probability and area spectral efficiency of a vanet modeled as a cox process":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coverage and rate analysis of downlink cellular vehicle to everything c v2x communication")
  Member "an analytical framework for coverage in cellular networks leveraging vehicles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how to dimension radio resources when users are distributed on roads modeled by poisson line process")
  Member "coverage analysis of a vehicular network modeled as cox process driven by poisson line process":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how to dimension radio resources when users are distributed on roads modeled by poisson line process")
  Member "mmwave vehicle to infrastructure communication analysis of urban microcellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coverage and rate analysis of downlink cellular vehicle to everything c v2x communication")

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.IT(Information Theory)