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 "partially distributed resource allocation in small cell networks"):
  Abstract: We propose a four-stage hierarchical resource allocation scheme for the downlink of a large-scale small-cell network in the context of orthogonal frequency-division multiple access (OFDMA). Since interference limits the capabilities of such networks, resource allocation and interference management are crucial. However, obtaining the globally optimum resource allocation is exponentially complex and mathematically intractable. Here, we develop a partially decentralized algorithm to obtain an effective solution. The three major advantages of our work are as follows: 1) as opposed to a fixed resource allocation, we consider load demand at each access point (AP) when allocating spectrum; 2) to prevent overloaded APs, our scheme is dynamic in the sense that as the users move from one AP to the other, so do the allocated resources, if necessary, and such considerations generally result in huge computational complexity, which brings us to the third advantage: 3) we tackle complexity by introducing a hierarchical scheme comprising four phases: user association, load estimation, interference management via graph coloring, and scheduling. We provide mathematical analysis for the first three steps modeling the user and AP locations as Poisson point processes. Finally, we provide the results of numerical simulations to illustrate the efficacy of our scheme.

Includes members:
  Member "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic geometry analysis of sojourn time in multi tier cellular 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")
  Member "power control in two tier femtocell networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "game theory based joint task offloading and resources allocation algorithm for mobile edge computing")
  Member "femtocell networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology")
  Member "spectrum allocation in two tier networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "open closed and shared access femtocells in the downlink")

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.NI(Networking and Internet Architecture)