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: "goal translation for a hammer for coq extended abstract"
  Abstract: Hammers are tools that provide general purpose automation for formal proof assistants. Despite the gaining popularity of the more advanced versions of type theory, there are no hammers for such systems. We present an extension of the various hammer components to type theory: (i) a translation of a significant part of the Coq logic into the format of automated proof systems; (ii) a proof reconstruction mechanism based on a Ben-Yelles-type algorithm combined with limited rewriting, congruence closure and a first-order generalization of the left rules of Dyckhoff's system LJT.

Connected through hyperedge HE-1 (induced by source paper "concrete semantics with coq and coqhammer"):
  with members:
    - "developing corpus based translation methods between informal and formal mathematics project description"

Connected through hyperedge HE-2 (induced by source paper "proof mining with dependent types"):
  with members:
    - "sepia search for proofs using inferred automata"
    - "learning assisted theorem proving with millions of lemmas"
    - "hipster integrating theory exploration in a proof assistant"
    - "mining state based models from proof corpora"
    - "recycling proof patterns in coq case studies"
    - "lemma mining over hol light"
    - "proof pattern recognition and lemma discovery in acl2"
    - "machine learning in proof general interfacing interfaces"

Connected through hyperedge HE-3 (induced by source paper "deepalgebra an outline of a program"):
  with members:
    - "deepmath deep sequence models for premise selection"
    - "mizar 40 for mizar 40"
    - "proof pattern search in coq ssreflect"
    - "developments in formal proofs"
    - "hott formalisation in coq dependency graphs ml4pg"
    - "theorem proving in large formal mathematics as an emerging ai field"

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)