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: "hol y hammer online atp service for hol light"
  Abstract: HOL(y)Hammer is an online AI/ATP service for formal (computer-understandable) mathematics encoded in the HOL Light system. The service allows its users to upload and automatically process an arbitrary formal development (project) based on HOL Light, and to attack arbitrary conjectures that use the concepts defined in some of the uploaded projects. For that, the service uses several automated reasoning systems combined with several premise selection methods trained on all the project proofs. The projects that are readily available on the server for such query answering include the recent versions of the Flyspeck, Multivariate Analysis and Complex Analysis libraries. The service runs on a 48-CPU server, currently employing in parallel for each task 7 AI/ATP combinations and 4 decision procedures that contribute to its overall performance. The system is also available for local installation by interested users, who can customize it for their own proof development. An Emacs interface allowing parallel asynchronous queries to the service is also provided. The overall structure of the service is outlined, problems that arise and their solutions are discussed, and an initial account of using the system is given.

Connected through hyperedge HE-1 (induced by source paper "enigma anonymous symbol independent inference guiding machine system description"):
  with members:
    - "enigmawatch proofwatch meets enigma"
    - "hammering mizar by learning clause guidance"
    - "property invariant embedding for automated reasoning"
    - "enigma efficient learning based inference guiding machine"
    - "xgboost a scalable tree boosting system"
    - "sharing hol4 and hol light proof knowledge"
    - "premise selection and external provers for hol4"
    - "mizar 40 for mizar 40"

Connected through hyperedge HE-2 (induced by source paper "the space of mathematical software systems a survey of paradigmatic systems"):
  with members:
    - "otter 3 3 reference manual"

Connected through hyperedge HE-3 (induced by source paper "a survey on theorem provers in formal methods"):
  with members:
    - "comparison of two theorem provers isabelle hol and coq"
    - "the boyer moore waterfall model revisited"
    - "reinforcement learning of theorem proving"
    - "qwire practice formal verification of quantum circuits in coq"
    - "proofwatch watchlist guidance for large theories in e"
    - "verifying asymptotic time complexity of imperative programs in isabelle"
    - "formalized lambek calculus in higher order logic hol4"
    - "the x86isa books features usage and future plans"

Connected through hyperedge HE-4 (induced by source paper "mathematical reasoning in latent space"):
  with members:
    - "can neural networks learn symbolic rewriting"
    - "model based reinforcement learning for atari"
    - "graph representations for higher order logic and theorem proving"
    - "learning to reason in large theories without imitation"
    - "using state predictions for value regularization in curiosity driven deep reinforcement learning"
    - "learning heuristics for automated reasoning through deep reinforcement learning"
    - "large scale study of curiosity driven learning"
    - "recurrent world models facilitate policy evolution"

Connected through hyperedge HE-5 (induced by source paper "computer aided proofs for multiparty computation with active security"):
  with members:
    - "how to simulate it in isabelle towards formal proof for secure multi party computation"
    - "verified low level programming embedded in f"
    - "wys a verified language extension for secure multi party computations"
    - "the foundational cryptography framework"

Connected through hyperedge HE-6 (induced by source paper "bootstrapping lcf declarative proofs"):
  with members:
    - "proofpeer collaborative theorem proving"
    - "a higher order implementation of rewriting"

Connected through hyperedge HE-7 (induced by source paper "testing a saturation based theorem prover experiences and challenges extended version"):
  with members:
    - "selecting the selection"

Connected through hyperedge HE-8 (induced by source paper "towards the integration of an intuitionistic first order prover into coq"):
  with members:
    - "certified connection tableaux proofs for hol light and tptp"

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.AI(Artificial Intelligence)