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: "the paths to choreography extraction"
  Abstract: Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification and synthesis of correct-by-construction software. They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most software does not come with choreographies yet, which prevents their application. To attack this problem, previous work investigated choreography extraction, which automatically constructs a choreography that describes the behavior of a given set of programs or protocol specifications.#R##N##R##N#We propose a new extraction methodology that improves on the state of the art: we can deal with programs that are equipped with state and internal computation; time complexity is dramatically better; and we capture programs that work by exploiting asynchronous communication.

Connected through hyperedge HE-1 (induced by source paper "implementing choreography extraction"):
  with members:
    - "timed runtime monitoring for multiparty conversations"

Connected through hyperedge HE-2 (induced by source paper "connectors meet choreographies"):
  with members:
    - "procedural choreographic programming"
    - "dynamic choreographies theory and implementation"
    - "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-3 (induced by source paper "multiparty classical choreographies"):
  with members:
    - "classical higher order processes"

Connected through hyperedge HE-4 (induced by source paper "on asynchrony and choreographies"):
  with members:
    - "applied choreographies"
    - "procedural choreographic programming"
    - "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-5 (induced by source paper "communications in choreographies revisited"):
  with members:
    - "dynamic choreographies theory and implementation"
    - "on asynchrony and choreographies"
    - "a core model for choreographic programming"

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"
    - "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)