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: "closed form rate outage probability for ofdma multi hop broadband wireless networks under nakagami m channels"
  Abstract: Rate outage probability is an important performance metric to measure the level of quality of service (QoS) in the 4th Generation (4G) broadband access networks. Thus, in this paper, we calculate a closed form expression of the rate outage probability for a given user in a down-link multi-hop OFDMA-based system encountered as a result of links channel variations. The channel random behavior on different subcarriers allocated to a given user is assumed to follow independent non-identical Nakagami-m distributions. Besides the rate outage probability formulas for single hop and multi-hop networks, we also derive a novel closed form formulas for the moment generating function, probability distribution function (pdf), and the cumulative distribution function (cdf) of a product of independent non-identical Gamma distributed random variables (RVs). These RVs are functions of the attainable signal-to-noise power ratio (SNR) on the allocated group of subcarriers. For single-hop scenario, inspired by the rate outage probability closed formula, we formulate an optimization problem in which we allocate subcarriers to users such that the total transmission rate is maximized while catering for fairness for all users. In the proposed formulation, fairness is considered by guaranteeing a minimum rate outage probability for each admitted user

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