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: "a rigorous analysis of aodv and its variants"
  Abstract: In this paper we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol using a formal specification in AWN (Algebra for Wireless Networks), a process algebra which has been specifically 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 correctness properties by providing a detailed proof of loop freedom. In contrast to evaluations using simulation or other formal methods such as model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, traffic pattern, etc. A key contribution of this paper is the demonstration of how the reasoning and proofs can relatively easily be adapted to protocol variants.

Connected through hyperedge HE-1 (induced by source paper "an efficient loop free version of adovv2"):
  with members:
    - "modelling and verifying the aodv routing protocol"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "modelling and verifying the aodv routing protocol"):
  with members:
    - "automated analysis of aodv using uppaal"
    - "a process algebra for wireless mesh networks"
    - "showing invariance compositionally for a process algebra for network protocols"
    - "a mechanized proof of loop freedom of the untimed aodv routing protocol"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a timed process algebra for wireless networks"):
  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"

Connected through hyperedge HE-4 (induced by source paper "sequence numbers do not guarantee loop freedom aodv can yield routing loops"):
  with members:
    - "automated analysis of aodv using uppaal"
    - "a process algebra for wireless mesh networks"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"

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)