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: "algorithms for jumbled pattern matching in strings"
  Abstract: The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-case optimally with a sliding window approach in O(n) time. We present two novel algorithms for the case where the text is fixed and many queries arrive over time. The first algorithm only decides whether a given Parikh vector appears in a binary text. It uses a linear size data structure and decides each query in O(1) time. The preprocessing can be done trivially in Θ(n2) time. The second algorithm finds all occurrences of a given Parikh vector in a text over an arbitrary alphabet of size σ ≥ 2 and has sub-linear expected time complexity. More precisely, we present two variants of the algorithm, both using an O(n) size data structure, each of which can be constructed in O(n) time. The first solution is very simple and easy to implement and leads to an expected query time of , where m = ∑i qi is the length of a string with Parikh vector q. The second uses wavelet trees and improves the expected runtime to , i.e., by a factor of log m.

Connected through hyperedge HE-1 (induced by source paper "generating a gray code for prefix normal words in amortized polylogarithmic time per word"):
  with members:
    - "on collapsing prefix normal words"
    - "bubble flip a new generation algorithm for prefix normal words"
    - "on prefix normal words and prefix normal forms"
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "on hardness of jumbled indexing"
    - "new algorithms for binary jumbled pattern matching"

Connected through hyperedge HE-2 (induced by source paper "on collapsing prefix normal words"):
  with members:
    - "bubble flip a new generation algorithm for prefix normal words"
    - "on prefix normal words and prefix normal forms"
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "on prefix normal words"

Connected through hyperedge HE-3 (induced by source paper "fast cartesian tree matching"):
  with members:
    - "cartesian tree matching and indexing"
    - "order preserving matching"

Connected through hyperedge HE-4 (induced by source paper "cartesian tree matching and indexing"):
  with members:
    - "string periods in the order preserving model"

Connected through hyperedge HE-5 (induced by source paper "on abelian longest common factor with and without rle"):
  with members:
    - "computing abelian regularities on rle strings"
    - "clustered integer 3sum via additive combinatorics"
    - "algorithms for longest common abelian factors"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled string matching for highly run length compressible texts"

Connected through hyperedge HE-6 (induced by source paper "flexible and efficient algorithms for abelian matching in strings"):
  with members:
    - "string matching with inversions and translocations in linear average time most of the time"

Connected through hyperedge HE-7 (induced by source paper "on prefix normal words and prefix normal forms"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled string matching for highly run length compressible texts"
    - "binary jumbled pattern matching on trees and tree like structures"

Connected through hyperedge HE-8 (induced by source paper "bubble flip a new generation algorithm for prefix normal words"):
  with members:
    - "on prefix normal words and prefix normal forms"
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "on hardness of jumbled indexing"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "on prefix normal words"

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)