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 "transparent synchronous dataflow"):
  Abstract: There are several functional approaches to dataflow programming, produced by varying the level of abstraction of the language. The level of abstraction has immediate impact on the trade-offs between effectiveness (how easy it is to write correct programs) and efficiency (time and space costs of execution) that the language makes. In this paper we present a language for dataflow programming which operates at higher level of abstraction, by making events and the switching infrastructure transparent. To solve the problem of potentially infinite computation in cyclic dataflow networks we adopt a synchronous mode of propagation, leading to a novel language design which we call transparent synchronous dataflow (TSD). This language is semantically defined using a graph-rewriting abstract machine, which gives a cost-accurate execution model. Using it, we prove three main results: safety of execution, implementation-independent efficiency, and deterministic execution for concurrent update. We also provide a semi-naive concrete implementation as an OCaml PPX extension which we use to compare it with similar languages via benchmarks.

Includes members:
  Member "the dynamic geometry of interaction machine a call by need graph rewriter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the dynamic geometry of interaction machine a token guided graph rewriter")
  Member "the complexity of abstract machines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the dynamic geometry of interaction machine a token guided graph rewriter")
  Member "the geometry of parallelism classical probabilistic and quantum effects":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the abstract machinery of interaction long version")
  Member "tensorflow a system for large scale machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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.PL(Programming Languages)