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 "mixed powerdomains for probability and nondeterminism"):
  Abstract: We consider mixed powerdomains combining ordinary nondeterminism and#N#probabilistic nondeterminism. We characterise them as free algebras for#N#suitable (in)equation-al theories; we establish functional representation#N#theorems; and we show equivalencies between state transformers and#N#appropriately healthy predicate transformers. The extended nonnegative reals#N#serve as `truth-values'. As usual with powerdomains, everything comes in three#N#flavours: lower, upper, and order-convex. The powerdomains are suitable convex#N#sets of subprobability valuations, corresponding to resolving nondeterministic#N#choice before probabilistic choice. Algebraically this corresponds to the#N#probabilistic choice operator distributing over the nondeterministic choice#N#operator. (An alternative approach to combining the two forms of nondeterminism#N#would be to resolve probabilistic choice first, arriving at a domain-theoretic#N#version of random sets. However, as we also show, the algebraic approach then#N#runs into difficulties.)#N#  Rather than working directly with valuations, we take a domain-theoretic#N#functional-analytic approach, employing domain-theoretic abstract convex sets#N#called Kegelspitzen; these are equivalent to the abstract probabilistic#N#algebras of Graham and Jones, but are more convenient to work with. So we#N#define power Kegelspitzen, and consider free algebras, functional#N#representations, and predicate transformers. To do so we make use of previous#N#work on domain-theoretic cones (d-cones), with the bridge between the two of#N#them being provided by a free d-cone construction on Kegelspitzen.

Includes members:
  Member "on the equivalence of state transformer semantics and predicate transformer semantics":
    also connected through other hyperedges:
      (none)
  Member "characterising testing preorders for finite probabilistic processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ensuring liveness properties of distributed systems open problems")

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)