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 in communicating automata characterisation and synthesis of global session types"
  Abstract: Multiparty session types are a type system that can ensure the safety and liveness of distributed peers via the global specification of their interactions. To construct a global specification from a set of distributed uncontrolled behaviours, this paper explores the problem of fully characterising multiparty session types in terms of communicating automata. We equip global and local session types with labelled transition systems (LTSs) that faithfully represent asynchronous communications through unbounded buffered channels. Using the equivalence between the two LTSs, we identify a class of communicating automata that exactly correspond to the projected local types. We exhibit an algorithm to synthesise a global type from a collection of communicating automata. The key property of our findings is the notion of multiparty compatibility which non-trivially extends the duality condition for binary session types.

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"
    - "multiparty compatibility for concurrent objects"
    - "timed runtime monitoring for multiparty conversations"
    - "multiparty session actors"
    - "propositional dynamic logic for message passing systems"

Connected through hyperedge HE-2 (induced by source paper "service equivalence via multiparty session type isomorphisms"):
  with members:
    - "dynamic choreographies theory and implementation"
    - "mutually testing processes"
    - "globally governed session semantics"
    - "session type isomorphisms"

Connected through hyperedge HE-3 (induced by source paper "a sound algorithm for asynchronous session subtyping and its implementation"):
  with members:
    - "verifying asynchronous interactions via communicating session automata"
    - "on the boundary between decidability and undecidability of asynchronous session subtyping"
    - "undecidability of asynchronous session subtyping"

Connected through hyperedge HE-4 (induced by source paper "domain aware session types extended version"):
  with members:
    - "information flow safety in multiparty sessions"
    - "soft session types"

Connected through hyperedge HE-5 (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"
    - "a core model for choreographic programming"

Connected through hyperedge HE-6 (induced by source paper "applied choreographies"):
  with members:
    - "dynamic choreographies safe runtime updates of distributed applications"
    - "multiparty session actors"
    - "aiocj a choreographic framework for safe adaptive distributed applications"

Connected through hyperedge HE-7 (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"
    - "choreographies in practice"
    - "dynamic choreographies safe runtime updates of distributed applications"

Connected through hyperedge HE-8 (induced by source paper "timed session types"):
  with members:
    - "combining behavioural types with security analysis"
    - "timed runtime monitoring for multiparty conversations"
    - "honesty by typing"

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.FL(Formal Languages and Automata Theory)