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: "pattern avoiding access in binary search trees"
  Abstract: The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..] #R##N#Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BST. Thus, the obvious missing step towards the conjecture is an understanding of the "easy" access sequences. [..] The difficulty of proving dynamic optimality is witnessed by highly restricted special cases that remain unresolved; one prominent example is the traversal conjecture [Sleator and Tarjan, 1985], which states that preorder sequences (whose optimum is linear) are linear-time accessed by splay trees; no online BST is known to satisfy this conjecture. #R##N#In this paper, we prove two different relaxations of the traversal conjecture for Greedy: (i) Greedy is almost linear for preorder traversal, (ii) if a linear-time preprocessing is allowed, Greedy is in fact linear. These statements are corollaries of our more general results that express the complexity of access sequences in terms of a pattern avoidance parameter k. [..] To our knowledge, these are the first upper bounds for Greedy that are not known to hold for any other online BST. To obtain these results we identify an input-revealing property of Greedy. Informally, this means that the execution log partially reveals the structure of the access sequence. This property facilitates the use of rich technical tools from forbidden submatrix theory. #R##N#[Abridged]

Connected through hyperedge HE-1 (induced by source paper "new paths from splay to dynamic optimality"):
  with members:
    - "splaying preorders and postorders"
    - "weighted dynamic finger in binary search trees"
    - "the landscape of bounds for binary search trees"
    - "a linear potential function for pairing heaps"
    - "a study on splay trees"
    - "self adjusting binary search trees what makes them tick"
    - "combining binary search trees"
    - "in pursuit of the dynamic optimality conjecture"

Connected through hyperedge HE-2 (induced by source paper "splaying preorders and postorders"):
  with members:
    - "new paths from splay to dynamic optimality"
    - "weighted dynamic finger in binary search trees"
    - "better analysis of greedy binary search tree on decomposable sequences"
    - "upper bounds for maximally greedy binary search trees"
    - "splay trees davenport schinzel sequences and the deque conjecture"

Connected through hyperedge HE-3 (induced by source paper "finding and counting permutations via csps"):
  with members:
    - "improved bounds for testing forbidden order patterns"
    - "hitting set for hypergraphs of low vc dimension"
    - "finding small patterns in permutations in linear time"
    - "the computational landscape of permutation patterns"
    - "a fast algorithm for permutation pattern matching based on alternating runs"

Connected through hyperedge HE-4 (induced by source paper "faster and simpler algorithms for finding large patterns in permutations"):
  with members:
    - "improved bounds for testing forbidden order patterns"
    - "finding small patterns in permutations in linear time"
    - "the computational landscape of permutation patterns"
    - "a fast algorithm for permutation pattern matching based on alternating runs"

Connected through hyperedge HE-5 (induced by source paper "pinning down the strong wilber 1 bound for binary search trees"):
  with members:
    - "settling the relationship between wilber s bounds for dynamic optimality"
    - "greedy is an almost optimal deque"
    - "splay trees davenport schinzel sequences and the deque conjecture"

Connected through hyperedge HE-6 (induced by source paper "settling the relationship between wilber s bounds for dynamic optimality"):
  with members:
    - "smooth heaps and a dual view of self adjusting data structures"

Connected through hyperedge HE-7 (induced by source paper "smooth heaps and a dual view of self adjusting data structures"):
  with members:
    - "weighted dynamic finger in binary search trees"
    - "improved bounds for multipass pairing heaps and path balanced binary search trees"
    - "pairing heaps the forward variant"
    - "the landscape of bounds for binary search trees"
    - "greedy is an almost optimal deque"
    - "a back to basics empirical study of priority queues"
    - "a tight lower bound for decrease key in the pure heap model"
    - "finding small patterns in permutations in linear time"

Connected through hyperedge HE-8 (induced by source paper "better analysis of greedy binary search tree on decomposable sequences"):
  with members:
    - "weighted dynamic finger in binary search trees"
    - "the landscape of bounds for binary search trees"
    - "in pursuit of the dynamic optimality conjecture"
    - "upper bounds for maximally greedy binary search trees"
    - "splay trees davenport schinzel sequences and the deque conjecture"

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)