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 packing and covering framework with convex objectives"
  Abstract: We consider online fractional covering problems with a convex objective, where the covering constraints arrive over time. Formally, we want to solve $\min\,\{f(x) \mid Ax\ge \mathbf{1},\, x\ge 0\},$ where the objective function $f:\mathbb{R}^n\rightarrow \mathbb{R}$ is convex, and the constraint matrix $A_{m\times n}$ is non-negative. The rows of $A$ arrive online over time, and we wish to maintain a feasible solution $x$ at all times while only increasing coordinates of $x$. We also consider "dual" packing problems of the form $\max\,\{c^\intercal y - g(\mu) \mid A^\intercal y \le \mu,\, y\ge 0\}$, where $g$ is a convex function. In the online setting, variables $y$ and columns of $A^\intercal$ arrive over time, and we wish to maintain a non-decreasing solution $(y,\mu)$. #R##N#We provide an online primal-dual framework for both classes of problems with competitive ratio depending on certain "monotonicity" and "smoothness" parameters of $f$; our results match or improve on guarantees for some special classes of functions $f$ considered previously. #R##N#Using this fractional solver with problem-dependent randomized rounding procedures, we obtain competitive algorithms for the following problems: online covering LPs minimizing $\ell_p$-norms of arbitrary packing constraints, set cover with multiple cost functions, capacity constrained facility location, capacitated multicast problem, set cover with set requests, and profit maximization with non-separable production costs. Some of these results are new and others provide a unified view of previous results, with matching or slightly worse competitive ratios.

Connected through hyperedge HE-1 (induced by source paper "online covering with sum of ell_q norm objectives"):
  with members:
    - "welfare maximization with production costs a primal dual approach"
    - "approximating sparse covering integer programs online"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-2 (induced by source paper "dynamic service placement for mobile micro clouds with predicted future costs"):
  with members:
    - "dynamic service migration in mobile edge clouds"
    - "online covering with convex objectives and applications"
    - "mobility induced service migration in mobile micro clouds"

Connected through hyperedge HE-3 (induced by source paper "worst case competitive analysis of online algorithms for conic optimization"):
  with members:
    - "online convex covering and packing problems"
    - "online covering with convex objectives and applications"
    - "fast algorithms for online stochastic convex programming"
    - "how the experts algorithm can help solve lps online"
    - "primal beats dual on online packing lps in the random order model"
    - "near optimal online algorithms for dynamic resource allocation problems"
    - "online stochastic packing applied to display ad allocation"
    - "a dynamic near optimal algorithm for online linear programming"

Connected through hyperedge HE-4 (induced by source paper "convex program duality fisher markets and nash social welfare"):
  with members:
    - "when does the price of anarchy tend to 1 in large walrasian auctions and fisher markets"
    - "apx hardness of maximizing nash social welfare with indivisible items"
    - "welfare maximization with production costs a primal dual approach"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "a rational convex program for linear arrow debreu markets"
    - "market equilibrium with transaction costs"

Connected through hyperedge HE-5 (induced by source paper "online and random order load balancing simultaneously"):
  with members:
    - "online submodular welfare maximization greedy beats 1 2 in random order"
    - "fast algorithms for online stochastic convex programming"
    - "tight bounds for online vector scheduling"
    - "online linear optimization via smoothing"
    - "primal beats dual on online packing lps in the random order model"

Connected through hyperedge HE-6 (induced by source paper "new convex programs for fisher s market model and its generalizations"):
  with members:
    - "welfare maximization with production costs a primal dual approach"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "a rational convex program for linear arrow debreu markets"

Connected through hyperedge HE-7 (induced by source paper "online convex covering and packing problems"):
  with members:
    - "welfare maximization with production costs a primal dual approach"
    - "online covering with convex objectives and applications"
    - "approximating sparse covering integer programs online"
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "welfare and profit maximization with production costs"

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)