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: "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
  Abstract: We look at the operational semantics of languages with interactive I/O through the glasses of constructive type theory. Following on from our earlier work on coinductive trace-based semantics for While [17], we define several big-step semantics for Whil e with interactive I/O, based on resumptions and termination-sensitive weak bisimilarity. These require nesting inductive definitions in coinductive definitions, which is interesting both mathe matically and from the point-of-view of implementation in a proof assistant. After first defining a basic semantics of statements in terms o f resumptions with explicit internal actions (delays), we introduce a semantics in terms of delay-free resumptions that essentially removes finite sequences of delays on the fly from those resumptions th at are responsive. Finally, we also look at a semantics in terms of delay-free resumptions supplemented with a silent divergence option. This semantics hinges on decisions between convergence and divergence and is only equivalent to the basic one classically. We have fully formalized our development in Coq.

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"
    - "a coinductive calculus for asynchronous side effecting processes"
    - "coinductive big step operational semantics"
    - "general recursion via coinductive types"

Connected through hyperedge HE-2 (induced by source paper "a metalanguage for guarded iteration"):
  with members:
    - "guarded traced categories"
    - "a semantics for hybrid iteration"
    - "guard your daggers and traces properties of guarded co recursion"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "complete elgot monads and coalgebraic resumptions"
    - "a decidable weakening of compass logic based on cone shaped cardinal directions"
    - "a hoare logic for the coinductive trace based big step semantics of while"
    - "intensionality definability and computation"

Connected through hyperedge HE-3 (induced by source paper "a new coinductive confluence proof for infinitary lambda calculus"):
  with members:
    - "coinductive foundations of infinitary rewriting and infinitary equational logic"
    - "strict ideal completions of the lambda calculus"
    - "coinduction an elementary approach"
    - "partial order infinitary term rewriting"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "on streams that are finitely red"
    - "infinitary combinatory reduction systems normalising reduction strategies"
    - "infinitary combinatory reduction systems confluence"

Connected through hyperedge HE-4 (induced by source paper "flag based big step semantics"):
  with members:
    - "normalization by evaluation in the delay monad a case study for coinduction via copatterns and sized types"
    - "coinductive big step semantics for concurrency"
    - "miniagda integrating sized and dependent types"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-5 (induced by source paper "a hoare logic for the coinductive trace based big step semantics of while"):
  with members:
    - "mechanized semantics for the clight subset of the c language"
    - "coinductive big step operational semantics"
    - "generic trace semantics via coinduction"
    - "general recursion via coinductive types"

Connected through hyperedge HE-6 (induced by source paper "coinduction an elementary approach"):
  with members:
    - "on streams that are finitely red"
    - "miniagda integrating sized and dependent types"
    - "data oblivious stream productivity"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-7 (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"
    - "a coinductive calculus for asynchronous side effecting processes"
    - "coinductive big step operational semantics"
    - "general recursion via coinductive types"

Connected through hyperedge HE-8 (induced by source paper "resumption based big step and small step interpreters for while with interactive i o"):
  with members:
    - "generic trace semantics via coinduction"
    - "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)