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: "space efficient string indexing for wildcard pattern matching"
  Abstract: In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses $O(n\log^{\varepsilon}n)$ bits for any $\varepsilon>0$ and reports all $\mathrm{occ}$ occurrences of a wildcard string in $O(m+\sigma^g \cdot\mu(n) + \mathrm{occ})$ time, where $\mu(n)=o(\log\log\log n)$, $\sigma$ is the alphabet size, $m$ is the number of alphabet symbols and $g$ is the number of wildcard symbols in the query string. We also present an $O(n)$-bit index with $O((m+\sigma^g+\mathrm{occ})\log^{\varepsilon}n)$ query time and an $O(n(\log\log n)^2)$-bit index with $O((m+\sigma^g+\mathrm{occ})\log\log n)$ query time. These are the first non-trivial data structures for this problem that need $o(n\log n)$ bits of space.

Connected through hyperedge HE-1 (induced by source paper "massively parallel algorithms for string matching with wildcards"):
  with members:
    - "fast algorithms for knapsack via convolution and prediction"
    - "round compression for parallel matching algorithms"
    - "clustered integer 3sum via additive combinatorics"
    - "a faster pseudopolynomial time algorithm for subset sum"
    - "parallel algorithms for geometric graph problems"
    - "communication steps for parallel query processing"
    - "sorting searching and simulation in the mapreduce framework"

Connected through hyperedge HE-2 (induced by source paper "orthogonal range reporting and rectangle stabbing for fat rectangles"):
  with members:
    - "orthogonal range searching on the ram revisited"
    - "space efficient multi dimensional range reporting"

Connected through hyperedge HE-3 (induced by source paper "periodicity in data streams with wildcards"):
  with members:
    - "the streaming k mismatch problem"
    - "streaming periodicity with mismatches"
    - "streaming pattern matching with d wildcards"
    - "tight tradeoffs for real time approximation of longest palindromes in streams"
    - "streaming k mismatch with error correcting and applications"
    - "dictionary matching in a stream"
    - "the k mismatch problem revisited"
    - "space lower bounds for online pattern matching"

Connected through hyperedge HE-4 (induced by source paper "data structure lower bounds for document indexing problems"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "dictionary matching with one gap"
    - "higher lower bounds from the 3sum conjecture"
    - "word packing algorithms for dynamic connectivity and dynamic sets"
    - "orthogonal range searching on the ram revisited"
    - "string indexing for patterns with wildcards"
    - "on the hardness of distance oracle for sparse graph"

Connected through hyperedge HE-5 (induced by source paper "weighted ancestors in suffix trees"):
  with members:
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"
    - "string indexing for patterns with wildcards"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"

Connected through hyperedge HE-6 (induced by source paper "on the average case complexity of pattern matching with wildcards"):
  with members:
    - "weighted ancestors in suffix trees"
    - "succincter text indexing with wildcards"

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)