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: "parameterized verification of safety properties in ad hoc network protocols"
  Abstract: We summarize the main results proved in recent work on the parameterized veriﬁcation of safetyproperties for ad hoc network protocols. We consider a model in which the communication topologyof a network is represented as a graph. Nodes represent states of individual processes. Adjacentnodes represent single-hop neighbors. Processes are ﬁnite state automata that communicate via se-lective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For thismodel we consider a decision problem that can be expressed as the veriﬁcation of the existence ofan initial topology in which the execution of the protocol can lead to a conﬁguration with at leastone node in a certain state. The decision problem is parametric both on the size and on the form ofthe communication topology of the initial conﬁgurations. We draw a complete picture of the decid-ability and complexity boundaries of this problem according to various assumptions on the possibletopologies.

Connected through hyperedge HE-1 (induced by source paper "parametric timed broadcast protocols"):
  with members:
    - "what s decidable about parametric timed automata"
    - "language emptiness of continuous time parametric timed automata"

Connected through hyperedge HE-2 (induced by source paper "modeling and efficient verification of wireless ad hoc networks"):
  with members:
    - "modelling and verifying the aodv routing protocol"
    - "automated analysis of aodv using uppaal"
    - "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.LO(Logic in Computer Science)