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: "matching concepts across hol libraries"
  Abstract: Many proof assistant libraries contain formalizations of the same mathematical concepts. The concepts are often introduced (defined) in different ways, but the properties that they have, and are in turn formalized, are the same. For the basic concepts, like natural numbers, matching them between libraries is often straightforward, because of mathematical naming conventions. However, for more advanced concepts, finding similar formalizations in different libraries is a non-trivial task even for an expert. #R##N#In this paper we investigate automatic discovery of similar concepts across libraries of proof assistants. We propose an approach for normalizing properties of concepts in formal libraries and a number of similarity measures. We evaluate the approach on HOL based proof assistants HOL4, HOL Light and Isabelle/HOL, discovering 398 pairs of isomorphic constants and types.

Connected through hyperedge HE-1 (induced by source paper "proofwatch watchlist guidance for large theories in e"):
  with members:
    - "mastering chess and shogi by self play with a general reinforcement learning algorithm"
    - "enigma efficient learning based inference guiding machine"
    - "deep network guided proof search"
    - "monte carlo tableau proof search"
    - "tactictoe learning to reason with hol4 tactics"
    - "deepmath deep sequence models for premise selection"
    - "extending e prover with similarity based clause selection strategies"
    - "mizar 40 for mizar 40"

Connected through hyperedge HE-2 (induced by source paper "alignment based translations across formal systems using interface theories"):
  with members:
    - "interoperability in the opendreamkit project the math in the middle approach"
    - "realms a structure for consolidating knowledge about mathematical theories"
    - "a query language for formal mathematical libraries"
    - "a foundational view on integration problems"
    - "a scalable module system"

Connected through hyperedge HE-3 (induced by source paper "sharing hol4 and hol light proof knowledge"):
  with members:
    - "the common hol platform"
    - "premise selection and external provers for hol4"
    - "structure formation in large theories"
    - "the mmt api a generic mkm system"
    - "hol y hammer online atp service for hol light"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-4 (induced by source paper "premise selection and external provers for hol4"):
  with members:
    - "encoding monomorphic and polymorphic types"
    - "mizar 40 for mizar 40"
    - "blistr the blind strategymaker"
    - "hol y hammer online atp service for hol light"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-5 (induced by source paper "a survey on retrieval of mathematical knowledge"):
  with members:
    - "querying geometric figures using a controlled language ontological graphs and dependency lattices"
    - "escaping the trap of too precise topic queries"

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)