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 "a framework for rewriting families of string diagrams"):
  Abstract: We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free graph grammars. We model equations between infinite families of diagrams using rewrite rules between context-free grammars. Our framework represents equational reasoning about concrete string diagrams and context-free families of string diagrams using double-pushout rewriting on graphs and context-free graph grammars respectively. We prove that our representation is sound by showing that it respects the concrete semantics of string diagrammatic reasoning and we show that our framework is appropriate for software implementation by proving the membership problem is decidable.

Includes members:
  Member "enriching a linear non linear lambda calculus a programming language for string diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "realizability in the unitary sphere")
  Member "rewriting context free families of string diagrams":
    also connected through other hyperedges:
      (none)
  Member "equational reasoning with context free families of string diagrams":
    also connected through other hyperedges:
      (none)
  Member "quantomatic a proof assistant for diagrammatic reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward certified quantum programming")
  Member "graphs with trivial overlap are context free":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantomatic a proof assistant for diagrammatic reasoning")
  Member "reasoning with graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantomatic a proof assistant for diagrammatic reasoning")

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.FL(Formal Languages and Automata Theory)