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: "decidable inductive invariants for verification of cryptographic protocols with unbounded sessions"
  Abstract: We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied pi-calculus, with applications to automatic verification of stateful cryptographic protocols with unbounded sessions/nonces. Since in the presence of unbounded sessions any trace property becomes undecidable, we focus on (i) depth-bounded protocols, a generalisation of a class of infinite-state protocols proposed by D'Osualdo, Ong and Tiu; and (ii) downward-closed properties, which include many security properties such as absence of leaks of secrets. #R##N#We study the structure of depth-bounded protocols within the framework of ideal completions for well-structured transition systems. Our main contribution is a class of expressions, called limits, that are shown sound and complete for representing infinite downward-closed sets of configurations of depth-bounded protocols. We provide direct algorithms to prove that a given limit is an inductive invariant for a protocol. Inductive invariants of this form can be inferred, and represent an independently checkable certificate of correctness. To evaluate whether the approach is viable, we provide a prototype implementation and we report on its performance on some illustrative examples.

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)