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 "probabilistic opacity for markov decision processes"):
  Abstract: Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non deterministic choice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and $\omega$-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non opaque becomes decidable for a restricted class of $\omega$-regular secrets, as well as for all $\omega$-regular secrets under finite-memory schedulers.

Includes members:
  Member "what is decidable about partially observable markov decision processes with omega regular objectives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "time bounded reachability for hybrid automata complexity and fixpoints":
    also connected through other hyperedges:
      (none)
  Member "opacity issues in games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of synthesizing uniform strategies")
  Member "randomness for free":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameter independent strategies for pmdps via pomdps")
  Member "qualitative analysis of partially observable markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stochastic finite state control of pomdps with ltl specifications")
  Member "algorithms for omega regular games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "alternating tree automata with qualitative semantics")

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.CR(Cryptography and Security)