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: "on line paging against adversarially biased random inputs"
  Abstract: In evaluating an algorithm, worst-case analysis can be overly pessimistic. Average-case analysis can be overly optimistic. An intermediate approach shows that an algorithm does well on a broad class of input distributions. E. Koutsoupias and C. H. Papadimitriou (1994, in “Proc. of the 35th IEEE Annual Symp. on Foundation of Computer Science,” pp. 394?400, IEEE Press, New York) recently analyzed the least-recently-used (LRU) paging strategy in this manner, analyzing its performance on an input sequence generated by a so-called diffuse adversary?one that must choose each request probabilistically so that no page is chosen with probability more than some fixed ?0. They showed that LRU achieves the optimal competitive ratio (for deterministic on-line algorithms), but they did not determine the actual ratio. In this paper we estimate the optimal ratios within roughly a factor of two for both deterministic strategies and randomized strategies. Around the threshold ??1/k (where k is the cache size), the optimal ratios are both ?(lnk). Below the threshold the ratios tend rapidly to O(1). Above the threshold the ratio is unchanged for randomized strategies but tends rapidly to ?(k) for deterministic ones. We also show that the competitive ratios for First-in-first-out (FIFO) and Flush-when-full (FWF) are both k when ??1/k. In contrast, the ratio for LRU is less than 2lnk+4 when ?=1/k. It is folklore that LRU outperforms FIFO in practice, but to date the only other variant of competitive analysis in which LRU has been shown to outperform FIFO is the access graph model. For completeness, we give an alternate proof of the optimality of LRU.

Connected through hyperedge HE-1 (induced by source paper "practical bounds on optimal caching with variable object sizes"):
  with members:
    - "adaptive caching networks with optimality guarantees"
    - "general caching is hard even with small pages"
    - "tinylfu a highly efficient cache admission policy"
    - "a nearly linear time ptas for explicit fractional packing and covering linear programs"
    - "exact analysis of ttl cache networks the case of caching policies driven by stopping times"
    - "a combinatorial tilde o m 3 2 time algorithm for the min cost flow problem"
    - "a unified approach to the performance analysis of caching systems"
    - "performance evaluation of the random replacement policy for networks of caches"

Connected through hyperedge HE-2 (induced by source paper "approximating k forest with resource augmentation a primal dual approach"):
  with members:
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "rejecting jobs to minimize load and maximum flow time"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "clustering is difficult only when it does not matter"
    - "dial a ride from k forest"

Connected through hyperedge HE-3 (induced by source paper "stochastic dominance and the bijective ratio of online algorithms"):
  with members:
    - "relative worst order analysis a survey"
    - "an optimal randomized online algorithm for reordering buffer management"
    - "a comparison of performance measures for online algorithms"
    - "on line file caching"
    - "the k server dual and loose competitiveness for paging"

Connected through hyperedge HE-4 (induced by source paper "relative interval analysis of paging algorithms on access graphs"):
  with members:
    - "access graphs results for lru versus fifo under relative worst order analysis"
    - "list factoring and relative worst order analysis"
    - "a comparison of performance measures for online algorithms"
    - "truly online paging with locality of reference"
    - "the k server dual and loose competitiveness for paging"

Connected through hyperedge HE-5 (induced by source paper "first come first served for online slot allocation and huffman coding"):
  with members:
    - "online stochastic bin packing"
    - "huffman coding with letter costs a linear time approximation scheme"
    - "on the sum of squares algorithm for bin packing"

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)