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 "infinite types infinite data infinite interaction"):
  Abstract: We describe a way to represent computable functions between coinductive types as particular transducers in type theory. This generalizes earlier work on functions between streams by P. Hancock to a much richer class of coinductive types. Those transducers can be defined in dependent type theory without any notion of equality but require inductive-recursive definitions. Most of the properties of these constructions only rely on a mild notion of equality (intensional equality) and can thus be formalized in the dependently typed language Agda.

Includes members:
  Member "bisimulation as path type for guarded recursive types":
    also connected through other hyperedges:
      (none)
  Member "cubical type theory a constructive interpretation of the univalence axiom":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a cubical language for bishop sets")
  Member "non wellfounded trees in homotopy type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "from signatures to monads in unimath")
  Member "a linear category of polynomial functors extensional part":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a linear category of polynomial diagrams")
  Member "a linear category of polynomial diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a linear category of polynomial functors extensional part")
  Member "relating coalgebraic notions of bisimulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the theory of traces for systems with nondeterminism and probability")
  Member "programming interfaces and basic topology":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interaction laws of monads and comonads")
  Member "representations of stream processors using nested fixed points":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the word problem for omega terms over the trotter weil hierarchy")

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)