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: "exploiting social trust assisted reciprocity star towards utility optimal socially aware crowdsensing"
  Abstract: Mobile crowdsensing takes advantage of pervasive mobile devices to collect and process data for a variety of applications (e.g., traffic monitoring, spectrum sensing). In this study, a socially-aware crowdsensing system is advocated, in which a cloud-based platform incentivizes mobile users to participate in sensing tasks} by leveraging social trust among users, upon receiving sensing requests. For this system, social trust assisted reciprocity (STAR) - a synergistic marriage of social trust and reciprocity, is exploited to design an incentive mechanism that stimulates users' participation. #R##N#Given the social trust structure among users, the efficacy of STAR for satisfying users' sensing requests is thoroughly investigated. Specifically, it is first shown that all requests can be satisfied if and only if sufficient social credit can be "transferred" from users who request more sensing service than they can provide to users who can provide more than they request. Then utility maximization for sensing services under STAR is investigated, and it is shown that it boils down to maximizing the utility of a circulation flow in the combined social graph and request graph. Accordingly, an algorithm that iteratively cancels a cycle of positive weight in the residual graph is developed, which computes the optimal solution efficiently, for both cases of divisible and indivisible sensing service. Extensive simulation results corroborate that STAR can significantly outperform the mechanisms using social trust only or reciprocity only.

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)