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: "learning and coordination of large and uncertain loads via flexible contracts with commitment"
  Abstract: Large electricity customers (e.g., large data centers) can exhibit huge and variable electricity demands, which poses significant challenges for the electricity suppliers to plan for sufficient capacity. Thus, it is desirable to design incentive and coordination mechanisms between the customers and the supplier to lower the capacity cost. This paper proposes a novel scheme based on flexible contracts. Unlike existing demand-side management schemes in the literature, a flexible contract leads to information revelation. That is, a customer committing to a flexible contract reveals valuable information about its future demand to the supplier. Such information revelation allows the customers and the supplier to share the risk of future demand uncertainty. On the other hand, the customer will still retain its autonomy in operation. We address two key challenges for the design of optimal flexible contracts: i) the contract design is a non-convex optimization problem and is intractable for a large number of customer types, and ii) the design should be robust to unexpected or adverse responses of the customers, i.e., a customer facing more than one contract yielding the same benefit may choose the contract less favorable to the supplier. We address these challenges by proposing sub-optimal contracts of low computational complexity that can achieve a provable fraction of the performance gain under the global optimum.

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.GT(Computer Science and Game Theory)