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: "data oblivious stream productivity"
  Abstract: We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidable, but for restricted formats computable sufficient conditions can be obtained. The usual analysis disregards the identity of data, thus leading to approaches that we call data-oblivious. We present a method that is provably optimal among all such data-oblivious approaches. This means that in order to improve on the algorithm in this paper one has to proceed in a data-aware fashion.

Connected through hyperedge HE-1 (induced by source paper "almost sure productivity"):
  with members:
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "on the hardness of almost sure termination"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "proving termination of probabilistic programs using patterns"

Connected through hyperedge HE-2 (induced by source paper "coinduction an elementary approach"):
  with members:
    - "on streams that are finitely red"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "miniagda integrating sized and dependent types"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-3 (induced by source paper "coinductive techniques in infinitary lambda calculus"):
  with members:
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "miniagda integrating sized and dependent types"

Connected through hyperedge HE-4 (induced by source paper "on periodically iterated morphisms"):
  with members:
    - "automatic sequences and zip specifications"
    - "complexity of fractran and productivity"
    - "sequences close to periodic"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of equivalence of specifications of infinite objects"):
  with members:
    - "automatic sequences and zip specifications"
    - "complexity of fractran and productivity"

Connected through hyperedge HE-6 (induced by source paper "productivity of non orthogonal term rewrite systems"):
  with members:
    - "stream productivity by outermost termination"
    - "complexity of fractran and productivity"

Connected through hyperedge HE-7 (induced by source paper "automatic sequences and zip specifications"):
  with members:
    - "complexity of fractran and productivity"

Connected through hyperedge HE-8 (induced by source paper "beating the productivity checker using embedded languages"):
  with members:
    - "representations of stream processors using nested fixed points"
    - "using structural recursion for corecursion"
    - "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)