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: "quantomatic a proof assistant for diagrammatic reasoning"
  Abstract: Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory, algebraic quantum information, and quantum groups. String diagrams provide a convenient graphical syntax for reasoning formally about such structures, while avoiding many of the technical challenges of a term-based approach. Quantomatic is a tool that supports the (semi-)automatic construction of equational proofs using string diagrams. We briefly outline the theoretical basis of Quantomatic’s rewriting engine, then give an overview of the core features and architecture and give a simple example project that computes normal forms for commutative bialgebras.

Connected through hyperedge HE-1 (induced by source paper "toward certified quantum programming"):
  with members:
    - "reqwire reasoning about reversible quantum circuits"
    - "qdb from quantum algorithms towards correct quantum programs"
    - "a verified optimizer for quantum circuits"
    - "qwire practice formal verification of quantum circuits in coq"
    - "qpcf higher order languages and quantum circuits"
    - "a theorem prover for quantum hoare logic and its applications"
    - "formalization of quantum protocols using coq"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-2 (induced by source paper "a framework for rewriting families of string diagrams"):
  with members:
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "rewriting context free families of string diagrams"
    - "equational reasoning with context free families of string diagrams"
    - "graphs with trivial overlap are context free"
    - "reasoning with graphs"

Connected through hyperedge HE-3 (induced by source paper "a verified optimizer for quantum circuits"):
  with members:
    - "reqwire reasoning about reversible quantum circuits"
    - "next steps in quantum computing computer science s role"
    - "qwire practice formal verification of quantum circuits in coq"
    - "formalization of quantum protocols using coq"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-4 (induced by source paper "a diagrammatic calculus of fermionic quantum circuits"):
  with members:
    - "a diagrammatic axiomatisation for qubit entanglement"

Connected through hyperedge HE-5 (induced by source paper "a diagrammatic axiomatisation of fermionic quantum circuits"):
  with members:
    - "a diagrammatic axiomatisation for qubit entanglement"

Connected through hyperedge HE-6 (induced by source paper "understanding and maintaining tactics graphically or how we are learning that a diagram can be worth more than 10k loc"):
  with members:
    - "a graphical language for proof strategies"
    - "an activity based quality model for maintainability"
    - "a higher order implementation of rewriting"

Connected through hyperedge HE-7 (induced by source paper "globular an online proof assistant for higher dimensional rewriting"):
  with members:
    - "towards 3 dimensional rewriting theory"
    - "polygraphs for termination of left linear term rewriting systems"

Connected through hyperedge HE-8 (induced by source paper "graphs with trivial overlap are context free"):
  with members:
    - "tensors graphs and non commutative quantum structures"
    - "reasoning with graphs"
    - "graphical reasoning in compact closed categories for quantum computation"

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)