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: "a ruin theoretic design approach for wireless cellular network sharing with facilities"
  Abstract: With the rise of cheap small-cells in wireless cellular networks, there are new opportunities for third party providers to service local regions via sharing arrangements with traditional operators. In fact, such arrangements are highly desirable for large facilities---such as stadiums, universities, and mines---as they already need to cover property costs, and often have fibre backhaul and efficient power infrastructure. In this paper, we propose a new network sharing arrangement between large facilities and traditional operators. Our facility network sharing arrangement consists of two aspects: leasing of core network access and spectrum from traditional operators; and service agreements with users. Importantly, our incorporation of a user service agreement into the arrangement means that resource allocation must account for financial as well as physical resource constraints. This introduces a new non-trivial dimension into wireless network resource allocation, which requires a new evaluation framework---the data rate is no longer the only main performance metric. Moreover, despite clear economic incentives to adopt network sharing for facilities, a business case is lacking. As such, we develop a general socio-technical evaluation framework based on ruin-theory, where the key metric for the sharing arrangement is the probability that the facility has less than zero revenue surplus. We then use our framework to evaluate our facility network sharing arrangement, which offers guidance for leasing and service agreement negotiations, as well as design of the wireless network architecture, taking into account network revenue streams.

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)