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: "applied choreographies"
  Abstract: Choreographic Programming is a correct-by-construction paradigm for distributed programming, where global declarative descriptions of communications (choreographies) are used to synthesise deadlock-free processes. Choreographies are global descriptions of communications in concurrent systems, which have been used in different methodologies for the verification or synthesis of programs. However, there is no formalisation that provides a chain of correctness from choreographies to their implementations. This problem originates from the gap between previous theoretical models, which abstract communications using channel names (\`a la CCS/$\pi$-calculus), and their implementations, which use low-level mechanisms for message routing. As a solution, we propose the framework of Applied Choreographies (AC). In AC, programmers write choreographies in a language that follows the standard syntax and semantics of previous works. Then, choreographies are compiled to a real-world execution model for Service-Oriented Computing (SOC). To manage the complexity of this task, our compilation happens in three steps, respectively dealing with: implementing name-based communications using the concrete mechanism found in SOC, projecting a choreography to a set of processes, and translating processes to a distributed implementation in terms of services. For each step a suitable correspondence result guarantees that the behaviour is preserved, thus ensuring the correctness of the global compilation process. This is the first correctness result of an end-to-end translation from standard choreographies to programs based on a "real-world" communication mechanism.

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"
    - "serverless computing current trends and open problems"
    - "dynamic choreographies theory and implementation"
    - "a core model for choreographic programming"
    - "kickstarting choreographic programming"

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

Connected through hyperedge HE-3 (induced by source paper "a core model for choreographic programming"):
  with members:
    - "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"
    - "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)