human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "coinduction an elementary approach"):
  Abstract: The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose, we provide a reasonably direct justification for coinductive proofs written in this style, i.e., converting a coinductive proof into a non-coinductive argument is purely a matter of routine. In this way, we provide an elementary explanation of how to interpret coinduction in set theory.

Includes members:
  Member "on streams that are finitely red":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new coinductive confluence proof for infinitary lambda calculus")
  Member "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interaction trees representing recursive and impure programs in coq")
  Member "miniagda integrating sized and dependent types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a type and scope safe universe of syntaxes with binding their semantics and proofs")
  Member "data oblivious stream productivity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "almost sure productivity")
  Member "coinductive big step operational semantics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "program sketching with live bidirectional evaluation")

Question: Please tell me which class the source paper 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)