human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "learning to prove theorems via interacting with proof assistants"):
  Abstract: Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by entering tactics into the proof assistant. In this paper, we study the problem of using machine learning to automate the interaction with proof assistants. We construct CoqGym, a large-scale dataset and learning environment containing 71K human-written proofs from 123 projects developed with the Coq proof assistant. We develop ASTactic, a deep learning-based model that generates tactics as programs in the form of abstract syntax trees (ASTs). Experiments show that ASTactic trained on CoqGym can generate effective tactics and can be used to prove new theorems not previously provable by automated methods. Code is available at this https URL.

Includes members:
  Member "holist an environment for machine learning of higher order theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "teaching temporal logics to neural networks")
  Member "code2vec learning distributed representations of code":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial robustness for code")
  Member "gamepad a learning environment for theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "elementary logic in linear space")
  Member "generative code modeling with graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial robustness for code")
  Member "reinforcement learning of theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")
  Member "learning to prove with tactics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for synthesizing functions in higher order logic")
  Member "end to end differentiable proving":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "knowledge graphs")
  Member "deep network guided proof search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "teaching temporal logics to neural networks")

Question: Please tell me which class the source paper 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)