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: "porgy strategy driven interactive transformation of graphs"
  Abstract: This paper investigates the use of graph rewriting systems as a modelling tool, and advocates the embedding of such systems in an interactive environment. One important application domain is the modelling of biochemical systems, where states are represented by port graphs and the dynamics is driven by rules and strategies. A graph rewriting tool's capability to interactively explore the features of the rewriting system provides useful insights into possible behaviours of the model and its properties. We describe PORGY, a visual and interactive tool we have developed to model complex systems using port graphs and port graph rewrite rules guided by strategies, and to navigate in the derivation history. We demonstrate via examples some functionalities provided by PORGY.

Connected through hyperedge HE-1 (induced by source paper "a language for describing optimization strategies"):
  with members:
    - "tvm an automated end to end optimizing compiler for deep learning"
    - "tiramisu a polyhedral compiler for expressing fast and portable code"
    - "strategy preserving compilation for parallel functional code"

Connected through hyperedge HE-2 (induced by source paper "a software package for chemically inspired graph transformation"):
  with members:
    - "the graph grammar library a generic framework for chemical graph rewrite systems"
    - "generic strategies for chemical space exploration"
    - "inferring chemical reaction patterns using rule composition in graph grammars"

Connected through hyperedge HE-3 (induced by source paper "a simple parallel implementation of interaction nets in haskell"):
  with members:
    - "towards a gpu based implementation of interaction nets"
    - "an implementation of nested pattern matching in interaction nets"
    - "pelcr parallel environment for optimal lambda calculus reduction"

Connected through hyperedge HE-4 (induced by source paper "strategic port graph rewriting an interactive modelling and analysis framework"):
  with members:
    - "extensional and intensional strategies"

Connected through hyperedge HE-5 (induced by source paper "a rewriting point of view on strategies"):
  with members:
    - "extensional and intensional strategies"

Connected through hyperedge HE-6 (induced by source paper "generic strategies for chemical space exploration"):
  with members:
    - "strategic programming on graph rewriting systems"

Connected through hyperedge HE-7 (induced by source paper "extending the interaction nets calculus by generic rules"):
  with members:
    - "an implementation of nested pattern matching in interaction nets"

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.CE(Computational Engineering, Finance, and Science)