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 "cellular cohomology in homotopy type theory"):
  Abstract: We present a development of cellular cohomology in homotopy type theory. Cohomology associates to each space a sequence of abelian groups capturing part of its structure, and has the advantage over homotopy groups in that these abelian groups of many common spaces are easier to compute in many cases. Cellular cohomology is a special kind of cohomology designed for cell complexes: these are built in stages by attaching spheres of progressively higher dimension, and cellular cohomology defines the groups out of the combinatorial description of how spheres are attached. Our main result is that for finite cell complexes, a wide class of cohomology theories (including the ones defined through Eilenberg-MacLane spaces) can be calculated via cellular cohomology. This result was formalized in the Agda proof assistant.

Includes members:
  Member "computational higher type theory iv inductive types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "naive cubical type theory")
  Member "on higher inductive types in cubical type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructing higher inductive types as groupoid quotients")
  Member "computational higher type theory iii univalent universes and exact equality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a cubical language for bishop sets")
  Member "homotopy type theory in lean":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a formal proof of hensel s lemma over the p adic integers")
  Member "stack semantics of type theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "synthetic topology in homotopy type theory for probabilistic programming")
  Member "the hott library a formalization of homotopy type theory in coq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "synthetic topology in homotopy type theory for probabilistic programming")
  Member "cubical type theory a constructive interpretation of the univalence axiom":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a cubical language for bishop sets")
  Member "computational higher type theory i abstract cubical realizability":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "computational higher type theory iv inductive types")

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)