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: "linear lambda calculus with explicit substitutions as proof search in deep inference"
  Abstract: SBV is a deep inference system that extends the set of logical operators of multiplicative linear logic with the non commutative operator seq. We introduce the logical system SBVr which extends SBV by adding a self-dual atom-renaming operator to it. We prove that the cut elimination holds on SBVr. SBVr and its cut free subsystem BVr are complete and sound with respect to linear Lambda calculus with explicit substitutions. Under any strategy, a sequence of evaluation steps of any linear � -term M becomes a process of proof-search in SBVr (BVr) once M is mapped into a formula of SBVr. Completeness and soundness follow from simulating linear� -reduction with explicit substitutions as processes. The role of the new renaming operator of SBVr is to rename channel-names on-demand. This simulates the substitution that occurs in a� -reduction. Despite SBVr is a minimal extension of SBV its proof-search can compute all boolean functions, as linear lambda calculus with explicit substitutio ns can compute all boolean functions as well. So, proof search of SBVr and BVr is at least ptime-complete.

Connected through hyperedge HE-1 (induced by source paper "a deep inference system with a self dual binder which is complete for linear lambda calculus"):
  with members:
    - "communication and concurrency with logic based restriction inside a calculus of structures"
    - "a system of interaction and structure"
    - "linear encodings of bounded ltl model checking"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-2 (induced by source paper "communication and concurrency with logic based restriction inside a calculus of structures"):
  with members:
    - "a system of interaction and structure"

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)