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 complexity of abstract machines"
  Abstract: The lambda-calculus is a peculiar computational model whose definition does not come with a notion of machine. Unsurprisingly, implementations of the lambda-calculus have been studied for decades. Abstract machines are implementations schema for fixed evaluation strategies that are a compromise between theory and practice: they are concrete enough to provide a notion of machine and abstract enough to avoid the many intricacies of actual implementations. There is an extensive literature about abstract machines for the lambda-calculus, and yet-quite mysteriously-the efficiency of these machines with respect to the strategy that they implement has almost never been studied. #R##N#This paper provides an unusual introduction to abstract machines, based on the complexity of their overhead with respect to the length of the implemented strategies. It is conceived to be a tutorial, focusing on the case study of implementing the weak head (call-by-name) strategy, and yet it is an original re-elaboration of known results. Moreover, some of the observation contained here never appeared in print before.

Connected through hyperedge HE-1 (induced by source paper "transparent synchronous dataflow"):
  with members:
    - "the dynamic geometry of interaction machine a call by need graph rewriter"
    - "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 dynamic geometry of interaction machine a call by need graph rewriter"
    - "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 "efficient implementation of evaluation strategies via token guided graph rewriting"):
  with members:
    - "the dynamic geometry of interaction machine a call by need graph rewriter"
    - "leftmost outermost beta reduction is invariant indeed"

Connected through hyperedge HE-4 (induced by source paper "the dynamic geometry of interaction machine a call by need graph rewriter"):
  with members:
    - "linear dependent types and relative completeness"

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)