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: "on the mints hierarchy in first order intuitionistic logic"
  Abstract: We stratify intuitionistic first-order logic over $(\forall,\to)$ into#N#fragments determined by the alternation of positive and negative occurrences of#N#quantifiers (Mints hierarchy).#N#  We study the decidability and complexity of these fragments. We prove that#N#even the $\Delta_2$ level is undecidable and that $\Sigma_1$ is#N#Expspace-complete. We also prove that the arity-bounded fragment of $\Sigma_1$#N#is complete for co-Nexptime.

Connected through hyperedge HE-1 (induced by source paper "goal translation for a hammer for coq extended abstract"):
  with members:
    - "congruence closure in intensional type theory"
    - "mizar 40 for mizar 40"
    - "developments in formal proofs"
    - "learning assisted automated reasoning with flyspeck"

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)