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: "offline and online incentive mechanism design for smart phone crowd sourcing"
  Abstract: In this paper, we consider the problem of incentive mechanism design for smart-phone crowd-sourcing. Each user participating in crowd-sourcing submits a set of tasks it can accomplish and its corresponding bid. The platform then selects the users and their payments to maximize its utility while ensuring truthfulness, individual rationality, profitability, and polynomial algorithm complexity. Both the offline and the online scenarios are considered, where in the offline case, all users submit their profiles simultaneously, while in the online case they do it sequentially, and the decision whether to accept or reject each user is done instantaneously with no revocation. The proposed algorithms for both the offline and the online case are shown to satisfy all the four desired properties of an efficient auction. Through extensive simulation, the performance of the offline and the online algorithm is also compared.

Connected through hyperedge HE-1 (induced by source paper "data collection and wireless communication in internet of things iot using economic analysis and pricing models a survey"):
  with members:
    - "economics of internet of things iot an information market approach"
    - "target tracking via crowdsourcing a mechanism design approach"
    - "non stationary resource allocation policies for delay constrained video streaming application to video over internet of things enabled networks"
    - "from participatory sensing to mobile crowd sensing"
    - "machine learning in wireless sensor networks algorithms strategies and applications"
    - "motivating smartphone collaboration in data acquisition and distributed computing"
    - "fairness and social welfare in incentivizing participatory sensing"
    - "optimal pricing and load sharing for energy saving in communications cooperation"

Connected through hyperedge HE-2 (induced by source paper "the online disjoint set cover problem and its applications"):
  with members:
    - "maximizing utility among selfish users in social groups"
    - "optimally approximating the coverage lifetime of wireless sensor networks"

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.CY(Computers and Society)