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 safe runtime updates of distributed applications"
  Abstract: Programming distributed applications free from communication deadlocks and races is complex. Preserving these properties when applications are updated at runtime is even harder. We present DIOC, a language for programming distributed applications that are free from deadlocks and races by construction. A DIOC program describes a whole distributed application as a unique entity (choreography). DIOC allows the programmer to specify 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 site, in a lower-level language called DPOC. We formalise both DIOC and DPOC semantics as labelled transition systems and prove the correctness of the compilation as a trace equivalence result. As corollaries, DPOC applications are free from communication deadlocks and races, even in presence of runtime updates.

Connected through hyperedge HE-1 (induced by source paper "applied choreographies"):
  with members:
    - "multiparty session actors"
    - "aiocj a choreographic framework for safe adaptive distributed applications"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

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

Connected through hyperedge HE-3 (induced by source paper "dynamic choreographies theory and implementation"):
  with members:
    - "kickstarting choreographic programming"
    - "aiocj a choreographic framework for safe adaptive distributed applications"
    - "hop and hiphop multitier web orchestration"
    - "on global types and multi party session"

Connected through hyperedge HE-4 (induced by source paper "procedural choreographic programming"):
  with members:
    - "a core model for choreographic programming"
    - "choreographies in practice"
    - "parameterised multiparty session types"

Connected through hyperedge HE-5 (induced by source paper "the paths to choreography extraction"):
  with members:
    - "a core model for choreographic programming"
    - "choreographies divided and conquered"
    - "choreographies in practice"

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

Connected through hyperedge HE-7 (induced by source paper "choreographies in practice"):
  with members:
    - "choreographies divided and conquered"
    - "kickstarting choreographic programming"
    - "parameterised multiparty session types"

Connected through hyperedge HE-8 (induced by source paper "an abstract semantics of the global view of choreographies"):
  with members:
    - "on global types and multi party session"

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)