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 "throughput analysis of proportional fair scheduling for sparse and ultra dense interference limited ofdma lte networks"):
  Abstract: Various system tasks like interference coordination, handover decisions, admission control etc. in current cellular networks require precise mid-term (spanning over a few seconds) performance models. Due to channel-dependent scheduling at the base station, these performance models are not simple to obtain. Furthermore, LTE cellular systems are interference-limited, hence, the way interference is modelled is crucial for the accuracy. In this paper we present a closed-form analytical performance model for proportional fair scheduling in OFDMA/LTE networks. The model takes into account a precise SINR distribution into account. We refine our model with respect to uniform modulation and coding, as applied in LTE networks. Furthermore, the analytical analysis is extended also for ultra-dense deployments likely to happen in the 5-th generation of cellular networks. The resulting analytical performance model is validated by means of simulations considering realistic network deployments. Compared with related work, our model demonstrates a significantly higher accuracy for long-term throughput estimation.

Includes members:
  Member "study on scheduling techniques for ultra dense small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "analytical model of proportional fair scheduling in interference limited ofdma lte networks":
    also connected through other hyperedges:
      (none)

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)