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 "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.

Includes members:
  Member "orthogonal range searching on the ram revisited":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "path query data structures in practice")
  Member "a faster grammar based self index":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "top tree compression of tries")

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)