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 parallel algorithms in the binary forking model"):
  Abstract: In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and set union, intersection and difference. In the binary-forking model, tasks can only fork into two child tasks, but can do so recursively and asynchronously, and join up later. The tasks share memory, and costs are measured in terms of work (total number of instructions), and span (longest dependence chain). #R##N#Due to the asynchronous nature of the model, and a variety schedulers that are efficient in both theory and practice, variants of the model are widely used in practice in languages such as Cilk and Java Fork-Join. PRAM algorithms can be simulated in the model but at a loss of a factor of $\Omega(\log n)$ so most PRAM algorithms are not optimal in the model even if optimal on the PRAM. All algorithms we describe are optimal in work and span (logarithmic in span). Several are randomized. Beyond being the first optimal algorithms for their problems in the model, most are very simple.

Includes members:
  Member "parallel finger search structures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal multithreaded batch parallel 2 3 trees")
  Member "theoretically efficient parallel graph algorithms can be fast and scalable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "parallel write efficient algorithms and data structures for computational geometry":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams")
  Member "parallel working set search structures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel batch dynamic graph connectivity")
  Member "parallelism in randomized incremental algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "pam parallel augmented maps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parallel batch dynamic graph connectivity")
  Member "resource oblivious sorting on multicores":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved parallel cache oblivious algorithms for dynamic programming and linear algebra")
  Member "parallel ordered sets using join":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parallel shortest paths using radius stepping")

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)