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 software package for chemically inspired graph transformation"
  Abstract: Chemical reaction networks can be automatically generated from graph grammar descriptions, where transformation rules model reaction patterns. Because a molecule graph is connected and reactions in general involve multiple molecules, the transformation must be performed on multisets of graphs. We present a general software package for this type of graph transformation system, which can be used for modelling chemical systems. The package contains a C++ library with algorithms for working with transformation rules in the Double Pushout formalism, e.g., composition of rules and a domain specific language for programming graph language generation. A Python interface makes these features easily accessible. The package also has extensive procedures for automatically visualising not only graphs and transformation rules, but also Double Pushout diagrams and graph languages in form of directed hypergraphs. The software 1 ar X iv :1 60 3. 02 48 1v 2 [ cs .F L ] 2 1 A pr 2 01 6 is available as an open source package, and interactive examples can be found on the accompanying webpage.

Connected through hyperedge HE-1 (induced by source paper "tracelets and tracelet analysis of compositional rewriting systems"):
  with members:
    - "compositionality of rewriting rules with conditions"
    - "sesqui pushout rewriting concurrency associativity and rule algebra framework"
    - "rule algebras for adhesive categories"
    - "inferring chemical reaction patterns using rule composition in graph grammars"

Connected through hyperedge HE-2 (induced by source paper "compositionality of rewriting rules with conditions"):
  with members:
    - "combinatorial conversion and moment bisimulation for stochastic rewriting systems"
    - "sesqui pushout rewriting concurrency associativity and rule algebra framework"
    - "rule algebras for adhesive categories"

Connected through hyperedge HE-3 (induced by source paper "a graph based tool to embed the π calculus into a computational dpo framework"):
  with members:
    - "better late than never a fully abstract semantics for classical processes"
    - "a generic framework for engineering graph canonization algorithms"
    - "generic strategies for chemical space exploration"

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