human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "radix sorting with no extra space"
  Abstract: It is well known that n integers in the range [1,n^c] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1,U] can be sorted in O(n sqrt{loglog n}) time. However, these algorithms use O(n) words of extra memory. Is this necessary? #R##N#We present a simple, stable, integer sorting algorithm for words of size O(log n), which works in O(n) time and uses only O(1) words of extra memory on a RAM model. This is the integer sorting case most useful in practice. We extend this result with same bounds to the case when the keys are read-only, which is of theoretical interest. Another interesting question is the case of arbitrary c. Here we present a black-box transformation from any RAM sorting algorithm to a sorting algorithm which uses only O(1) extra space and has the same running time. This settles the complexity of in-place sorting in terms of the complexity of sorting.

Connected through hyperedge HE-1 (induced by source paper "partial sums on the ultra wide word ram"):
  with members:
    - "the arm scalable vector extension"
    - "succinct partial sums and fenwick trees"
    - "algorithms in the ultra wide word model"
    - "i o efficient data structures for colored range and prefix reporting"
    - "an o 1 solution to the prefix sum problem on a specialized memory architecture"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-2 (induced by source paper "linear time in place dfs and bfs on the word ram"):
  with members:
    - "small uncolored and colored choice dictionaries"
    - "succinct choice dictionaries"
    - "space efficient biconnected components and recognition of outerplanar graphs"
    - "space time trade offs for stack based algorithms"

Connected through hyperedge HE-3 (induced by source paper "frameworks for designing in place graph algorithms"):
  with members:
    - "biconnectivity st numbering and other applications of dfs using o n bits"
    - "succinct choice dictionaries"
    - "canonizing graphs of bounded tree width in logspace"
    - "exact algorithms via monotone local search"
    - "selection from read only memory with limited workspace"
    - "the isomorphism problem for planar 3 connected graphs is in unambiguous logspace"

Connected through hyperedge HE-4 (induced by source paper "in place longest common extensions"):
  with members:
    - "small space encoding lce data structure with constant time queries"
    - "burrows wheeler transform and lcp array construction in constant space"
    - "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets"
    - "fast longest common extensions in small space"
    - "optimal in place suffix sorting"
    - "tight lower bounds for the longest common extension problem"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "longest common extensions in sublinear space"

Connected through hyperedge HE-5 (induced by source paper "space efficient re pair compression"):
  with members:
    - "scalable partial least squares regression on grammar compressed data matrices"

Connected through hyperedge HE-6 (induced by source paper "the technique of in place associative sorting"):
  with members:
    - "in place associative integer sorting"
    - "sorting distinct integer keys using in place associative sort"
    - "sorting distinct integers using improved in place associative sort"
    - "in place associative permutation sort"
    - "improved in place associative integer sorting"

Connected through hyperedge HE-7 (induced by source paper "succinct data structures for representing equivalence classes"):
  with members:
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-8 (induced by source paper "in place associative permutation sort"):
  with members:
    - "in place associative integer sorting"
    - "sorting distinct integer keys using in place associative sort"
    - "sorting distinct integers using improved in place associative sort"
    - "improved in place associative integer sorting"

Question: Please tell me which class the center node 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)