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: "qrb domains and the probabilistic powerdomain"
  Abstract: Is there any Cartesian-closed category of continuous domains that would be#N#closed under Jones and Plotkin's probabilistic powerdomain construction? This#N#is a major open problem in the area of denotational semantics of probabilistic#N#higher-order languages. We relax the question, and look for quasi-continuous#N#dcpos instead. We introduce a natural class of such quasi-continuous dcpos, the#N#omega-QRB-domains. We show that they form a category omega-QRB with pleasing#N#properties: omega-QRB is closed under the probabilistic powerdomain functor,#N#under finite products, under taking bilimits of expanding sequences, under#N#retracts, and even under so-called quasi-retracts. But... omega-QRB is not#N#Cartesian closed. We conclude by showing that the QRB domains are just one half#N#of an FS-domain, merely lacking control.

Connected through hyperedge HE-1 (induced by source paper "a convenient category for higher order probability theory"):
  with members:
    - "an application of computable distributions to the semantics of probabilistic programs"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "computability in basic quantum mechanics"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "venture a higher order probabilistic programming platform with programmable inference"
    - "church a language for generative models"

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.PL(Programming Languages)