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 "compositional reasoning for explicit resource management in channel based concurrency"):
  Abstract: We define a π-calculus variant with a costed semantics where channels are treated as re- sources that must explicitly be allocated before they are us ed and can be deallocated when no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof techniques for comparing behaviour and resource usage effi ciency of concurrent processes. We establish full abstraction results between our coinductiv e definitions and a contextual behavioural preorder describing a notion of process effi ciency wrt. its management of resources. We also jus- tify these definitions and respective proof techniques thro ugh numerous examples and a case study comparing two concurrent implementations of an extensible buffer.

Includes members:
  Member "permission based separation logic for message passing concurrency":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shared contract obedient endpoints")
  Member "a calculus for costed computations":
    also connected through other hyperedges:
      (none)
  Member "resource usage analysis for the pi calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a calculus for modeling floating authorizations")

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)