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 "periodicity in data streams with wildcards"):
  Abstract: We investigate the problem of detecting periodic trends within a string $S$ of length $n$, arriving in the streaming model, containing at most $k$ wildcard characters, where $k=o(n)$. A wildcard character is a special character that can be assigned any other character. We say $S$ has wildcard-period $p$ if there exists an assignment to each of the wildcard characters so that in the resulting stream the length $n-p$ prefix equals the length $n-p$ suffix. We present a two-pass streaming algorithm that computes wildcard-periods of $S$ using $\mathcal{O}(k^3\,\mathsf{polylog}\,n)$ bits of space, while we also show that this problem cannot be solved in sublinear space in one pass. We then give a one-pass randomized streaming algorithm that computes all wildcard-periods $p$ of $S$ with $p<\frac{n}{2}$ and no wildcard characters appearing in the last $p$ symbols of $S$, using $\mathcal{O}(k^3\mathsf{polylog}\, n)$ space.

Includes members:
  Member "the streaming k mismatch problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating text to pattern hamming distances")
  Member "streaming periodicity with mismatches":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the streaming k mismatch problem")
  Member "streaming pattern matching with d wildcards":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sliding window property testing for regular languages")
  Member "tight tradeoffs for real time approximation of longest palindromes in streams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "longest alignment with edits in data streams")
  Member "streaming k mismatch with error correcting and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "weighted shortest common supersequence problem revisited")
  Member "dictionary matching in a stream":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sliding window property testing for regular languages")
  Member "the k mismatch problem revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximating text to pattern hamming distances")
  Member "space efficient string indexing for wildcard pattern matching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "massively parallel algorithms for string matching with wildcards")

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)