human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "graphs with trivial overlap are context free":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a framework for rewriting families of string diagrams")
  Member "tinker tailor solver proof":
    also connected through other hyperedges:
      (none)
  Member "tensors graphs and non commutative quantum structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tensors graphs and non commutative quantum structures extended version")
  Member "reasoning with graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a framework for rewriting families of string diagrams")
  Member "synthesising graphical theories":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nets relations and linking diagrams")
  Member "experimental support for a categorical compositional distributional model of meaning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "incremental monoidal grammars")
  Member "mathematical foundations for a compositional distributional model of meaning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tensor networks for language modeling")

Question: Please tell me which class the source paper 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)