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 "bounding average energy games"):
  Abstract: We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) remained open; in particular, so far there was no known upper bound on the memory that is required for winning strategies. #R##N#By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the density of low-energy configurations, we show an almost tight doubly-exponential upper bound on the necessary memory, and that the winner of average-energy games with lower-bounded energy can be determined in doubly-exponential time. We also prove EXPSPACE-hardness of this problem. #R##N#Finally, we consider multi-dimensional extensions of all types of average-energy games: without bounds, with only a lower bound, and with both a lower and an upper bound on the energy. We show that the fully-bounded version is the only case to remain decidable in multiple dimensions.

Includes members:
  Member "undecidability of two dimensional robot games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weighted automata on infinite words in the context of attacker defender games")
  Member "limit your consumption finding bounds in average energy games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "average energy games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "games where you can play optimally with finite memory")
  Member "fixed dimensional energy games are in pseudo polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "games where you can play optimally with finite memory")
  Member "reachability in succinct one counter games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reachability games with relaxed energy constraints")
  Member "reachability in two clock timed automata is pspace complete":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "looking at mean payoff and total payoff through windows":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "games where you can play optimally with finite memory")
  Member "automated synthesis of reliable and efficient systems through game theory a case study":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "games where you can play optimally with finite memory")

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)