human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "performance oriented association in large cellular networks with technology diversity"):
  Abstract: The development of mobile virtual network operators, where multiple wireless technologies (e.g. 3G and 4G) or operators with non-overlapping bandwidths are pooled and shared is expected to provide enhanced service with broader coverage, without incurring additional infrastructure cost. However, their emergence poses an unsolved question on how to harness such a technology and bandwidth diversity. This paper addresses one of the simplest questions in this class, namely, the issue of associating each mobile to one of those bandwidths. Intriguingly, this association issue is intrinsically distinct from those in traditional networks. We first propose a generic stochastic geometry model lending itself to analyzing a wide class of association policies exploiting various information on the network topology, e.g. received pilot powers and fading values. This model firstly paves the way for tailoring and designing an optimal association scheme to maximize any performance metric of interest (e.g. the probability of coverage) subject to the information known about the network. In this class of optimal association, we prove a result that the performance improves as the information known about the network increases. Secondly, this model is used to quantify the performance of any arbitrary association policy and not just the optimal association policy. We propose a simple policy called the Max-Ratio which is not-parametric, i.e. it dispenses with the statistical knowledge of base station deployments in stochastic geometry models. We also prove that this simple policy is optimal in a certain limiting regime of the wireless environment. Through simulations, we provide insights into (i) a practical compromise between performance gain and cost of estimating information and; (ii) the selection of association schemes under environments with different propagation models, i.e. path-loss exponents.

Includes members:
  Member "user association for load balancing in heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")

Question: Please tell me which class the source paper 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.IT(Information Theory)