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: "proof irrelevant model of cc with predicative induction and judgmental equality"
  Abstract: We present a set-theoretic, proof-irrelevant model for Calculus of#N#Constructions (CC) with predicative induction and judgmental equality in#N#Zermelo-Fraenkel set theory with an axiom for countably many inaccessible#N#cardinals. We use Aczel's trace encoding which is universally defined for any#N#function type, regardless of being impredicative. Direct and concrete#N#interpretations of simultaneous induction and mutually recursive functions are#N#also provided by extending Dybjer's interpretations on the basis of Aczel's#N#rule sets. Our model can be regarded as a higher-order generalization of the#N#truth-table methods. We provide a relatively simple consistency proof of type#N#theory, which can be used as the basis for a theorem prover.

Connected through hyperedge HE-1 (induced by source paper "wave equation numerical resolution a comprehensive mechanized proof of a c program"):
  with members:
    - "type classes for efficient exact real arithmetic in coq"
    - "a computer verified monadic functional implementation of the integral"
    - "formal proof of a wave equation resolution scheme the method error"
    - "certified exact transcendental real number computation in coq"
    - "a decision procedure for linear big o equations"
    - "certification of bounds on expressions involving rounded operators"

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)