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: "hiring expert consultants in e healthcare with budget constraint"
  Abstract: The expert advices or consultancies by the expert consultants (ECs) for any critical situation in healthcare are the most important event that occurs on a daily basis in the hospitals. As the success of any critical operation (or surgery) is heavily dependent on ECs, so they can be thought of as one of the crucial elements of the healthcare domain. In many critical situations, there may be a need to hire some ECs from outside of the hospital to provide their expertise to the needy patient(s) that are in-house to the hospital. Earlier this interesting situation of hiring ECs (mainly doctors) from outside of the hospital has been studied under both monetary environment (with infinite budget) and non-monetary environment (with zero budget). In this paper, a two pass algorithm is proposed for the fixed budget case, for the first time, in healthcare domain. In the first pass it is ensured that a substantial number of ECs must be aware of this hiring concept, so that they can participate in the bidding process and in the second pass, ECs are allocated to a patient satisfying its budget limit and it is interesting to note that the proposed algorithm satisfies truthfulness, individual rationality, and budget feasibility. Through exhaustive simulations, we evaluate the performance and validate our proposed mechanisms.

Connected through hyperedge HE-1 (induced by source paper "hiring expert consultants in e healthcare an analytics based two sided matching approach"):
  with members:
    - "hiring doctors in e healthcare with zero budget"
    - "mechanism design without money via stable matching"
    - "truthful assignment without money"

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)