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: "choreographies in practice"
  Abstract: Choreographic Programming is a development methodology for concurrent software that guarantees correctness by construction. The key to this paradigm is to disallow mismatched I/O operations in programs, and mechanically synthesise process implementations.#R##N##R##N#There is still a lack of practical illustrations of the applicability of choreographies to computational problems with standard concurrent solutions. In this work, we explore the potential of choreographic programming by writing concurrent algorithms for sorting, solving linear equations, and computing Fast Fourier Transforms. The lessons learned from this experiment give directions for future improvements of the paradigm.

Connected through hyperedge HE-1 (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"
    - "dynamic choreographies safe runtime updates of distributed applications"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

Connected through hyperedge HE-2 (induced by source paper "procedural choreographic programming"):
  with members:
    - "a core model for choreographic programming"
    - "dynamic choreographies safe runtime updates of distributed applications"
    - "parameterised multiparty session types"

Connected through hyperedge HE-3 (induced by source paper "the paths to choreography extraction"):
  with members:
    - "a core model for choreographic programming"
    - "choreographies divided and conquered"
    - "dynamic choreographies safe runtime updates of distributed applications"

Connected through hyperedge HE-4 (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"
    - "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)