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: "grunge a grand unified atp challenge"
  Abstract: This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type variables) and first-order logic (possibly with multiple types, and possibly with type variables). The resultant problem sets allow us to run automated theorem provers that support different logical formats on corresponding problems, and compare their performances. This also results in a new "grand unified" large theory benchmark that emulates the ITP/ATP hammer setting, where systems and metasystems can use multiple ATP formalisms in complementary ways, and jointly learn from the accumulated knowledge.

Connected through hyperedge HE-1 (induced by source paper "towards finding longer proofs"):
  with members:
    - "enigma ng efficient neural and gradient boosted inference guidance for e"
    - "the minerl competition on sample efficient reinforcement learning using human priors"
    - "meta learning of sequential strategies"
    - "analysing mathematical reasoning abilities of neural models"
    - "graph representations for higher order logic and theorem proving"
    - "learning to speak and act in a fantasy text adventure game"
    - "hammering mizar by learning clause guidance"
    - "obstacle tower a generalization challenge in vision control and planning"

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"
    - "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"
    - "on automating the doctrine of double effect"

Connected through hyperedge HE-3 (induced by source paper "extensional higher order paramodulation in leo iii"):
  with members:
    - "computer science and metaphysics a cross fertilization"
    - "encoding monomorphic and polymorphic types"
    - "cut simulation and impredicativity"

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)