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: "automated analysis of aodv using uppaal"
  Abstract: This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh networks. #R##N#We give a brief overview of a model of AODV implemented in the UPPAAL model checker. It is derived from a process-algebraic model which reflects precisely the intention of AODV and accurately captures the protocol specification. Furthermore, we describe experiments carried out to explore AODV's behaviour in all network topologies up to 5 nodes. We were able to automatically locate problematic and undesirable behaviours. This is in particular useful to discover protocol limitations and to develop improved variants. This use of model checking as a diagnostic tool complements other formal-methods-based protocol modelling and verification techniques, such as process algebra.

Connected through hyperedge HE-1 (induced by source paper "formal verification of a programmable hypersurface"):
  with members:
    - "uppaal smc statistical model checking for priced timed automata"

Connected through hyperedge HE-2 (induced by source paper "ensuring liveness properties of distributed systems a research agenda"):
  with members:
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "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"
    - "on characterising distributability"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-3 (induced by source paper "reliable restricted process theory"):
  with members:
    - "a process algebra for wireless mesh networks"
    - "showing invariance compositionally for a process algebra for network protocols"

Connected through hyperedge HE-4 (induced by source paper "modelling verification and comparative performance analysis of the b a t m a n protocol"):
  with members:
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "uppaal smc statistical model checking for priced timed automata"

Connected through hyperedge HE-5 (induced by source paper "modelling and verifying the aodv routing protocol"):
  with members:
    - "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"
    - "a rigorous analysis of aodv and its variants"

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

Connected through hyperedge HE-7 (induced by source paper "a process algebra for wireless mesh networks"):
  with members:
    - "modelling mac layer communications in wireless systems"
    - "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"
    - "modelling probabilistic wireless networks"
    - "a timed calculus for mobile ad hoc networks"

Connected through hyperedge HE-8 (induced by source paper "applying formal methods to networking theory techniques and applications"):
  with members:
    - "a review of automated formal verification of ad hoc routing protocols for wireless sensor networks"
    - "toward synthesis of network updates"
    - "uppaal smc statistical model checking for priced timed automata"
    - "statistical model checking an overview"

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)