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 mechanized proof of loop freedom of the untimed aodv routing protocol"
  Abstract: The (AODV) routing protocol allows the nodes in a (MANET) or a (WMN) to know where to forward data packets. Such a protocol is ‘loop free’ if it never leads to routing decisions that forward packets in circles. This paper describes the mechanization of an existing pen-and-paper proof of loop freedom of AODV in the interactive theorem prover Isabelle/HOL. The mechanization relies on a novel compositional approach for lifting invariants to networks of nodes. We exploit the mechanization to analyse several improvements of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid.

Connected through hyperedge HE-1 (induced by source paper "split send reassemble a formal specification of a can bus protocol stack"):
  with members:
    - "modelling and verifying the aodv routing protocol"
    - "mechanizing a process algebra for network protocols"
    - "a process algebra for wireless mesh networks"

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 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-3 (induced by source paper "mechanizing a process algebra for network protocols"):
  with members:
    - "a process algebra for wireless mesh networks"
    - "showing invariance compositionally for a process algebra for network protocols"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "isabelle jedit a prover ide within the pide framework"
    - "verifying safety properties with the tla proof system"

Connected through hyperedge HE-4 (induced by source paper "showing invariance compositionally for a process algebra for network protocols"):
  with members:
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "isabelle jedit a prover ide within the pide framework"
    - "verifying safety properties with the tla proof system"

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)