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: "beating the harmonic lower bound for online bin packing"
  Abstract: In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we present an online bin packing algorithm with asymptotic competitive ratio of 1.5813. This is the first improvement in fifteen years and reduces the gap to the lower bound by 15%. Within the well-known SuperHarmonic framework, no competitive ratio below 1.58333 can be achieved. #R##N#We make two crucial changes to that framework. First, some of our algorithm's decisions depend on exact sizes of items, instead of only their types. In particular, for each item with size in (1/3,1/2], we use its exact size to determine if it can be packed together with an item of size greater than 1/2. Second, we carefully mark it depending on how it ends up packed, and use these marks to bound how many bins of a certain kind can exist in the optimal solution. This gives us better lower bounds on the optimal solution value. We show that for each input, a single weighting function can be constructed to upper bound the competitive ratio on it. #R##N#We use this idea to simplify the analysis of SuperHarmonic, and show that the algorithm Harmonic++ is in fact 1.58880-competitive (Seiden proved 1.58889), and that 1.5884 can be achieved within the SuperHarmonic framework. Finally, we give a lower bound of 1.5762 for our new framework.

Connected through hyperedge HE-1 (induced by source paper "parallel online algorithms for the bin packing problem"):
  with members:
    - "a new lower bound for classic online bin packing"
    - "a new and improved algorithm for online bin packing"
    - "online algorithms with advice for bin packing and scheduling problems"
    - "on the list update problem with advice"
    - "online makespan minimization with parallel schedules"
    - "online bin packing with advice"

Connected through hyperedge HE-2 (induced by source paper "a lower bound for online rectangle packing"):
  with members:
    - "a new lower bound for classic online bin packing"
    - "a new and improved algorithm for online bin packing"
    - "lower bounds for several online variants of bin packing"
    - "online bin packing with cardinality constraints resolved"
    - "improved lower bounds for online hypercube and rectangle packing"

Connected through hyperedge HE-3 (induced by source paper "a new lower bound for classic online bin packing"):
  with members:
    - "a new and improved algorithm for online bin packing"
    - "online bin packing with cardinality constraints resolved"

Connected through hyperedge HE-4 (induced by source paper "fully dynamic bin packing with limited repacking"):
  with members:
    - "a new and improved algorithm for online bin packing"
    - "a tight approximation for fully dynamic bin packing without bundling"
    - "a logarithmic additive integrality gap for bin packing"
    - "fully dynamic bin packing revisited"
    - "a robust afptas for online bin packing with polynomial migration"

Connected through hyperedge HE-5 (induced by source paper "a new and improved algorithm for online bin packing"):
  with members:
    - "a logarithmic additive integrality gap for bin packing"

Connected through hyperedge HE-6 (induced by source paper "improved lower bounds for online hypercube and rectangle packing"):
  with members:
    - "a new and improved algorithm for online bin packing"
    - "lower bounds for several online variants of bin packing"

Connected through hyperedge HE-7 (induced by source paper "fully dynamic bin packing revisited"):
  with members:
    - "a new and improved algorithm for online bin packing"
    - "online strip packing with polynomial migration"
    - "fully dynamic bin packing with limited repacking"
    - "a tight approximation for fully dynamic bin packing without bundling"
    - "a faster fptas for the unbounded knapsack problem"
    - "a robust afptas for online bin packing with polynomial migration"

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)