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 process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
  Abstract: We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures. #R##N#In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group. #R##N#We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects. #R##N#The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants. #R##N#Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy.

Connected through hyperedge HE-1 (induced by source paper "ensuring liveness properties of distributed systems open problems"):
  with members:
    - "progress justness and fairness"
    - "reward testing equivalences for processes"
    - "justness a completeness criterion for capturing liveness properties"
    - "analysing mutual exclusion using process algebra with signals"
    - "lean and full congruence formats for recursion"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
    - "progress fairness and justness in process algebra"

Connected through hyperedge HE-2 (induced by source paper "justness a completeness criterion for capturing liveness properties"):
  with members:
    - "progress justness and fairness"
    - "analysing mutual exclusion using process algebra with signals"
    - "ensuring liveness properties of distributed systems a research agenda"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks"
    - "on characterising distributability"
    - "on synchronous and asynchronous interaction in distributed systems"

Connected through hyperedge HE-3 (induced by source paper "progress justness and fairness"):
  with members:
    - "analysing mutual exclusion using process algebra with signals"
    - "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks"
    - "explicit fairness in testing semantics"

Connected through hyperedge HE-4 (induced by source paper "a process algebra for link layer protocols"):
  with members:
    - "a process algebra for wireless mesh networks"

Connected through hyperedge HE-5 (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"
    - "automated analysis of aodv using uppaal"
    - "a process algebra for wireless mesh networks"
    - "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-6 (induced by source paper "analysing mutual exclusion using process algebra with signals"):
  with members:
    - "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
    - "progress fairness and justness in process algebra"
    - "automated analysis of mutex algorithms with fase"
    - "read operators and their expressiveness in process algebras"

Connected through hyperedge HE-7 (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"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "a rigorous analysis of aodv and its variants"

Connected through hyperedge HE-8 (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"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "a rigorous analysis of aodv and its variants"

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)