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: "multiparty compatibility for concurrent objects"
  Abstract: Objects and actors are communicating state machines, offering and consuming different services at#R##N#different points in their lifecycle. Two complementary challenges arise when programming such#R##N#systems. When objects interact, their state machines must be “compatible”, so that services are#R##N#requested only when they are available. Dually, when objects refine other objects, their state machines#R##N#must be “compliant”, so that services are honoured whenever they are promised.#R##N#In this paper we show how the idea of multiparty compatibility from the session types literature#R##N#can be applied to both of these problems. We present an untyped language in which concurrent objects#R##N#are checked automatically for compatibility and compliance. For simple objects, checking can be#R##N#exhaustive and has the feel of a type system. More complex objects can be partially validated via test#R##N#cases, leading to a methodology closer to continuous testing. Our proof-of-concept implementation#R##N#is limited in some important respects, but demonstrates the potential value of the approach and the#R##N#relationship to existing software development practices.

Connected through hyperedge HE-1 (induced by source paper "verifying asynchronous interactions via communicating session automata"):
  with members:
    - "on the completeness of verifying message passing programs under bounded asynchrony"
    - "synchronizability of communicating finite state machines is not decidable"
    - "timed runtime monitoring for multiparty conversations"
    - "multiparty session actors"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"
    - "propositional dynamic logic for message passing systems"

Connected through hyperedge HE-2 (induced by source paper "liveness for verification"):
  with members:
    - "incremental computation with names"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

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)