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 "faster and simpler algorithms for finding large patterns in permutations"):
  Abstract: Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this area is deciding whether a given permutation of length $n$ contains a given pattern of length $k$. #R##N#In this work we give two new algorithms for this well-studied problem, one whose running time is $n^{0.44k+o(k)}$, and one whose running time is the better of $O(1.6181^n)$ and $n^{k/2+o(k)}$. These results improve the earlier best bounds of Ahal and Rabinovich (2000), and Bruner and Lackner (2012), and are the fastest algorithms for the problem when $k = \Omega(\log n)$. When $k = o(\log n)$, the parameterized algorithm of Guillemot and Marx (2013) dominates. #R##N#Our second algorithm uses polynomial space and is significantly simpler than all previous approaches with comparable running times, including an $n^{k/2+o(k)}$ algorithm proposed by Guillemot and Marx. Our approach can be summarized as follows: "for every matching of the even-valued entries of the pattern, try to match all odd-valued entries left-to-right". For the special case of patterns that are Jordan-permutations, we show an improved, subexponential running time.

Includes members:
  Member "improved bounds for testing forbidden order patterns":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal adaptive detection of monotone patterns")
  Member "pattern avoiding access in binary search trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new paths from splay to dynamic optimality")
  Member "finding small patterns in permutations in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal adaptive detection of monotone patterns")
  Member "the computational landscape of permutation patterns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "counting small permutation patterns")
  Member "a fast algorithm for permutation pattern matching based on alternating runs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "counting small permutation patterns")

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)