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: "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.

Connected through hyperedge HE-1 (induced by source paper "an efficient loop free version of adovv2"):
  with members:
    - "a process algebra for wireless mesh networks"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "a rigorous analysis of aodv and its variants"

Connected through hyperedge HE-2 (induced by source paper "split send reassemble a formal specification of a can bus protocol stack"):
  with members:
    - "mechanizing a process algebra for network protocols"
    - "a process algebra for wireless mesh networks"
    - "a mechanized proof of loop freedom of the untimed aodv routing protocol"

Connected through hyperedge HE-3 (induced by source paper "modeling and efficient verification of wireless ad hoc networks"):
  with members:
    - "automated analysis of aodv using uppaal"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "parameterized verification of safety properties in ad hoc network protocols"

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.NI(Networking and Internet Architecture)