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: "two compact incremental prime sieves"
  Abstract: A prime sieve is an algorithm that finds the primes up to a bound  #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $n$#N#                 #N#             #N#        #N#                       #N#                    . We say that a prime sieve is  incremental , if it can quickly determine if  #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $n+1$#N#                 #N#             #N#        #N#                       #N#                     is prime after having found all primes up to  #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $n$#N#                 #N#             #N#        #N#                       #N#                    . We say a sieve is  compact  if it uses roughly  #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $\sqrt{n}$#N#                 #N#             #N#        #N#                       #N#                     space or less. In this paper, we present two new results. #N#                 #N#                    #N#                       #N#                          – #N#                          #N#                             We describe the  rolling sieve , a practical, incremental prime sieve that takes  #N#                                   #N#                                      #N#                                     #N#            #N#             #N#                 #N#                    $O(n\log \log n)$#N#                 #N#             #N#        #N#                                   #N#                                 time and  #N#                                   #N#                                      #N#                                     #N#            #N#             #N#                 #N#                    $O(\sqrt{n}\log n)$#N#                 #N#             #N#        #N#                                   #N#                                 bits of space. #N#                          #N#                       #N#                       #N#                          – #N#                          #N#                             We also show how to modify the sieve of Atkin and Bernstein from 2004 to obtain a sieve that is simultaneously sublinear, compact, and incremental. #N#                          #N#                       #N#                    #N#                 #N#                 The second result solves an open problem given by Paul Pritchard in 1994.

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)