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: "dynamic choreographies theory and implementation"
  Abstract: Programming distributed applications free from communication deadlocks and race conditions is complex. Preserving these properties when applications are updated at runtime is even harder. We present a choreographic approach for programming updatable, distributed applications. We define a choreography language, called Dynamic Interaction-Oriented Choreography (DIOC), that allows the programmer to specify, from a global viewpoint, which parts of the application can be updated. At runtime, these parts may be replaced by new DIOC fragments from outside the application. DIOC programs are compiled, generating code for each participant in a process-level language called Dynamic Process-Oriented Choreographies (DPOC). We prove that DPOC distributed applications generated from DIOC specifications are deadlock free and race free and that these properties hold also after any runtime update. We instantiate the theoretical model above into a programming framework called Adaptable Interaction-Oriented Choreographies in Jolie (AIOCJ) that comprises an integrated development environment, a compiler from an extension of DIOCs to distributed Jolie programs, and a runtime environment to support their execution.

Connected through hyperedge HE-1 (induced by source paper "no more no less a formal model for serverless computing"):
  with members:
    - "cloud programming simplified a berkeley view on serverless computing"
    - "serverless computing one step forward two steps back"
    - "applied choreographies"
    - "serverless computing current trends and open problems"
    - "a core model for choreographic programming"
    - "kickstarting choreographic programming"

Connected through hyperedge HE-2 (induced by source paper "service equivalence via multiparty session type isomorphisms"):
  with members:
    - "mutually testing processes"
    - "globally governed session semantics"
    - "session type isomorphisms"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

Connected through hyperedge HE-3 (induced by source paper "connectors meet choreographies"):
  with members:
    - "procedural choreographic programming"
    - "the paths to choreography extraction"
    - "on asynchrony and choreographies"
    - "a core model for choreographic programming"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

Connected through hyperedge HE-4 (induced by source paper "communications in choreographies revisited"):
  with members:
    - "the paths to choreography extraction"
    - "on asynchrony and choreographies"
    - "a core model for choreographic programming"

Connected through hyperedge HE-5 (induced by source paper "a core model for choreographic programming"):
  with members:
    - "applied choreographies"
    - "procedural choreographic programming"
    - "the paths to choreography extraction"
    - "that s enough asynchrony with standard choreography primitives"
    - "on asynchrony and choreographies"
    - "choreographies divided and conquered"
    - "choreographies in practice"
    - "kickstarting choreographic programming"

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)