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 "robust multidimensional mean payoff games are undecidable"):
  Abstract: Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight. In the multidimensional setting, a weight vector is assigned to every transition and the objective of the protagonist is to satisfy a boolean condition over the limit-average weight of each dimension, e.g., $\LimAvg(x_1) \leq 0 \vee \LimAvg(x_2)\geq 0 \wedge \LimAvg(x_3) \geq 0$. We recently proved that when one of the players is restricted to finite-memory strategies then the decidability of determining the winner is inter-reducible with Hilbert's Tenth problem over rationals (a fundamental long-standing open problem). In this work we allow arbitrary (infinite-memory) strategies for both players and we show that the problem is undecidable.

Includes members:
  Member "synthesis from ltl specifications with mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "perfect information stochastic games with generalized mean payoff objectives")
  Member "efficient controller synthesis for consumption games with multiple resource types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy mean payoff games")
  Member "the complexity of multi mean payoff and multi energy games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "games where you can play optimally with finite memory")
  Member "finite memory strategy synthesis for robust multidimensional mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perfect information stochastic games with generalized mean payoff objectives")
  Member "strategy synthesis for multi dimensional quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "games where you can play optimally with finite memory")
  Member "hyperplane separation technique for multidimensional mean payoff games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "mean payoff pushdown games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bounding average energy games")
  Member "the complexity of mean payoff automaton expression":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "decidable weighted expressions with presburger combinators")

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)