human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "type checking liveness for collaborative processes with bounded and unbounded recursion"):
  Abstract: We present the first session typing system guaranteeing request-response#N#liveness properties for possibly non-terminating communicating processes. The#N#types augment the branch and select types of the standard binary session types#N#with a set of required responses, indicating that whenever a particular label#N#is selected, a set of other labels, its responses, must eventually also be#N#selected. We prove that these extended types are strictly more expressive than#N#standard session types. We provide a type system for a process calculus similar#N#to a subset of collaborative BPMN processes with internal (data-based) and#N#external (event-based) branching, message passing, bounded and unbounded#N#looping. We prove that this type system is sound, i.e., it guarantees#N#request-response liveness for dead-lock free processes. We exemplify the use of#N#the calculus and type system on a concrete example of an infinite state system.

Includes members:
  Member "multiparty compatibility in communicating automata characterisation and synthesis of global session types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "verifying asynchronous interactions via communicating session automata")
  Member "from lock freedom to progress using session types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "comparing type systems for deadlock freedom")
  Member "a graphical approach to progress for structured communication in web services":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "comparing type systems for deadlock freedom")
  Member "explicit fairness in testing semantics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "progress justness and fairness")

Question: Please tell me which class the source paper 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)