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 "optimal depth sorting networks"):
  Abstract: We prove depth optimality of sorting networks from "The Art of Computer Programming".Sorting networks posses symmetry that can be used to generate a few representatives.These representatives can be efficiently encoded using regular expressions.We construct SAT formulas whose unsatisfiability is sufficient to show optimality.Resulting algorithm is orders of magnitude faster than prior work on small instances. We solve a 40-year-old open problem on depth optimality of sorting networks. In 1973, Donald E. Knuth detailed sorting networks of the smallest depth known for n ź 16 inputs, quoting optimality for n ź 8 (Volume 3 of "The Art of Computer Programming"). In 1989, Parberry proved optimality of networks with 9 ź n ź 10 inputs. We present a general technique for obtaining such results, proving optimality of the remaining open cases of 11 ź n ź 16 inputs. Exploiting symmetry, we construct a small set R n of two-layer networks such that: if there is a depth-k sorting network on n inputs, then there is one whose first layers are in R n . For each network in R n , we construct a propositional formula whose satisfiability is necessary for the existence of a depth-k sorting network. Using an off-the-shelf SAT solver we prove optimality of the sorting networks listed by Knuth. For n ź 10 inputs, our algorithm is orders of magnitude faster than prior ones.

Includes members:
  Member "sorting networks to the end and back again":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhanced optimization with composite objectives and novelty selection")
  Member "solving and verifying the boolean pythagorean triples problem via cube and conquer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "new bounds on optimal sorting networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint size and depth optimization of sorting networks")
  Member "computing the ramsey number r 4 3 3 using abstraction and symmetry breaking":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a nonexistence certificate for projective planes of order ten with weight 15 codewords")
  Member "applying sorting networks to synthesize optimized sorting libraries":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sorting networks to the end and back again")
  Member "sorting networks the end game":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sorting networks to the end and back again")
  Member "the quest for optimal sorting networks efficient generation of two layer prefixes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "enhanced optimization with composite objectives and novelty selection")
  Member "twenty five comparators is optimal when sorting nine inputs and twenty nine for ten":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "engineering faster sorters for small sets of elements")

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.DS(Data Structures and Algorithms)