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: "pamper proof method recommendation system for isabelle hol"
  Abstract: Deciding which sub-tool to use for a given proof state requires expertise specific to each ITP. To mitigate this problem, we present PaMpeR, a Proof Method Recommendation system for Isabelle/HOL. Given a proof state, PaMpeR recommends proof methods to discharge the proof goal and provides qualitative explanations as to why it suggests these methods. PaMpeR generates these recommendations based on existing hand-written proof corpora, thus transferring experienced users' expertise to new users. Our evaluation shows that PaMpeR correctly predicts experienced users' proof methods invocation especially when it comes to special purpose proof methods.

Connected through hyperedge HE-1 (induced by source paper "smart induction for isabelle hol system description"):
  with members:
    - "lifter language to encode induction heuristics for isabelle hol"
    - "towards evolutionary theorem proving for isabelle hol"
    - "goal oriented conjecturing for isabelle hol"
    - "tactictoe learning to reason with hol4 tactics"
    - "a proof strategy language and proof script generation for isabelle hol"

Connected through hyperedge HE-2 (induced by source paper "lifter language to encode induction heuristics for isabelle hol"):
  with members:
    - "goal oriented conjecturing for isabelle hol"
    - "proof mining with dependent types"
    - "tactictoe learning to reason with hol4 tactics"
    - "a proof strategy language and proof script generation for isabelle hol"
    - "proof pattern recognition and lemma discovery in acl2"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-3 (induced by source paper "towards evolutionary theorem proving for isabelle hol"):
  with members:
    - "goal oriented conjecturing for isabelle hol"
    - "towards smart proof search for isabelle"
    - "a proof strategy language and proof script generation for isabelle hol"

Connected through hyperedge HE-4 (induced by source paper "gamepad a learning environment for theorem proving"):
  with members:
    - "learning a sat solver from single bit supervision"
    - "reinforcement learning of theorem proving"
    - "deep learning with dynamic computation graphs"
    - "end to end differentiable proving"
    - "regularizing and optimizing lstm language models"
    - "deep network guided proof search"
    - "holstep a machine learning dataset for higher order logic theorem proving"
    - "tactictoe learning to reason with hol4 tactics"

Connected through hyperedge HE-5 (induced by source paper "towards machine learning induction"):
  with members:
    - "goal oriented conjecturing for isabelle hol"
    - "towards smart proof search for isabelle"
    - "a proof strategy language and proof script generation for isabelle hol"

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)