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: "a coinductive calculus for asynchronous side effecting processes"
  Abstract: We present an abstract framework for concurrent processes in which atomic steps have generic side effects, handled according to the principle of monadic encapsulation of effects. Processes in this framework are potentially infinite resumptions, modelled using final coalgebras over the monadic base. As a calculus for such processes, we introduce a concurrent extension of Moggi's monadic metalanguage of effects. We establish soundness and completeness of a natural equational axiomatisation of this calculus. Moreover, we identify a corecursion scheme that is explicitly definable over the base language and provides flexible expressive means for the definition of new operators on processes, such as parallel composition. As a worked example, we prove the safety of a generic mutual exclusion scheme using a verification logic built on top of the equational calculus.

Connected through hyperedge HE-1 (induced by source paper "interaction trees representing recursive and impure programs in coq"):
  with members:
    - "from c to interaction trees specifying verifying and testing a networked server"
    - "programming with algebraic effects and handlers"
    - "handling algebraic effects"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "coinductive big step operational semantics"
    - "general recursion via coinductive types"

Connected through hyperedge HE-2 (induced by source paper "guarded and unguarded iteration for generalized processes"):
  with members:
    - "guarded traced categories"
    - "guard your daggers and traces properties of guarded co recursion"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"
    - "complete elgot monads and coalgebraic resumptions"
    - "some remarks on conway and iteration theories"
    - "a hoare logic for the coinductive trace based big step semantics of while"
    - "coalgebraic infinite traces and kleisli simulations"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-3 (induced by source paper "complete elgot monads and coalgebraic resumptions"):
  with members:
    - "linear encodings of bounded ltl model checking"
    - "general recursion via coinductive types"

Connected through hyperedge HE-4 (induced by source paper "co algebraic foundations for effectful recursive definitions"):
  with members:
    - "programming with algebraic effects and handlers"
    - "handling algebraic effects"
    - "abstract gsos rules and a modular treatment of recursive definitions"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-5 (induced by source paper "coinductive big step semantics for concurrency"):
  with members:
    - "a hoare logic for the coinductive trace based big step semantics of while"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "coinductive big step operational semantics"
    - "general recursion via coinductive types"

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)