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: "optimal posted prices for online cloud resource allocation"
  Abstract: We study online resource allocation in a cloud computing platform, through a posted pricing mechanism: The cloud provider publishes a unit price for each resource type, which may vary over time; upon arrival at the cloud system, a cloud user either takes the current prices, renting resources to execute its job, or refuses the prices without running its job there. We design pricing functions based on the current resource utilization ratios, in a wide array of demand-supply relationships and resource occupation durations, and prove worst-case competitive ratios of the pricing functions in terms of social welfare. In the basic case of a single-type, non-recycled resource (i.e., allocated resources are not later released for reuse), we prove that our pricing function design is optimal, in that any other pricing function can only lead to a worse competitive ratio. Insights obtained from the basic cases are then used to generalize the pricing functions to more realistic cloud systems with multiple types of resources, where a job occupies allocated resources for a number of time slots till completion, upon which time the resources are returned back to the cloud resource pool.

Connected through hyperedge HE-1 (induced by source paper "online inventory management with application to energy procurement in data centers"):
  with members:
    - "introduction to online convex optimization"
    - "cost minimizing online algorithms for energy storage management with worst case guarantee"
    - "risk sensitive learning and pricing for demand response"
    - "peak aware online economic dispatching for microgrids"
    - "reducing electricity demand charge for data centers with partial execution"
    - "dynamic provisioning in next generation data centers with on site power production"
    - "optimal power cost management using stored energy in data centers"

Connected through hyperedge HE-2 (induced by source paper "on the posted pricing in crowdsourcing power of bonus"):
  with members:
    - "bayesian budget feasibility with posted pricing"
    - "approval voting and incentives in crowdsourcing"
    - "incentivizing high quality crowdwork"
    - "mechanism design for crowdsourcing an optimal 1 1 e competitive budget feasible mechanism for large markets"
    - "double or nothing multiplicative incentive mechanisms for crowdsourcing"
    - "truelabel confusions a spectrum of probabilistic models in analyzing multiple ratings"
    - "reputation based incentive protocols in crowdsourcing applications"
    - "optimal crowdsourcing contests"

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.NI(Networking and Internet Architecture)