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: "indexed induction and coinduction fibrationally"
  Abstract: This paper extends the fibrational approach to induction and coinduction#N#pioneered by Hermida and Jacobs, and developed by the current authors, in two#N#key directions. First, we present a dual to the sound induction rule for#N#inductive types that we developed previously. That is, we present a sound#N#coinduction rule for any data type arising as the carrier of the final#N#coalgebra of a functor, thus relaxing Hermida and Jacobs' restriction to#N#polynomial functors. To achieve this we introduce the notion of a quotient#N#category with equality (QCE) that i) abstracts the standard notion of a#N#fibration of relations constructed from a given fibration; and ii) plays a role#N#in the theory of coinduction dual to that played by a comprehension category#N#with unit (CCU) in the theory of induction. Secondly, we show that inductive#N#and coinductive indexed types also admit sound induction and coinduction rules.#N#Indexed data types often arise as carriers of initial algebras and final#N#coalgebras of functors on slice categories, so we give sufficient conditions#N#under which we can construct, from a CCU (QCE) U:E \rightarrow B, a fibration#N#with base B/I that models indexing by I and is also a CCU (resp., QCE). We#N#finish the paper by considering the more general case of sound induction and#N#coinduction rules for indexed data types when the indexing is itself given by a#N#fibration.

Connected through hyperedge HE-1 (induced by source paper "an isbell duality theorem for type refinement systems"):
  with members:
    - "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"
    - "type refinement and monoidal closed bifibrations"
    - "generalizing determinization from automata to coalgebras"
    - "refining inductive types"

Connected through hyperedge HE-2 (induced by source paper "transporting functions across ornaments"):
  with members:
    - "a categorical treatment of ornaments"
    - "refining inductive types"

Connected through hyperedge HE-3 (induced by source paper "from branching to linear time coalgebraically"):
  with members:
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "generic fibrational induction"
    - "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)