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: "order preserving matching"
  Abstract: We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders coincide with those of the pattern. Order-preserving matching is applicable to many scenarios such as stock price analysis and musical melody matching in which the order relations should be matched instead of the strings themselves. Solving order-preserving matching has to do with representations of order relations of a numeric string. We define prefix representation and nearest neighbor representation, which lead to efficient algorithms for order-preserving matching. We present efficient algorithms for single and multiple pattern cases. For the single pattern case, we give an O(n log m) time algorithm and optimize it further to obtain O(n + m log m) time. For the multiple pattern case, we give an O(n log m) time algorithm.

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

Connected through hyperedge HE-2 (induced by source paper "fast cartesian tree matching"):
  with members:
    - "cartesian tree matching and indexing"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-3 (induced by source paper "order preserving pattern matching indeterminate strings"):
  with members:
    - "single and multiple consecutive permutation motif search"

Connected through hyperedge HE-4 (induced by source paper "generalized dictionary matching under substring consistent equivalence relations"):
  with members:
    - "cartesian tree matching and indexing"

Connected through hyperedge HE-5 (induced by source paper "order preserving pattern matching on trees and dags"):
  with members:
    - "efficient algorithms for the order preserving pattern matching problem"

Connected through hyperedge HE-6 (induced by source paper "longest common subsequence in at least k length order isomorphic substrings"):
  with members:
    - "lcsk practical similarity metric for long strings"
    - "longest common subsequence in k length substrings"
    - "efficient algorithms for the longest common subsequence in k length substrings"
    - "inducing the lcp array"

Connected through hyperedge HE-7 (induced by source paper "maximum number of distinct and nonequivalent nonstandard squares in a word"):
  with members:
    - "words with the maximum number of abelian squares"
    - "abelian repetitions in sturmian words"

Connected through hyperedge HE-8 (induced by source paper "fast multiple order preserving matching algorithms"):
  with members:
    - "efficient algorithms for the order preserving pattern matching problem"
    - "single and multiple consecutive permutation motif search"
    - "order preserving pattern matching with k mismatches"

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)