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: "a proof strategy language and proof script generation for isabelle hol"
  Abstract: We introduce a language, PSL, designed to capture high level proof strategies in Isabelle/HOL. Given a strategy and a proof obligation, PSL's runtime system generates and combines various tactics to explore a large search space with low memory usage. Upon success, PSL generates an efficient proof script, which bypasses a large part of the proof search. We also present PSL's monadic interpreter to show that the underlying idea of PSL is transferable to other ITPs.

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"
    - "pamper proof method recommendation system for isabelle hol"
    - "goal oriented conjecturing for isabelle hol"
    - "tactictoe learning to reason with hol4 tactics"

Connected through hyperedge HE-2 (induced by source paper "lifter language to encode induction heuristics for isabelle hol"):
  with members:
    - "pamper proof method recommendation system for isabelle hol"
    - "goal oriented conjecturing for isabelle hol"
    - "proof mining with dependent types"
    - "tactictoe learning to reason with hol4 tactics"
    - "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:
    - "pamper proof method recommendation system for isabelle hol"
    - "goal oriented conjecturing for isabelle hol"
    - "towards smart proof search for isabelle"

Connected through hyperedge HE-4 (induced by source paper "domain specific language to encode induction heuristics"):
  with members:
    - "lifter language to encode induction heuristics for isabelle hol"

Connected through hyperedge HE-5 (induced by source paper "pamper proof method recommendation system for isabelle hol"):
  with members:
    - "deep network guided proof search"
    - "tactictoe learning to reason with hol4 tactics"
    - "deepmath deep sequence models for premise selection"
    - "machine learning in proof general interfacing interfaces"

Connected through hyperedge HE-6 (induced by source paper "towards machine learning induction"):
  with members:
    - "pamper proof method recommendation system for isabelle hol"
    - "goal oriented conjecturing for isabelle hol"
    - "towards smart proof search for isabelle"

Connected through hyperedge HE-7 (induced by source paper "goal oriented conjecturing for isabelle hol"):
  with members:
    - "sharing hol4 and hol light proof knowledge"
    - "hipster integrating theory exploration in a proof assistant"

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)