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: "internal pattern matching queries in a text and applications"
  Abstract: We consider several types of internal queries: questions about subwords of a text. As the main tool we develop an optimal data structure for the problem called here internal pattern matching. This data structure provides constant-time answers to queries about occurrences of one subword $x$ in another subword $y$ of a given text, assuming that $|y|=\mathcal{O}(|x|)$, which allows for a constant-space representation of all occurrences. This problem can be viewed as a natural extension of the well-studied pattern matching problem. The data structure has linear size and admits a linear-time construction algorithm. #R##N#Using the solution to the internal pattern matching problem, we obtain very efficient data structures answering queries about: primitivity of subwords, periods of subwords, general substring compression, and cyclic equivalence of two subwords. All these results improve upon the best previously known counterparts. The linear construction time of our data structure also allows to improve the algorithm for finding $\delta$-subrepetitions in a text (a more general version of maximal repetitions, also called runs). For any fixed $\delta$ we obtain the first linear-time algorithm, which matches the linear time complexity of the algorithm computing runs. Our data structure has already been used as a part of the efficient solutions for subword suffix rank & selection, as well as substring compression using Burrows-Wheeler transform composed with run-length encoding.

Connected through hyperedge HE-1 (induced by source paper "string synchronizing sets sublinear time bwt construction and optimal lce data structure"):
  with members:
    - "quasi linear time algorithm for longest common circular factor"
    - "locally consistent parsing for text indexing in small space"
    - "text indexing and searching in sublinear time"
    - "optimal construction of compressed indexes for highly repetitive texts"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "wavelet trees meet suffix trees"
    - "linear time construction of compressed text indices in compact space"
    - "recompression a simple and powerful technique for word equations"

Connected through hyperedge HE-2 (induced by source paper "internal dictionary matching"):
  with members:
    - "computing all distinct squares in linear time for integer alphabets"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "wavelet trees meet suffix trees"
    - "recompression a simple and powerful technique for word equations"
    - "a linear time algorithm for seeds computation"
    - "faster fully compressed pattern matching by recompression"

Connected through hyperedge HE-3 (induced by source paper "circular pattern matching with k mismatches"):
  with members:
    - "efficient representation and counting of antipower factors in words"
    - "the streaming k mismatch problem"
    - "the k mismatch problem revisited"
    - "average case optimal approximate circular string matching"
    - "beating o nm in approximate lzw compressed pattern matching"

Connected through hyperedge HE-4 (induced by source paper "quasi linear time algorithm for longest common circular factor"):
  with members:
    - "sequence searching allowing for non overlapping adjacent unbalanced translocations"
    - "on abelian longest common factor with and without rle"
    - "average case optimal approximate circular string matching"

Connected through hyperedge HE-5 (induced by source paper "locally consistent parsing for text indexing in small space"):
  with members:
    - "string synchronizing sets sublinear time bwt construction and optimal lce data structure"
    - "sparse suffix tree construction in optimal time and space"
    - "tight lower bounds for the longest common extension problem"
    - "longest common extensions in sublinear space"

Connected through hyperedge HE-6 (induced by source paper "longest unbordered factor in quasilinear time"):
  with members:
    - "maximal unbordered factors of random strings"

Connected through hyperedge HE-7 (induced by source paper "the runs theorem"):
  with members:
    - "computing runs on a general alphabet"
    - "lyndon words and short superstrings"
    - "on the maximal sum of exponents of runs in a string"
    - "on bijective variants of the burrows wheeler transform"
    - "new lower bounds for the maximum number of runs in a string"
    - "circle formation of weak robots and lyndon words"

Connected through hyperedge HE-8 (induced by source paper "detecting one variable patterns"):
  with members:
    - "eertree an efficient data structure for processing palindromes in strings"
    - "online detection of repetitions with backtracking"
    - "weighted ancestors in suffix trees"
    - "a minimal periods algorithm with applications"

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)