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: "2048 is pspace hard but sometimes easy"
  Abstract: We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player's moves. Specifically, we show that for an $n \times n$ game board $\mathcal{G}$, computing a sequence of moves to reach a particular configuration $\mathbb{C}$ from an initial configuration $\mathbb{C}_0$ is PSPACE-Complete. Our reduction is from Nondeterministic Constraint Logic (NCL). We also show that determining whether or not there exists a fixed sequence of moves $\mathcal{S} \in \{\Uparrow, \Downarrow, \Leftarrow, \Rightarrow\}^k$ of length $k$ that results in a winning configuration for an $n \times n$ game board is fixed-parameter tractable (FPT). We describe an algorithm to solve this problem in $O(4^k n^2)$ time.

Connected through hyperedge HE-1 (induced by source paper "making change in 2048"):
  with members:
    - "mastering 2048 with delayed temporal coherence learning multi stage weight promotion redundant encoding and carousel shaping"
    - "threes fives 1024 and 2048 are hard"
    - "on the complexity of slide and merge games"

Connected through hyperedge HE-2 (induced by source paper "analysis of the game 2048 and its generalization in higher dimensions"):
  with members:
    - "making change in 2048"

Connected through hyperedge HE-3 (induced by source paper "trainyard is np hard"):
  with members:
    - "large peg army maneuvers"
    - "the computational complexity of portal and other 3d video games"
    - "bejeweled candy crush and other match three games are np hard"
    - "classic nintendo games are computationally hard"
    - "gaming is a hard job but someone has to do it"

Connected through hyperedge HE-4 (induced by source paper "mastering 2048 with delayed temporal coherence learning multi stage weight promotion redundant encoding and carousel shaping"):
  with members:
    - "the arcade learning environment an evaluation platform for general agents"
    - "reinforcement learning a survey"

Connected through hyperedge HE-5 (induced by source paper "threes fives 1024 and 2048 are hard"):
  with members:
    - "on the complexity of slide and merge games"
    - "playing games with algorithms algorithmic combinatorial game theory"

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.CC(Computational Complexity)