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: "the redprl proof assistant invited paper"
  Abstract: RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory. In the style of Nuprl, RedPRL users employ tactics to establish behavioral properties of cubical functional programs embodying the constructive content of proofs. Notably, RedPRL implements a two-level type theory, allowing an extensional, proof-irrelevant notion of exact equality to coexist with a higher-dimensional proof-relevant notion of paths.

Connected through hyperedge HE-1 (induced by source paper "a cubical language for bishop sets"):
  with members:
    - "cubical syntax for reflection free extensional equality"
    - "pointers in recursion exploring the tropics"
    - "design and implementation of the andromeda proof assistant"
    - "computational higher type theory iii univalent universes and exact equality"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"
    - "programming with algebraic effects and handlers"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"

Connected through hyperedge HE-2 (induced by source paper "qed at large a survey of engineering of formally verified software"):
  with members:
    - "bridging the gap between programming languages and hardware weak memory models"
    - "automatic software repair a bibliography"
    - "verifying strong eventual consistency in distributed systems"
    - "algebraic foundations of proof refinement"
    - "deep network guided proof search"
    - "understanding and maintaining tactics graphically or how we are learning that a diagram can be worth more than 10k loc"
    - "gradual certified programming in coq"
    - "automatic and transparent transfer of theorems along isomorphisms in the coq proof assistant"

Connected through hyperedge HE-3 (induced by source paper "cubical syntax for reflection free extensional equality"):
  with members:
    - "algebraic type theory and universe hierarchies"
    - "on higher inductive types in cubical type theory"
    - "canonicity and normalisation for dependent type theory"
    - "design and implementation of the andromeda proof assistant"
    - "undecidability of equality in the free locally cartesian closed category extended version"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"

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)