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 "modelling and verifying the aodv routing protocol"):
  Abstract: This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored for the modelling of mobile ad hoc networks and wireless mesh network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol properties by providing detailed proofs of loop freedom and route correctness.

Includes members:
  Member "automated analysis of aodv using uppaal":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "formal verification of a programmable hypersurface")
  Member "a process algebra for wireless mesh networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "showing invariance compositionally for a process algebra for network protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliable restricted process theory")
  Member "a mechanized proof of loop freedom of the untimed aodv routing protocol":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "split send reassemble a formal specification of a can bus protocol stack")
  Member "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "sequence numbers do not guarantee loop freedom aodv can yield routing loops":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ensuring liveness properties of distributed systems a research agenda")
  Member "a rigorous analysis of aodv and its variants":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an efficient loop free version of adovv2")

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)