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 proof theoretic analysis of intruder theories"
  Abstract: We consider the problem of intruder deduction in security protocol analysis:#N#that is, deciding whether a given message M can be deduced from a set of#N#messages Gamma under the theory of blind signatures and arbitrary convergent#N#equational theories modulo associativity and commutativity (AC) of certain#N#binary operators. The traditional formulations of intruder deduction are#N#usually given in natural-deduction-like systems and proving decidability#N#requires significant effort in showing that the rules are "local" in some#N#sense. By using the well-known translation between natural deduction and#N#sequent calculus, we recast the intruder deduction problem as proof search in#N#sequent calculus, in which locality is immediate. Using standard proof#N#theoretic methods, such as permutability of rules and cut elimination, we show#N#that the intruder deduction problem can be reduced, in polynomial time, to the#N#elementary deduction problem, which amounts to solving certain equations in the#N#underlying individual equational theories. We show that this result extends to#N#combinations of disjoint AC-convergent theories whereby the decidability of#N#intruder deduction under the combined theory reduces to the decidability of#N#elementary deduction in each constituent theory. To further demonstrate the#N#utility of the sequent-based approach, we show that, for Dolev-Yao intruders,#N#our sequent-based techniques can be used to solve the more difficult problem of#N#solving deducibility constraints, where the sequents to be deduced may contain#N#gaps (or variables) representing possible messages the intruder may produce.

Connected through hyperedge HE-1 (induced by source paper "discovering epassport vulnerabilities using bisimilarity"):
  with members:
    - "a method for unbounded verification of privacy type properties"
    - "the applied pi calculus mobile values new names and secure communication"

Connected through hyperedge HE-2 (induced by source paper "decidable inductive invariants for verification of cryptographic protocols with unbounded sessions"):
  with members:
    - "approaching the coverability problem continuously"
    - "forward analysis for wsts part i completions"

Connected through hyperedge HE-3 (induced by source paper "elementary deduction problem for locally stable theories with normal forms"):
  with members:
    - "yapa a generic tool for computing intruder knowledge"
    - "a trace based bisimulation for the spi calculus"

Connected through hyperedge HE-4 (induced by source paper "a logic of interactive proofs formal theory of knowledge transfer"):
  with members:
    - "logic of non monotonic interactive proofs"
    - "knowledge and common knowledge in a distributed environment"

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)