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 "reducing the arity in unbiased black box complexity"):
  Abstract: We show that for all $1<k \leq \log n$ the $k$-ary unbiased black-box complexity of the $n$-dimensional $\onemax$ function class is $O(n/k)$. This indicates that the power of higher arity operators is much stronger than what the previous $O(n/\log k)$ bound by Doerr et al. (Faster black-box algorithms through higher arity operators, Proc. of FOGA 2011, pp. 163--172, ACM, 2011) suggests. #R##N#The key to this result is an encoding strategy, which might be of independent interest. We show that, using $k$-ary unbiased variation operators only, we may simulate an unrestricted memory of size $O(2^k)$ bits.

Includes members:
  Member "black box complexity breaking the o n log n barrier of leadingones":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "benchmarking discrete optimization heuristics with iohprofiler")
  Member "multiplicative drift analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic tools for the analysis of randomized optimization heuristics")
  Member "more effective crossover operators for the all pairs shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "black box complexity of the binary value function")
  Member "black box complexities of combinatorial problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal parameter choices via precise black box analysis")
  Member "playing mastermind with constant size memory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "black box complexity of the binary value function")
  Member "faster black box algorithms through higher arity operators":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "benchmarking discrete optimization heuristics with iohprofiler")

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)