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: "online algorithms with advice for bin packing and scheduling problems"
  Abstract: We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is ( 1 + e ) -competitive and uses O ( 1 e log ? 1 e ) bits of advice per request. For scheduling on m identical machines, with the objective function of any of makespan, machine covering and the minimization of the ? p norm, p 1 , we give similar results. We give online algorithms with advice which are ( 1 + e ) -competitive ( ( 1 / ( 1 - e ) ) -competitive for machine covering) and also use O ( 1 e log ? 1 e ) bits of advice per request. We complement our results by giving a lower bound that shows that for any online algorithm with advice to be optimal, for any of the above scheduling problems, a non-constant number (namely, at least ( 1 - 2 m n ) log ? m , where n is the number of jobs and m is the number of machines) of bits of advice per request is needed.

Connected through hyperedge HE-1 (induced by source paper "online bin covering with advice"):
  with members:
    - "a new lower bound for classic online bin packing"
    - "a new and improved algorithm for online bin packing"
    - "a simple ptas for the dual bin packing problem and advice complexity of its online version"
    - "on the power of advice and randomization for online bipartite matching"
    - "randomization can be as helpful as a glimpse of the future in online computation"
    - "a logarithmic additive integrality gap for bin packing"
    - "approximating bin packing within o log opt log log opt bins"
    - "online bin packing with advice"

Connected through hyperedge HE-2 (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"
    - "beating the harmonic lower bound for online bin packing"
    - "on the list update problem with advice"
    - "online makespan minimization with parallel schedules"
    - "online bin packing with advice"

Connected through hyperedge HE-3 (induced by source paper "online computation with untrusted advice"):
  with members:
    - "competitive caching with machine learned advice"
    - "a new lower bound for classic online bin packing"
    - "a new and improved algorithm for online bin packing"
    - "randomization can be as helpful as a glimpse of the future in online computation"
    - "online bin packing with advice"

Connected through hyperedge HE-4 (induced by source paper "weighted online problems with advice"):
  with members:
    - "on the power of advice and randomization for online bipartite matching"
    - "online bounded analysis"
    - "randomization can be as helpful as a glimpse of the future in online computation"
    - "advice complexity of the online induced subgraph problem"
    - "online makespan minimization with parallel schedules"

Connected through hyperedge HE-5 (induced by source paper "the advice complexity of a class of hard online problems"):
  with members:
    - "optimal online edge coloring of planar graphs with advice"
    - "on the list update problem with advice"
    - "on advice complexity of the k server problem under sparse metrics"
    - "online bin packing with advice"

Connected through hyperedge HE-6 (induced by source paper "optimal online edge coloring of planar graphs with advice"):
  with members:
    - "on the list update problem with advice"
    - "online makespan minimization with parallel schedules"
    - "online bin packing with advice"

Connected through hyperedge HE-7 (induced by source paper "online makespan minimization with parallel schedules"):
  with members:
    - "better algorithms for online bin stretching"
    - "on the value of job migration in online makespan minimization"

Connected through hyperedge HE-8 (induced by source paper "online bin packing with advice"):
  with members:
    - "polynomiality for bin packing with a constant number of item types"
    - "on the list update problem with advice"

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)