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: "sepia search for proofs using inferred automata"
  Abstract: This paper describes SEPIA, a tool for automated proof generation in Coq. SEPIA combines model inference with interactive theorem proving. Existing proof corpora are modelled using state-based models inferred from tactic sequences. These can then be traversed automatically to identify proofs. The SEPIA system is described and its performance evaluated on three Coq datasets. Our results show that SEPIA provides a useful complement to existing automated tactics in Coq.

Connected through hyperedge HE-1 (induced by source paper "learning to prove theorems via interacting with proof assistants"):
  with members:
    - "holist an environment for machine learning of higher order theorem proving"
    - "code2vec learning distributed representations of code"
    - "gamepad a learning environment for theorem proving"
    - "generative code modeling with graphs"
    - "reinforcement learning of theorem proving"
    - "learning to prove with tactics"
    - "end to end differentiable proving"
    - "deep network guided proof search"

Connected through hyperedge HE-2 (induced by source paper "hammering mizar by learning clause guidance"):
  with members:
    - "enigma ng efficient neural and gradient boosted inference guidance for e"
    - "reinforcement learning of theorem proving"
    - "proofwatch watchlist guidance for large theories in e"
    - "enigma efficient learning based inference guiding machine"
    - "monte carlo tableau proof search"
    - "deepmath deep sequence models for premise selection"
    - "xgboost a scalable tree boosting system"
    - "mizar 40 for mizar 40"

Connected through hyperedge HE-3 (induced by source paper "proofwatch watchlist guidance for large theories in e"):
  with members:
    - "mastering chess and shogi by self play with a general reinforcement learning algorithm"
    - "enigma efficient learning based inference guiding machine"
    - "deep network guided proof search"
    - "monte carlo tableau proof search"
    - "tactictoe learning to reason with hol4 tactics"
    - "deepmath deep sequence models for premise selection"
    - "extending e prover with similarity based clause selection strategies"
    - "mizar 40 for mizar 40"

Connected through hyperedge HE-4 (induced by source paper "learning to prove with tactics"):
  with members:
    - "tactictoe learning to reason with hol4 tactics"
    - "internal guidance for satallax"
    - "recycling proof patterns in coq case studies"
    - "machine learning in proof general interfacing interfaces"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-5 (induced by source paper "proof mining with dependent types"):
  with members:
    - "goal translation for a hammer for coq extended abstract"
    - "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-6 (induced by source paper "enigma efficient learning based inference guiding machine"):
  with members:
    - "monte carlo connection prover"
    - "mizar 40 for mizar 40"
    - "machine learner for automated reasoning 0 4 and 0 5"
    - "blistr the blind strategymaker"
    - "males a framework for automatic tuning of automated theorem provers"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-7 (induced by source paper "tactictoe learning to reason with hol4 tactics"):
  with members:
    - "internal guidance for satallax"
    - "learning assisted theorem proving with millions of lemmas"
    - "recycling proof patterns in coq case studies"
    - "blistr the blind strategymaker"
    - "machine learning in proof general interfacing interfaces"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-8 (induced by source paper "a proof strategy language and proof script generation for isabelle hol"):
  with members:
    - "close encounters of the higher kind emulating constructor classes in standard ml"
    - "a formally verified compiler back end"
    - "the foundation of a generic theorem prover"

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)