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 "document retrieval on repetitive string collections"):
  Abstract: Most of the fastest-growing string collections today are repetitive, that is, most of the constituent documents are similar to many others. As these collections keep growing, a key approach to handling them is to exploit their repetitiveness, which can reduce their space usage by orders of magnitude. We study the problem of indexing repetitive string collections in order to perform efficient document retrieval operations on them. Document retrieval problems are routinely solved by search engines on large natural language collections, but the techniques are less developed on generic string collections. The case of repetitive string collections is even less understood, and there are very few existing solutions. We develop two novel ideas, {\em interleaved LCPs} and {\em precomputed document lists}, that yield highly compressed indexes solving the problem of document listing (find all the documents where a string appears), top-$k$ document retrieval (find the $k$ documents where a string appears most often), and document counting (count the number of documents where a string appears). We also show that a classical data structure supporting the latter query becomes highly compressible on repetitive data. Finally, we show how the tools we developed can be combined to solve ranked conjunctive and disjunctive multi-term queries under the simple tf-idf model of relevance. We thoroughly evaluate the resulting techniques in various real-life repetitiveness scenarios, and recommend the best choices for each case.

Includes members:
  Member "universal indexes for highly repetitive document collections":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rpair rescaling repair with rsync")
  Member "composite repetition aware data structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on extensions of maximal repeats in compressed strings")
  Member "document retrieval on repetitive collections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast small and simple document listing on repetitive text collections")
  Member "spaces trees and colors the algorithmic landscape of document retrieval on sequences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast small and simple document listing on repetitive text collections")
  Member "from theory to practice plug and play with succinct data structures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bitvectors with runs and the successor predecessor problem")
  Member "faster compact top k document retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compact indexes for flexible top k retrieval")
  Member "improved grammar based compressed indexes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "top tree compression of tries")
  Member "new algorithms on wavelet trees and applications to information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "edge minimization in de bruijn graphs")

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.IR(Information Retrieval)