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: "dynamic pricing under a static calendar"
  Abstract: This work is motivated by our collaboration with a large Consumer Packaged Goods (CPG) company. We have found that while they appreciate the advantages of dynamic pricing, they deem it operationally much easier to plan out a static price calendar in advance.#R##N##R##N#In this paper, we investigate the efficacy of static control policies for dynamic revenue management problems. In these problems, a firm has limited inventory to sell over a finite time horizon where demand is known but stochastic. We consider both pricing and assortment controls, and derive simple static policies in the form of a price calendar or a planned sequence of assortments, respectively. We show that our policies are within 1-1/e (approximately 0.63) of the optimum under stationary (IID) demand, and 1/2 of optimum under non-stationary demand, with both guarantees approaching 1 if the starting inventory is large.#R##N##R##N#A main contribution of this work is developing a system of tools for establishing best-possible performance guarantees relative to linear programming relaxations: in the stationary setting, structural properties about static policies which provide a complete characterization of tight bounds; and in the non-stationary setting, an adaptation of the prophet inequalities from optimal stopping theory to pricing and assortment problems.#R##N##R##N#Finally, we demonstrate on data from the CPG company that our simple price calendars are effective.

Connected through hyperedge HE-1 (induced by source paper "assortment auctions a myersonian characterization for markov chain based choice models"):
  with members:
    - "prophet inequalities on the intersection of a matroid and a graph"
    - "multi stage and multi customer assortment optimization with inventory constraints"
    - "prophet secretary through blind strategies"
    - "a duality based unified approach to bayesian mechanism design"
    - "improved approximations for free order prophets and second price auctions"
    - "on policies for single leg revenue management with limited demand information"
    - "welfare maximization and truthfulness in mechanism design with ordinal preferences"
    - "mechanism design via correlation gap"

Connected through hyperedge HE-2 (induced by source paper "multi stage and multi customer assortment optimization with inventory constraints"):
  with members:
    - "attenuate locally win globally an attenuation based framework for online stochastic matching with timeouts"
    - "assortment optimization under the sequential multinomial logit model"
    - "improved approximation algorithms for stochastic matching"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"

Connected through hyperedge HE-3 (induced by source paper "network revenue management with limited switches known and unknown demand distributions"):
  with members:
    - "the bayesian prophet a low regret framework for online decision making"
    - "phase transitions and cyclic phenomena in bandits with switching constraints"
    - "bandits with knapsacks"

Connected through hyperedge HE-4 (induced by source paper "static pricing universal guarantees for reusable resources"):
  with members:
    - "pricing and optimization in shared vehicle systems an approximation framework"

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)