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 "procedural content generation through quality diversity"):
  Abstract: Quality-diversity (QD) algorithms search for a set of good solutions which cover a space as defined by behavior metrics. This simultaneous focus on quality and diversity with explicit metrics sets QD algorithms apart from standard single- and multi-objective evolutionary algorithms, as well as from diversity preservation approaches such as niching. These properties open up new avenues for artificial intelligence in games, in particular for procedural content generation. Creating multiple systematically varying solutions allows new approaches to creative human-AI interaction as well as adaptivity. In the last few years, a handful of applications of QD to procedural content generation and game playing have been proposed; we discuss these and propose challenges for future work.

Includes members:
  Member "general video game rule generation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mech elites illuminating the mechanic space of gvgai")
  Member "quality diversity through surprise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "frequency fitness assignment making optimization algorithms invariant under bijective transformations of the objective function")
  Member "mapping hearthstone deck spaces through map elites with sliding boundaries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automating representation discovery with map elites")
  Member "diverse agents for ad hoc cooperation in hanabi":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simplified action decoder for deep multi agent reinforcement learning")
  Member "intentional computational level design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "increasing generality in machine learning through procedural content generation")
  Member "empowering quality diversity in dungeon design with interactive constrained map elites":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mech elites illuminating the mechanic space of gvgai")
  Member "adaptive music composition for games":
    also connected through other hyperedges:
      (none)
  Member "talakat bullet hell generation through constrained map elites":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mech elites illuminating the mechanic space of gvgai")

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.NE(Neural and Evolutionary Computing)