human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "competitive online optimization under inventory constraints"):
  Abstract: This paper studies online optimization under inventory (budget) constraints. While online optimization is a well-studied topic, versions with inventory constraints have proven difficult. We consider a formulation of inventory-constrained optimization that is a generalization of the classic one-way trading problem and has a wide range of applications. We present a new algorithmic framework, \textsf{CR-Pursuit}, and prove that it achieves the minimal competitive ratio among all deterministic algorithms (up to a problem-dependent constant factor) for inventory-constrained online optimization. Our algorithm and its analysis not only simplify and unify the state-of-the-art results for the standard one-way trading problem, but they also establish novel bounds for generalizations including concave revenue functions. For example, for one-way trading with price elasticity, the \textsf{CR-Pursuit} algorithm achieves a competitive ratio that is within a small additive constant (i.e., 1/3) to the lower bound of $\ln \theta+1$, where $\theta$ is the ratio between the maximum and minimum base prices.

Includes members:
  Member "balancing cost and dissatisfaction in online ev charging under real time pricing":
    also connected through other hyperedges:
      (none)
  Member "nested convex bodies are chaseable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "path length bounds for gradient descent and flow")
  Member "beyond matroids secretary problem and prophet inequality with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "online offering strategies for storage assisted renewable power producer in hour ahead market":
    also connected through other hyperedges:
      (none)
  Member "online convex optimization using predictions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond no regret competitive control via online optimization with memory")
  Member "a tale of two metrics simultaneous bounds on competitiveness and regret":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "competitive ratio versus regret minimization achieving the best of both worlds")
  Member "peak aware online economic dispatching for microgrids":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi agent meta reinforcement learning for self powered and sustainable edge computing systems")
  Member "the submodular secretary problem goes linear":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "submodular matroid secretary problem with shortlists")

Question: Please tell me which class the source paper 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.PF(Performance)