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: "incremental computation with names"
  Abstract: Over the past thirty years, there has been significant progress in developing general-purpose, language-based approaches to incremental computation, which aims to efficiently update the result of a computation when an input is changed. A key design challenge in such approaches is how to provide efficient incremental support for a broad range of programs. In this paper, we argue that first-class names are a critical linguistic feature for efficient incremental computation. Names identify computations to be reused across differing runs of a program, and making them first class gives programmers a high level of control over reuse. We demonstrate the benefits of names by presenting Nominal Adapton, an ML-like language for incremental computation with names. We describe how to use Nominal Adapton to efficiently incrementalize several standard programming patterns---including maps, folds, and unfolds---and show how to build efficient, incremental probabilistic trees and tries. Since Nominal Adapton's implementation is subtle, we formalize it as a core calculus and prove it is from-scratch consistent, meaning it always produces the same answer as simply re-running the computation. Finally, we demonstrate that Nominal Adapton can provide large speedups over both from-scratch computation and Adapton, a previous state-of-the-art incremental computation system.

Connected through hyperedge HE-1 (induced by source paper "foundations of a live data exploration environment"):
  with members:
    - "live functional programming with typed holes"
    - "exploratory and live programming and coding a literature study comparing perspectives on liveness"
    - "types from data making structured data first class citizens in f"
    - "hazelnut a bidirectionally typed structure editor calculus"
    - "denotation of contextual modal type theory cmtt syntax and meta programming"

Connected through hyperedge HE-2 (induced by source paper "the meaning of a program change is a change to the program s meaning"):
  with members:
    - "live functional programming with typed holes"
    - "imperative functional programs that explain their work"
    - "hazelnut a bidirectionally typed structure editor calculus"

Connected through hyperedge HE-3 (induced by source paper "a survey of state management in big data processing systems"):
  with members:
    - "elasticutor rapid elasticity for realtime stateful stream processing"
    - "incremental query processing on big data streams"
    - "integrative dynamic reconfiguration in a parallel stream processing engine"
    - "frogwild fast pagerank approximations on graph engines"
    - "s store streaming meets transaction processing"
    - "tolerating correlated failures in massively parallel stream processing engines"
    - "when two choices are not enough balancing at scale in distributed stream processing"
    - "the power of both choices practical load balancing for distributed stream processing engines"

Connected through hyperedge HE-4 (induced by source paper "liveness for verification"):
  with members:
    - "multiparty compatibility for concurrent objects"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

Connected through hyperedge HE-5 (induced by source paper "a vision for online verification validation"):
  with members:
    - "sound and complete bidirectional typechecking for higher rank polymorphism with existentials and indexed types"
    - "dependent types for javascript"

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)