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 "comparing type systems for deadlock freedom"):
  Abstract: Communication-centric software systems exhibit non trivial forms of concurrency and distribution, they are expected to respect intended protocols among interacting services, but also to never "get stuck". This intuitive requirement has been expressed by liveness properties such as progress or (dead)lock freedom, various type systems ensure these properties for concurrent processes. Unfortunately, very little is known about the precise relationship between these type systems and the typed processes they induce. #R##N#This paper puts forward the first comparative study of different type systems for enforcing deadlock-freedom in message-passing concurrent processes. We compare two representative classes of deadlock-free typed processes, here denoted L and K. The class L stands out for its canonicity: it results naturally from Curry-Howard interpretations of linear logic propositions as session types. The class K, obtained by encoding session types into Kobayashi's usage types, includes processes not typable in other type systems. #R##N#We show that L is strictly included in K. We also identify the precise condition under which L and K coincide. One key observation is that the degree of sharing between parallel processes determines a new expressiveness hierarchy for typed concurrent processes. Furthermore, we provide two type-preserving procedures for rewriting processes in K into processes in L. Our two procedures suggest that, while effective, the degree of sharing is a rather subtle criterion for distinguishing typed concurrent processes

Includes members:
  Member "comparing deadlock free session typed processes":
    also connected through other hyperedges:
      (none)
  Member "unlocking blocked communicating processes":
    also connected through other hyperedges:
      (none)
  Member "recursive session types revisited":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "comparing deadlock free session typed processes")
  Member "from lock freedom to progress using session types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "type checking liveness for collaborative processes with bounded and unbounded recursion")
  Member "a graphical approach to progress for structured communication in web services":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "type checking liveness for collaborative processes with bounded and unbounded recursion")

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)