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: "a core model for choreographic programming"
  Abstract: Choreographic Programming is a paradigm for developing concurrent programs that are deadlock-free by construction, by programming communications declaratively and then synthesising process implementations automatically. Despite strong interest on choreographies, a foundational model that explains which computations can be performed with the hallmark constructs of choreographies is still missing.

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"
    - "dynamic choreographies theory and implementation"
    - "kickstarting choreographic programming"

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

Connected through hyperedge HE-3 (induced by source paper "on asynchrony and choreographies"):
  with members:
    - "applied choreographies"
    - "procedural choreographic programming"
    - "the paths to choreography extraction"
    - "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-4 (induced by source paper "procedural choreographic programming"):
  with members:
    - "choreographies in practice"
    - "dynamic choreographies safe runtime updates of distributed applications"
    - "parameterised multiparty session types"

Connected through hyperedge HE-5 (induced by source paper "the paths to choreography extraction"):
  with members:
    - "choreographies divided and conquered"
    - "choreographies in practice"
    - "dynamic choreographies safe runtime updates of distributed applications"

Connected through hyperedge HE-6 (induced by source paper "communications in choreographies revisited"):
  with members:
    - "dynamic choreographies theory and implementation"
    - "the paths to choreography extraction"
    - "on asynchrony and choreographies"

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)