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 "counting small permutation patterns"):
  Abstract: A sample of n generic points in the xy-plane defines a permutation that relates their ranks along the two axes. Every subset of k points similarly defines a pattern, which occurs in that permutation. The number of occurrences of small patterns in a large permutation arises in many areas, including nonparametric statistics. It is therefore desirable to count them more efficiently than the straightforward ~O(n^k) time algorithm. #R##N#This work proposes new algorithms for counting patterns. We show that all patterns of order 2 and 3, as well as eight patterns of order 4, can be counted in nearly linear time. To that end, we develop an algebraic framework that we call corner tree formulas. Our approach generalizes the existing methods and allows a systematic study of their scope. #R##N#Using the machinery of corner trees, we find twenty-three independent linear combinations of order-4 patterns, that can be computed in time ~O(n). We also describe an algorithm that counts another 4-pattern, and hence all 4-patterns, in time ~O(n^(3/2)). #R##N#As a practical application, we provide a nearly linear time computation of a statistic by Yanagimoto (1970), Bergsma and Dassios (2010). This statistic yields a natural and strongly consistent variant of Hoeffding's test for independence of X and Y, given a random sample as above. This improves upon the so far most efficient ~O(n^2) algorithm.

Includes members:
  Member "faster and simpler algorithms for finding large patterns in permutations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding monotone patterns in sublinear time")
  Member "finding and counting permutations via csps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal adaptive detection of monotone patterns")
  Member "improved bounds for testing forbidden order patterns":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal adaptive detection of monotone patterns")
  Member "finding small patterns in permutations in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal adaptive detection of monotone patterns")
  Member "the computational landscape of permutation patterns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding and counting permutations via csps")
  Member "a fast algorithm for permutation pattern matching based on alternating runs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding and counting permutations via csps")
  Member "hereditary properties of permutations are strongly testable":
    also connected through other hyperedges:
      (none)
  Member "orthogonal range searching on the ram revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "path query data structures in practice")

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)