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 "random linear multihop relaying in a general field of interferers using spatial aloha"):
  Abstract: In our basic model, we study a stationary Poisson pattern of nodes on a line embedded in an independent planar Poisson field of interfering nodes. Assuming slotted Aloha and the signal-to-interference-and-noise ratio capture condition, with the usual power-law path loss model and Rayleigh fading, we explicitly evaluate several local and end-to-end performance characteristics related to the nearest-neighbor packet relaying on this line, and study their dependence on the model parameters (the density of relaying and interfering nodes, Aloha tuning and the external noise power). Our model can be applied in two cases: the first use is for vehicular ad-hoc networks, where vehicles are randomly located on a straight road. The second use is to study a typical route traced in a (general) planar ad-hoc network by some routing mechanism. The approach we have chosen allows us to quantify the non-efficiency of long-distance routing in pure ad-hoc networks and evaluate a possible remedy for it in the form of additional fixed relaying nodes, called road-side units in a vehicular network. It also allows us to consider a more general field of interfering nodes and study the impact of the clustering of its nodes the routing performance. As a special case of a field with more clustering than the Poison field, we consider a Poisson-line field of interfering nodes, in which all the nodes are randomly located on random straight lines. The comparison to our basic model reveals a paradox: clustering of interfering nodes decreases the outage probability of a single (typical) transmission on the route, but increases the mean end-to-end delay.

Includes members:
  Member "managing interference correlation through random medium access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "packet travel times in wireless relay chains under spatially and temporally dependent interference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "temporal correlation of interference and outage in mobile networks over one dimensional finite regions")
  Member "stochastic analysis of non slotted aloha in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analyzing lora long range low power wide area networks using stochastic geometry")
  Member "a new phase transitions for local delays in manets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "information propagation speed in mobile and delay tolerant networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")
  Member "outage local throughput and capacity of random wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "modeling analysis and mitigation of dynamic botnet formation in wireless iot networks")

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)