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: "better algorithms for online bin stretching"
  Abstract: Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. #R##N#We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We also show a specialized algorithm for three bins with a stretching factor of 11/8 = 1.375.

Connected through hyperedge HE-1 (induced by source paper "discovering and certifying lower bounds for the online bin stretching problem"):
  with members:
    - "trustworthy graph algorithms"
    - "online bin stretching with three bins"
    - "a framework for the verification of certifying computations"

Connected through hyperedge HE-2 (induced by source paper "a two phase algorithm for bin stretching with stretching factor 1 5"):
  with members:
    - "the best two phase algorithm for bin stretching"

Connected through hyperedge HE-3 (induced by source paper "the best two phase algorithm for bin stretching"):
  with members:
    - "online bin stretching with three bins"

Connected through hyperedge HE-4 (induced by source paper "online bin stretching with three bins"):
  with members:
    - "the best two phase algorithm for bin stretching"

Connected through hyperedge HE-5 (induced by source paper "online makespan minimization with parallel schedules"):
  with members:
    - "online algorithms with advice for bin packing and scheduling problems"
    - "on the value of job migration in online makespan minimization"

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)