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: "welfare maximization with production costs a primal dual approach"
  Abstract: We study online combinatorial auctions with production costs proposed by Blum et al. using the online primal dual framework. In this model, buyers arrive online, and the seller can produce multiple copies of each item subject to a non-decreasing marginal cost per copy. The goal is to allocate items to maximize social welfare less total production cost. For arbitrary (strictly convex and differentiable) production cost functions, we characterize the optimal competitive ratio achievable by online mechanisms/algorithms. We show that online posted pricing mechanisms, which are incentive compatible, can achieve competitive ratios arbitrarily close to the optimal, and construct lower bound instances on which no online algorithms, not necessarily incentive compatible, can do better. Our positive results improve or match the results in several previous work, e.g., Bartal et al., Blum et al., and Buchbinder and Gonen. Our lower bounds apply to randomized algorithms and resolve an open problem by Buchbinder and Gonen.

Connected through hyperedge HE-1 (induced by source paper "reducing inefficiency in carbon auctions with imperfect competition"):
  with members:
    - "sequential auctions and externalities"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-2 (induced by source paper "online primal dual algorithms with configuration linear programs"):
  with members:
    - "online covering with sum of ell_q norm objectives"
    - "online submodular maximization with preemption"
    - "online contention resolution schemes"
    - "tight bounds for online vector scheduling"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "optimal approximation for submodular and supermodular optimization with bounded curvature"
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-3 (induced by source paper "online covering with sum of ell_q norm objectives"):
  with members:
    - "online packing and covering framework with convex objectives"
    - "approximating sparse covering integer programs online"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-4 (induced by source paper "posted pricing sans discrimination"):
  with members:
    - "do prices coordinate markets"
    - "on the computational complexity of optimal simple mechanisms"
    - "on welfare approximation and stable pricing"
    - "the invisible hand of dynamic market pricing"
    - "sequential posted price mechanisms with correlated valuations"
    - "combinatorial auctions via posted prices"
    - "combinatorial walrasian equilibrium"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-5 (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"
    - "online packing and covering framework with convex objectives"
    - "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-6 (induced by source paper "new convex programs for fisher s market model and its generalizations"):
  with members:
    - "online packing and covering framework with convex objectives"
    - "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:
    - "online covering with convex objectives and applications"
    - "online packing and covering framework with convex objectives"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "online packing and covering framework with convex objectives"):
  with members:
    - "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)