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: "from proof nets to the free autonomous category"
  Abstract: In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subtrees. These trees will be identified according to an equivalence relation based on a simple form of graph rewriting. We show the standard results of sequentialization and strong normalization of cut elimination. In the second part of the paper we show that the identifications enforced on proofs are such that the class of two-conclusion proof nets defines the free *-autonomous category.

Connected through hyperedge HE-1 (induced by source paper "proof nets coends and the yoneda isomorphism"):
  with members:
    - "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"
    - "the relational model is injective for multiplicative exponential linear logic without weakenings"

Connected through hyperedge HE-2 (induced by source paper "coherence for frobenius pseudomonoids and the geometry of linear proofs"):
  with members:
    - "globular an online proof assistant for higher dimensional rewriting"
    - "towards 3 dimensional rewriting theory"
    - "linear logic without units"

Connected through hyperedge HE-3 (induced by source paper "proof equivalence in mll is pspace complete"):
  with members:
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-4 (induced by source paper "on the proof complexity of deep inference"):
  with members:
    - "a quasipolynomial cut elimination procedure in deep inference via atomic flows and threshold formulae"
    - "cirquent calculus deepened"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-5 (induced by source paper "a system of interaction and structure iv the exponentials and decomposition"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "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-6 (induced by source paper "binding bigraphs as symmetric monoidal closed theories"):
  with members:
    - "graphical presentations of symmetric monoidal closed theories"

Connected through hyperedge HE-7 (induced by source paper "proof nets and the identity of proofs"):
  with members:
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"
    - "on the axiomatisation of boolean categories with and without medial"

Connected through hyperedge HE-8 (induced by source paper "on the axiomatisation of boolean categories with and without medial"):
  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)