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 system of interaction and structure"
  Abstract: This article introduces a logical system, called BV, which extends multiplicative linear logic by a noncommutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far, it is not achieved therein. It becomes very natural in a new formalism, called the calculus of structures, which is the main contribution of this work. Structures are formulas subject to certain equational laws typical of sequents. The calculus of structures is obtained by generalizing the sequent calculus in such a way that a new top-down symmetry of derivations is observed, and it employs inference rules that rewrite inside structures at any depth. These properties, in addition to allowing the design of BV, yield a modular proof of cut elimination.

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"
    - "a deep inference system with a self dual binder which is complete for linear lambda calculus"
    - "interaction and depth against nondeterminism in proof search"
    - "on the proof complexity of deep inference"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-2 (induced by source paper "fundamentals of computability logic"):
  with members:
    - "build your own clarithmetic ii soundness"
    - "build your own clarithmetic i setup and completeness"
    - "elementary base cirquent calculus i parallel and choice connectives"
    - "introduction to clarithmetic ii"
    - "the computational complexity of propositional cirquent calculus"
    - "on the system cl12 of computability logic"
    - "a propositional system induced by japaridze s approach to if logic"
    - "expressing algorithms as concise as possible via computability logic"

Connected through hyperedge HE-3 (induced by source paper "constrained path finding and structure from acyclicity"):
  with members:
    - "proof nets through the lens of graph theory a compilation of remarks"
    - "properly coloured cycles and paths results and open problems"

Connected through hyperedge HE-4 (induced by source paper "subatomic proof systems splittable systems"):
  with members:
    - "a deep inference system with a self dual binder which is complete for linear lambda calculus"
    - "interaction and depth against nondeterminism in proof search"
    - "on the proof complexity of deep inference"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-5 (induced by source paper "subatomic systems need not be subatomic"):
  with members:
    - "subatomic proof systems splittable systems"
    - "a deep inference system with a self dual binder which is complete for linear lambda calculus"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-6 (induced by source paper "when you must forget beyond strong persistence when forgetting in answer set programming"):
  with members:
    - "the rise and fall of semantic rule updates based on se models"
    - "the logical difference for the lightweight description logic el"
    - "on the practical use of variable elimination in constraint optimization problems still life as a case study"
    - "semantical characterizations and complexity of equivalences in answer set programming"
    - "an abductive framework for computing knowledge base updates"
    - "propositional independence formula variable independence and forgetting"

Connected through hyperedge HE-7 (induced by source paper "on noncommutative extensions of linear logic"):
  with members:
    - "dialectica categories for the lambek calculus"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-8 (induced by source paper "inducing syntactic cut elimination for indexed nested sequents"):
  with members:
    - "on the correspondence between display postulates and deep inference in nested sequent calculi for tense logics"

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)