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: "secretary problems with convex costs"
  Abstract: We consider online resource allocation problems where given a set of requests our goal is to select a subset that maximizes a value minus cost type of objective function. Requests are presented online in random order, and each request possesses an adversarial value and an adversarial size. The online algorithm must make an irrevocable accept/reject decision as soon as it sees each request. The "profit" of a set of accepted requests is its total value minus a convex cost function of its total size. This problem falls within the framework of secretary problems. Unlike previous work in that area, one of the main challenges we face is that the objective function can be positive or negative and we must guard against accepting requests that look good early on but cause the solution to have an arbitrarily large cost as more requests are accepted. This requires designing new techniques. #R##N#We study this problem under various feasibility constraints and present online algorithms with competitive ratios only a constant factor worse than those known in the absence of costs for the same feasibility constraints. We also consider a multi-dimensional version of the problem that generalizes multi-dimensional knapsack within a secretary framework. In the absence of any feasibility constraints, we present an O(l) competitive algorithm where l is the number of dimensions; this matches within constant factors the best known ratio for multi-dimensional knapsack secretary.

Connected through hyperedge HE-1 (induced by source paper "online learning for min max discrete problems"):
  with members:
    - "introduction to online convex optimization"
    - "learning in non convex games with an optimization oracle"
    - "efficient online linear optimization with approximation algorithms"
    - "oracle efficient online learning and auction design"
    - "efficient algorithms for adversarial contextual learning"
    - "the computational power of optimization in online learning"
    - "learning in auctions regret is hard envy is easy"

Connected through hyperedge HE-2 (induced by source paper "strong algorithms for the ordinal matroid secretary problem"):
  with members:
    - "combinatorial secretary problems with ordinal information"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "secretary problems with non uniform arrival order"
    - "the submodular secretary problem goes linear"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"
    - "prophet inequalities with limited information"

Connected through hyperedge HE-3 (induced by source paper "prophets and secretaries with overbooking"):
  with members:
    - "think eternally improved algorithms for the temp secretary problem and extensions"
    - "combinatorial prophet inequalities"
    - "secretary problems with non uniform arrival order"
    - "building a good team secretary problems and the supermodular degree"
    - "combinatorial auctions via posted prices"
    - "advances on matroid secretary problems free order model and laminar case"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "buyback problem approximate matroid intersection with cancellation costs"

Connected through hyperedge HE-4 (induced by source paper "a framework for the secretary problem on the intersection of matroids"):
  with members:
    - "secretary problems with non uniform arrival order"
    - "online contention resolution schemes"
    - "prophet inequalities with limited information"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "polymatroid prophet inequalities"
    - "matroid prophet inequalities"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"

Connected through hyperedge HE-5 (induced by source paper "combinatorial prophet inequalities"):
  with members:
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "bayesian budget feasibility with posted pricing"
    - "secretary problems with non uniform arrival order"
    - "streaming algorithms for submodular function maximization"
    - "online submodular maximization with preemption"
    - "online contention resolution schemes"
    - "building a good team secretary problems and the supermodular degree"
    - "locally adaptive optimization adaptive seeding for monotone submodular functions"

Connected through hyperedge HE-6 (induced by source paper "online submodular maximization with free disposal randomization beats 0 25 for partition matroids"):
  with members:
    - "streaming algorithms for submodular function maximization"
    - "online submodular maximization with preemption"
    - "deterministic algorithms for submodular maximization problems"
    - "submodular maximization meets streaming matchings matroids and more"
    - "on the hardness of welfare maximization in combinatorial auctions with submodular valuations"
    - "randomized online algorithms for the buyback problem"

Connected through hyperedge HE-7 (induced by source paper "the submodular secretary problem goes linear"):
  with members:
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"
    - "prophet inequalities with limited information"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"
    - "the simulated greedy algorithm for several submodular matroid secretary problems"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "constrained non monotone submodular maximization offline and secretary algorithms"

Connected through hyperedge HE-8 (induced by source paper "offline and online models of budget allocation for maximizing influence spread"):
  with members:
    - "sketch based influence maximization and computation scaling up with guarantees"
    - "competitive contagion in networks"

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)