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: "parameterised multiparty session types"
  Abstract: For many application-level distributed protocols and parallel algorithms, the#N#set of participants, the number of messages or the interaction structure are#N#only known at run-time. This paper proposes a dependent type theory for#N#multiparty sessions which can statically guarantee type-safe, deadlock-free#N#multiparty interactions among processes whose specifications are parameterised#N#by indices. We use the primitive recursion operator from G\"odel's System T to#N#express a wide range of communication patterns while keeping type checking#N#decidable. To type individual distributed processes, a parameterised global#N#type is projected onto a generic generator which represents a class of all#N#possible end-point types. We prove the termination of the type-checking#N#algorithm in the full system with both multiparty session types and recursive#N#types. We illustrate our type theory through non-trivial programming and#N#verification examples taken from parallel algorithms and Web services usecases.

Connected through hyperedge HE-1 (induced by source paper "a session type system for asynchronous unreliable broadcast communication"):
  with members:
    - "session types for broadcasting"
    - "on global types and multi party session"

Connected through hyperedge HE-2 (induced by source paper "taming concurrency for verification using multiparty session types technical report"):
  with members:
    - "analysing and comparing encodability criteria"

Connected through hyperedge HE-3 (induced by source paper "multiparty dependent session types extended abstract"):
  with members:
    - "dependent session types"
    - "session types in a linearly typed multi threaded lambda calculus"

Connected through hyperedge HE-4 (induced by source paper "depending on session typed processes"):
  with members:
    - "efficient csl model checking using stratification"
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-5 (induced by source paper "procedural choreographic programming"):
  with members:
    - "a core model for choreographic programming"
    - "choreographies in practice"
    - "dynamic choreographies safe runtime updates of distributed applications"

Connected through hyperedge HE-6 (induced by source paper "choreographies in practice"):
  with members:
    - "choreographies divided and conquered"
    - "kickstarting choreographic programming"
    - "dynamic choreographies safe runtime updates of distributed applications"

Connected through hyperedge HE-7 (induced by source paper "a theory of available by design communicating systems"):
  with members:
    - "timed runtime monitoring for multiparty conversations"

Connected through hyperedge HE-8 (induced by source paper "a typeful characterization of multiparty structured conversations based on binary sessions"):
  with members:
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"
    - "on global types and multi party session"

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.LO(Logic in Computer Science)