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: "probabilistic databases with an infinite open world assumption"
  Abstract: Probabilistic databases (PDBs) introduce uncertainty into relational databases by specifying probabilities for several possible instances. That is, they are traditionally finite probability spaces over database instances. Such PDBs inherently make a closed-world assumption - non-occurring facts are assumed to be impossible, rather than just unlikely. As convincingly argued by Ceylan et al. (KR 2016), this results in implausibilities and clashes with intuition. An open-world assumption, where facts not explicitly listed may have a small positive probability can yield more reasonable results. The corresponding open-world model of Ceylan et al. however assumes that all entities in the PDB come from a fixed finite universe. In this work, we take one further step and propose a model of "truly" open-world PDBs with an infinite universe. This is natural when we for example consider entities to be integers, real numbers or strings. While the probability space might become infinitely large, all instances of a PDB remain finite. We provide a sound mathematical framework for infinite PDBs in generalization of the existing theory on finite PDBs. Our main results are concerned with tuple-independent PDBs; we present a generic construction showing that such PDBs exist in the infinite and provide a characterization of their existence in general. This model can be used to apply open-world semantics to finite PDBs. The construction can also be extended to so-called block-independent-disjoint probabilistic databases. Algorithmic questions are not the focus of this paper, but we show how query evaluation algorithms can be lifted from finite PDBs to perform approximate evaluation in infinite PDBs.

Connected through hyperedge HE-1 (induced by source paper "generative datalog with continuous distributions"):
  with members:
    - "infinite probabilistic databases"
    - "pyro deep universal probabilistic programming"
    - "discrete continuous mixtures in probabilistic programming generalized semantics and inference algorithms"
    - "measure transformer semantics for bayesian machine learning"
    - "markov logic in infinite domains"

Connected through hyperedge HE-2 (induced by source paper "infinite probabilistic databases"):
  with members:
    - "on constrained open world probabilistic databases"
    - "discrete continuous mixtures in probabilistic programming generalized semantics and inference algorithms"
    - "aggregation in probabilistic databases via knowledge compilation"
    - "markov logic in infinite domains"
    - "conditioning probabilistic 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)