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: "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
  Abstract: The beyond worst-case threshold problem (BWC), recently introduced by Bruy\`ere et al., asks given a quantitative game graph for the synthesis of a strategy that i) enforces some minimal level of performance against any adversary, and ii) achieves a good expectation against a stochastic model of the adversary. They solved the BWC problem for finite-memory strategies and unidimensional mean-payoff objectives and they showed membership of the problem in NP$\cap$coNP. They also noted that infinite-memory strategies are more powerful than finite-memory ones, but the respective threshold problem was left open. We extend these results in several directions. First, we consider multidimensional mean-payoff objectives. Second, we study both finite-memory and infinite-memory strategies. We show that the multidimensional BWC problem is coNP-complete in both cases. Third, in the special case when the worst-case objective is unidimensional (but the expectation objective is still multidimensional) we show that the complexity decreases to NP$\cap$coNP. This solves the infinite-memory threshold problem left open by Bruy\`ere et al., and this complexity cannot be improved without improving the currently known complexity of classical mean-payoff games. Finally, we introduce a natural relaxation of the BWC problem, the beyond almost-sure threshold problem (BAS), which asks for the synthesis of a strategy that ensures some minimal level of performance with probability one and a good expectation against the stochastic model of the adversary. We show that the multidimensional BAS threshold problem is solvable in P.

Connected through hyperedge HE-1 (induced by source paper "multi weighted markov decision processes with reachability objectives"):
  with members:
    - "stochastic shortest paths and weight bounded properties in markov decision processes"
    - "stream differential equations specification formats and solution methods"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "knowledge spaces and the completeness of learning strategies"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"

Connected through hyperedge HE-2 (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"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "trading performance for stability in markov decision processes"
    - "computing quantiles in markov reward models"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"

Connected through hyperedge HE-3 (induced by source paper "optimizing the expected mean payoff in energy markov decision processes"):
  with members:
    - "an omega algebra for real time energy problems"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "average energy games"
    - "zero reachability in probabilistic multi counter automata"
    - "the odds of staying on budget"
    - "polynomial time algorithms for energy games with special weight structures"
    - "solving parity games on integer vectors"

Connected through hyperedge HE-4 (induced by source paper "perfect information stochastic games with generalized mean payoff objectives"):
  with members:
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "two player perfect information shift invariant submixing stochastic games are half positional"
    - "markov decision processes with multiple long run averageobjectives"
    - "a framework for automated competitive analysis of on line scheduling of firm deadline tasks"
    - "synthesis from ltl specifications with mean payoff objectives"
    - "the complexity of multi mean payoff and multi energy games"
    - "finite memory strategy synthesis for robust multidimensional mean payoff 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"
    - "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"
    - "computing quantiles in markov reward models"

Connected through hyperedge HE-6 (induced by source paper "extending finite memory determinacy general techniques and an application to energy parity games"):
  with members:
    - "first cycle games"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "parity and streett games with costs"
    - "multiplayer cost games with simple nash equilibria"
    - "synthesis of succinct systems"
    - "energy parity games"

Connected through hyperedge HE-7 (induced by source paper "extending finite memory determinacy to multiplayer games"):
  with members:
    - "extending finite memory determinacy general techniques and an application to energy parity games"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "parity and streett games with costs"
    - "the complexity of multi mean payoff and multi energy games"
    - "multiplayer cost games with simple nash equilibria"
    - "energy parity games"

Connected through hyperedge HE-8 (induced by source paper "minimizing expected cost under hard boolean constraints with applications to quantitative synthesis"):
  with members:
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"

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.GT(Computer Science and Game Theory)