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 deep inference system with a self dual binder which is complete for linear lambda calculus"
  Abstract: We recall that SBV, a proof system developed under the methodology of deep inference, extends multiplicative linear logic with the self-dual non-commutative logical operator Seq. We introduce SBVQ that extends SBV by adding the self-dual quantifier Sdq. The system SBVQ is consistent because we prove that (the analogous of) cut elimination holds for it. Its new logical operator Sdq operationally behaves as a binder, in a way that the interplay between Seq, and Sdq can model {\beta}-reduction of linear {\lambda}-calculus inside the cut-free subsystem BVQ of SBVQ. The long term aim is to keep developing a programme whose goal is to give pure logical accounts of computational primitives under the proof-search-as-computation analogy, by means of minimal, and incremental extensions of SBV.

Connected through hyperedge HE-1 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic"):
  with members:
    - "subatomic proof systems splittable systems"
    - "private names in non commutative logic"
    - "interaction and depth against nondeterminism in proof search"
    - "on the proof complexity of deep inference"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-2 (induced by source paper "subatomic proof systems splittable systems"):
  with members:
    - "interaction and depth against nondeterminism in proof search"
    - "on the proof complexity of deep inference"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-3 (induced by source paper "subatomic systems need not be subatomic"):
  with members:
    - "subatomic proof systems splittable systems"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-4 (induced by source paper "private names in non commutative logic"):
  with members:
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "a quasipolynomial cut elimination procedure in deep inference via atomic flows and threshold formulae"
    - "on the proof complexity of deep inference"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

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)