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: "automating godel s ontological proof of god s existence with higher order automated theorem provers"
  Abstract: Kurt Godel's ontological argument for God's existence has been formalized and automated on a computer with higher-order automated theorem provers. From Godel's premises, the computer proved: necessarily, there exists God. On the other hand, the theorem provers have also confirmed prominent criticism on Godel's ontological argument, and they found some new results about it.#R##N##R##N#The background theory of the work presented here offers a novel perspective towards a computational theoretical philosophy.

Connected through hyperedge HE-1 (induced by source paper "a simplified supreme being necessarily exists says the computer computationally explored variants of g odel s ontological argument"):
  with members:
    - "computer supported analysis of positive properties ultrafilters and modal collapse in variants of godel s ontological argument"
    - "computer science and metaphysics a cross fertilization"
    - "mechanizing principia logico metaphysica in functional type theory"

Connected through hyperedge HE-2 (induced by source paper "designing normative theories of ethical reasoning formal framework methodology and tool support"):
  with members:
    - "a computational hermeneutic approach for conceptual explicitation"
    - "grunge a grand unified atp challenge"
    - "computer science and metaphysics a cross fertilization"
    - "harnessing higher order meta logic to represent and reason with complex ethical theories"
    - "extensional higher order paramodulation in leo iii"
    - "building jiminy cricket an architecture for moral agreements among stakeholders"
    - "i o logic in hol first steps"
    - "the higher order prover leo iii"

Connected through hyperedge HE-3 (induced by source paper "computer science and metaphysics a cross fertilization"):
  with members:
    - "extending nunchaku to dependent type theory"
    - "systematic verification of the modal logic cube in isabelle hol"

Connected through hyperedge HE-4 (induced by source paper "learning textit ex nihilo"):
  with members:
    - "on automating the doctrine of double effect"

Connected through hyperedge HE-5 (induced by source paper "computer supported analysis of positive properties ultrafilters and modal collapse in variants of godel s ontological argument"):
  with members:
    - "computer science and metaphysics a cross fertilization"

Connected through hyperedge HE-6 (induced by source paper "universal reasoning rational argumentation and human machine interaction"):
  with members:
    - "simple type theory as framework for combining logics"
    - "automating access control logics in simple type theory with leo ii"

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)