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 "a dichotomy for homomorphism closed queries on probabilistic graphs"):
  Abstract: We study the problem of probabilistic query evaluation (PQE) over probabilistic graphs, namely, tuple-independent probabilistic databases (TIDs) on signatures of arity two. Our focus is the class of queries that is closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries, denoted UCQ^\infty . Our main result states that all unbounded queries in UCQ^\infty are #P-hard for PQE. As bounded queries in UCQ^\infty are already classified by the dichotomy of Dalvi and Suciu [16], our results and theirs imply a complete dichotomy on PQE for UCQ^\infty queries over arity-two signatures. This dichotomy covers in particular all fragments in UCQ^\infty such as negation-free (disjunctive) Datalog, regular path queries, and a large class of ontology-mediated queries on arity-two signatures. Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae (#PP2DNF) for some queries, or from the source-to-target reliability problem in an undirected graph (#U-ST-CON) for other queries, depending on properties of minimal models.

Includes members:
  Member "boundedness of conjunctive regular path queries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "conjunctive regular path queries with string variables")
  Member "model counting for conjunctive queries without self joins":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the impact of negation on the complexity of the shapley value in conjunctive queries")
  Member "tractable lineages on treelike instances limits and extensions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "connecting knowledge compilation classes and width parameters")
  Member "ontology based data access a study through disjunctive datalog csp and mmsnp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asnp a tame fragment of existential second order logic")
  Member "rewriting ontological queries into small nonrecursive datalog programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polynomial rewritings from expressive description logics with closed predicates to variants of datalog")

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