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 "partial sums on the ultra wide word ram"):
  Abstract: We consider the classic partial sums problem on the ultra-wide word RAM model of computation. This model extends the classic $w$-bit word RAM model with special ultrawords of length $w^2$ bits that support standard arithmetic and boolean operation and scattered memory access operations that can access $w$ (non-contiguous) locations in memory. The ultra-wide word RAM model captures (and idealizes) modern vector processor architectures. #R##N#Our main result is a new in-place data structure for the partial sum problem that only stores a constant number of ultraword in addition to the input and supports operations in doubly logarithmic time. This matches the best known time bounds for the problem (among polynomial space data structures) while improving the space from superlinear to a constant number of ultrawords. Our results are based on a simple and elegant in-place word RAM data structure, known as the Fenwick tree. Our main technical contribution is a new efficient parallel ultra-wide word RAM implementation of the Fenwick tree, which is likely of independent interest.

Includes members:
  Member "the arm scalable vector extension":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "base64 encoding and decoding at almost the speed of a memory copy")
  Member "succinct partial sums and fenwick trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compact fenwick trees for dynamic ranking and selection")
  Member "algorithms in the ultra wide word model":
    also connected through other hyperedges:
      (none)
  Member "i o efficient data structures for colored range and prefix reporting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic 3 sided planar range queries with expected doubly logarithmic time")
  Member "radix sorting with no extra space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear time in place dfs and bfs on the word ram")
  Member "an o 1 solution to the prefix sum problem on a specialized memory architecture":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithms in the ultra wide word model")
  Member "logarithmic lower bounds in the cell probe model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)