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: "the dynamic geometry of interaction machine a call by need graph rewriter"
  Abstract: Girard's Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming language semantics. One way is to use abstract machines that pass a token on a fixed graph along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated computation by repeating the same moves of a token on the fixed graph. Although they can be adapted to obtain sound models with regard to the equational theories of various evaluation strategies for the lambda calculus, it can be at the expense of significant time costs. In this paper we show a token-passing abstract machine that can implement evaluation strategies for the lambda calculus, with certified time efficiency. Our abstract machine, called the Dynamic GoI Machine (DGoIM), rewrites the graph to avoid replicating computation, using the token to find the redexes. The flexibility of interleaving token transitions and graph rewriting allows the DGoIM to balance the trade-off of space and time costs. This paper shows that the DGoIM can implement call-by-need evaluation for the lambda calculus by using a strategy of interleaving token passing with as much graph rewriting as possible. Our quantitative analysis confirms that the DGoIM with this strategy of interleaving the two kinds of possible operations on graphs can be classified as "efficient" following Accattoli's taxonomy of abstract machines.

Connected through hyperedge HE-1 (induced by source paper "transparent synchronous dataflow"):
  with members:
    - "the complexity of abstract machines"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-2 (induced by source paper "the dynamic geometry of interaction machine a token guided graph rewriter"):
  with members:
    - "efficient implementation of evaluation strategies via token guided graph rewriting"
    - "the complexity of abstract machines"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "leftmost outermost beta reduction is invariant indeed"
    - "linear dependent types and relative completeness"

Connected through hyperedge HE-3 (induced by source paper "proof nets and the linear substitution calculus"):
  with members:
    - "leftmost outermost beta reduction is invariant indeed"
    - "evaluating functions as processes"
    - "proof nets and the call by value lambda calculus"
    - "preservation of strong normalisation modulo permutations for the structural lambda calculus"

Connected through hyperedge HE-4 (induced by source paper "efficient implementation of evaluation strategies via token guided graph rewriting"):
  with members:
    - "the complexity of abstract machines"
    - "leftmost outermost beta reduction is invariant indeed"

Connected through hyperedge HE-5 (induced by source paper "abductive functional programming a semantic approach"):
  with members:
    - "tensorflow large scale machine learning on heterogeneous distributed systems"

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