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 "optimization of lte radio resource block allocation for maritime channels"):
  Abstract: In this study, we describe the behavior of LTE over the sea and investigate the problem of radio resource block allocation in such SINR limited maritime channels. For simulations of such sea environment, we considered a network scenario of Bosphorus Strait in Istanbul, Turkey with different number of ships ferrying between two ports at a given time. After exploiting the network characteristics, we formulated and solved the radio resource allocation problem by max-min integer linear programming method. The radio resource allocation fairness in terms of Jain's fairness index was computed and it was compared with round robin and opportunistic methods. Results show that the max-min optimization method performs better than the opportunistic and round robin methods. This result in turn reflects that the max-min optimization method gives us the high minimum best throughput as compared to other two methods considering different ship density scenarios in the sea. Also, it was observed that as the number of ships begin to increase in the sea, the max-min method performs significantly better with good fairness as compared to the other two methods.

Includes members:
  Member "comparison of radio propagation models for long term evolution lte network":
    also connected through other hyperedges:
      (none)
  Member "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coexistence mechanism between embb and urllc in 5g wireless 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.NI(Networking and Internet Architecture)