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: "linear space substring range counting over polylogarithmic alphabets"
  Abstract: Bille and Grtz (2011) recently introduced the problem of substring range counting, for which we are asked to store compactly a string S of n characters with integer labels in (0;u), such that later, given an interval (a;b) and a pattern P of length m, we can quickly count the occurrences of P whose rst characters' labels are in ( a;b). They showed how to store S in O(n logn= log logn) space and answer queries in O(m + log logu) time. We show that, if S is over an alphabet of size polylog(n), then we can achieve optimal linear space. Moreover, if u = n polylog(n), then we can also reduce the time to O(m). Our results give linear space and time bounds for position-restricted substring counting and the counting versions of indexing substrings with intervals, indexing substrings with gaps and aligned pattern matching.

Connected through hyperedge HE-1 (induced by source paper "orthogonal range searching for text indexing"):
  with members:
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "binary jumbled string matching for highly run length compressible texts"
    - "compact binary relation representations with rich functionality"
    - "on optimal top k string retrieval"
    - "sorted range reporting"
    - "orthogonal range searching on the ram revisited"
    - "improved grammar based compressed indexes"
    - "encoding 2 d range maximum queries"

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)