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: "abstract gsos rules and a modular treatment of recursive definitions"
  Abstract: Terminal coalgebras for a functor serve as semantic domains for state-based#N#systems of various types. For example, behaviors of CCS processes, streams,#N#infinite trees, formal languages and non-well-founded sets form terminal#N#coalgebras. We present a uniform account of the semantics of recursive#N#definitions in terminal coalgebras by combining two ideas: (1) abstract GSOS#N#rules l specify additional algebraic operations on a terminal coalgebra; (2)#N#terminal coalgebras are also initial completely iterative algebras (cias). We#N#also show that an abstract GSOS rule leads to new extended cia structures on#N#the terminal coalgebra. Then we formalize recursive function definitions#N#involving given operations specified by l as recursive program schemes for l,#N#and we prove that unique solutions exist in the extended cias. From our results#N#it follows that the solutions of recursive (function) definitions in terminal#N#coalgebras may be used in subsequent recursive definitions which still have#N#unique solutions. We call this principle modularity. We illustrate our results#N#by the five concrete terminal coalgebras mentioned above, e.\,g., a finite#N#stream circuit defines a unique stream function.

Connected through hyperedge HE-1 (induced by source paper "companions causality and codensity"):
  with members:
    - "stream differential equations specification formats and solution methods"
    - "the largest respectful function"
    - "coinduction up to in a fibrational setting"
    - "coalgebraic characterizations of context free languages"

Connected through hyperedge HE-2 (induced by source paper "foundational extensible corecursion"):
  with members:
    - "programming and reasoning with guarded recursion for coinductive types"
    - "co recursion in logic programming lazy vs eager"
    - "parametricity in an impredicative sort"
    - "miniagda integrating sized and dependent types"
    - "a formally verified compiler back end"
    - "set theory for verification i from foundations to functions"
    - "set theory for verification ii induction and recursion"

Connected through hyperedge HE-3 (induced by source paper "programming and reasoning with guarded recursion for coinductive types"):
  with members:
    - "sequent calculus in the topos of trees"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-4 (induced by source paper "gsos for non deterministic processes with quantitative aspects"):
  with members:
    - "on coalgebras with internal moves"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"
    - "bisimulation of labeled state to function transition systems of stochastic process languages"
    - "uniform labeled transition systems for nondeterministic probabilistic and stochastic process calculi"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

Connected through hyperedge HE-5 (induced by source paper "co algebraic foundations for effectful recursive definitions"):
  with members:
    - "programming with algebraic effects and handlers"
    - "handling algebraic effects"
    - "a coinductive calculus for asynchronous side effecting processes"
    - "generic trace semantics via coinduction"

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)