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 "querying visible and invisible tables in the presence of integrity constraints"):
  Abstract: We provide a wide-ranging study of the scenario where a subset of the tables in a relational schema are visible to a user (that is, their complete contents are known) while the remaining tables are invisible. The schema also has a set of integrity constraints, which may relate the visible tables to invisible ones but also may constrain both the visible and invisible instances. We want to determine whether information about a user query can be inferred using only the visible information and the constraints. We consider whether positive information about the query can be inferred, and also whether negative information (the query does not hold) can be inferred. We further consider both the instance-level version of the problem (the visible table extensions are given) and the schema-level version, where we want to know whether information can be leaked in some instance of the schema. Our instance-level results classify the complexity of these problems, both as a function of all inputs, and in the size of the instance alone. Our schema-level results exhibit an unusual dividing line between decidable and undecidable cases.

Includes members:
  Member "the hunt for a red spider conjunctive query determinacy is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on monotonic determinacy and rewritability for recursive queries and views")
  Member "obtaining information about queries behind views and dependencies":
    also connected through other hyperedges:
      (none)
  Member "querying the guarded fragment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite open world query answering with number restrictions")

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)