human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "eliciting implicit assumptions of mizar proofs by property omission"):
  Abstract: When formalizing proofs with proof assistants, it often happens that background knowledge about mathematical concepts is employed without the formalizer explicitly requesting it. Such mechanisms are warranted in the context of discovery because they can make prover sessions more efficient (less time searching the library) and can compress proofs (the more knowledge that is implicitly available, the less needs to be explicitly said by the formalizer). In the context of justification, though, implicit knowledge may need to be made explicit. To study implicit knowledge in proof assistants, one must first characterize what implicit knowledge should be made explicit. Then, once a class of implicit background knowledge is identified, one needs to determine how to extract it from proofs. When a class of implicit knowledge is made explicit, we may then inquire to what extent the implicit knowledge is needed for any particular proof; it often happens that proofs can be successful even if some of the implicit knowledge is omitted. In this note we describe an experiment conducted on the Mizar Mathematical Library (MML) of formal mathematical proofs concerning a particular class of implicit background knowledge, namely, properties of functions and relations (e.g., commutativity, asymmetry, etc.). In our experiment we separate, for each theorem of the MML, the needed function and relation properties from the unneeded ones. Special attention is paid to those function and relation properties that are significant in discussions of foundations of mathematics.

Includes members:
  Member "dependencies in formal mathematics applications and extraction for coq and mizar":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a logic independent ide")
  Member "dependencies in formal mathematics applications and extraction for coq and mizar":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a logic independent ide")
  Member "large formal wikis issues and solutions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "documentation generator focusing on symbols for the html ized mizar library")
  Member "mizar items exploring fine grained dependencies in the mizar mathematical library":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the source paper 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)