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: "10 10 6 worlds and beyond efficient representation and processing of incomplete information"
  Abstract: Current systems and formalisms for representing incomplete information generally suffer from at least one of two weaknesses. Either they are not strong enough for representing results of simple queries, or the handling and processing of the data, e.g. for query evaluation, is intractable. #R##N#In this paper, we present a decomposition-based approach to addressing this problem. We introduce world-set decompositions (WSDs), a space-efficient formalism for representing any finite set of possible worlds over relational databases. WSDs are therefore a strong representation system for any relational query language. We study the problem of efficiently evaluating relational algebra queries on sets of worlds represented by WSDs. We also evaluate our technique experimentally in a large census data scenario and show that it is both scalable and efficient.

Connected through hyperedge HE-1 (induced by source paper "counting problems over incomplete databases"):
  with members:
    - "efficient logspace classes for enumeration counting and uniform generation"

Connected through hyperedge HE-2 (induced by source paper "self correlation and maximum independence in finite relations"):
  with members:
    - "dependence and independence"
    - "world set decompositions expressiveness and efficient algorithms"

Connected through hyperedge HE-3 (induced by source paper "provenance for aggregate queries"):
  with members:
    - "the complexity of causality and responsibility for query answers and non answers"
    - "a unified approach to ranking in probabilistic databases"
    - "conditioning probabilistic databases"

Connected through hyperedge HE-4 (induced by source paper "disjunctive databases for representing repairs"):
  with members:
    - "the dlv system for knowledge representation and reasoning"
    - "complexity of consistent query answering in databases under cardinality based and incremental repair semantics"
    - "answer sets for consistent query answering in inconsistent databases"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-5 (induced by source paper "conditioning probabilistic databases"):
  with members:
    - "fast and simple relational processing of uncertain data"
    - "a knowledge compilation map"
    - "the good old davis putnam procedure helps counting models"

Connected through hyperedge HE-6 (induced by source paper "world set decompositions expressiveness and efficient algorithms"):
  with members:
    - "complexity and approximation of fixing numerical attributes in databases under integrity constraints"
    - "answer sets for consistent query answering in inconsistent databases"

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.DB(Databases)