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: "computing quantiles in markov reward models"
  Abstract: Probabilistic model checking mainly concentrates on techniques for reasoning about the probabilities of certain path properties or expected values of certain random variables. For the quantitative system analysis, however, there is also another type of interesting performance measure, namely quantiles. A typical quantile query takes as input a lower probability bound p and a reachability property. The task is then to compute the minimal reward bound r such that with probability at least p the target set will be reached before the accumulated reward exceeds r. Quantiles are well-known from mathematical statistics, but to the best of our knowledge they have not been addressed by the model checking community so far. #R##N#In this paper, we study the complexity of quantile queries for until properties in discrete-time finite-state Markov decision processes with non-negative rewards on states. We show that qualitative quantile queries can be evaluated in polynomial time and present an exponential algorithm for the evaluation of quantitative quantile queries. For the special case of Markov chains, we show that quantitative quantile queries can be evaluated in time polynomial in the size of the chain and the maximum reward.

Connected through hyperedge HE-1 (induced by source paper "conditional value at risk for reachability and mean payoff in markov decision processes"):
  with members:
    - "quantile markov decision process"
    - "value iteration for long run average reward in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "trading performance for stability in markov decision processes"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"

Connected through hyperedge HE-2 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes"):
  with members:
    - "mdps with energy parity objectives"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "energy and mean payoff parity markov decision processes"
    - "energy parity games"

Connected through hyperedge HE-3 (induced by source paper "quantile markov decision process"):
  with members:
    - "optimizing quantiles in preference based markov decision processes"
    - "algorithms for cvar optimization in mdps"
    - "policy gradients with variance related risk criteria"
    - "mean variance optimization in markov decision processes"

Connected through hyperedge HE-4 (induced by source paper "reconciling rationality and stochasticity rich behavioral models in two player games"):
  with members:
    - "average energy games"
    - "non zero sum games for reactive synthesis"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "strategy synthesis for multi dimensional quantitative objectives"

Connected through hyperedge HE-5 (induced by source paper "efficient quantile computation in markov chains via counting problems for parikh images"):
  with members:
    - "complexity of problems of commutative grammars"
    - "counting euler tours in undirected bounded treewidth graphs"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "the complexity of the kth largest subset problem and related problems"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"

Connected through hyperedge HE-6 (induced by source paper "percentile queries in multi dimensional markov decision processes"):
  with members:
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "the complexity of the kth largest subset problem and related problems"
    - "exact and approximate determinization of discounted sum automata"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "quantitative games with interval objectives"
    - "decidability problems for actor systems"
    - "markov decision processes with multiple long run averageobjectives"

Connected through hyperedge HE-7 (induced by source paper "variations on the stochastic shortest path problem"):
  with members:
    - "quantitative languages defined by functional automata"
    - "multiple environment markov decision processes"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"
    - "to reach or not to reach efficient algorithms for total payoff games"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "looking at mean payoff and total payoff through windows"

Connected through hyperedge HE-8 (induced by source paper "the odds of staying on budget"):
  with members:
    - "the complexity of the kth largest subset problem and related problems"
    - "variations on the stochastic shortest path problem"
    - "percentile queries in multi dimensional markov decision processes"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "approximating the termination value of one counter mdps and stochastic games"
    - "one counter markov decision processes"

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.LO(Logic in Computer Science)