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: "rate optimal design of a wireless backhaul network using tv white space"
  Abstract: The penetration of wireless broadband services in remote areas has primarily been limited due to the lack of economic incentives that service providers encounter in sparsely populated areas. Besides, wireless backhaul links like satellite and microwave are either expensive or require strict line of sight communication making them unattractive. TV white space channels with their desirable radio propagation characteristics can provide an excellent alternative for engineering backhaul networks in areas that lack abundant infrastructure. Specifically, TV white space channels can provide “free wireless backhaul pipes” to transport aggregated traffic from broadband sources to fiber access points. In this paper, we investigate the feasibility of multi-hop wireless backhaul in the available white space channels by using noncontiguous Orthogonal Frequency Division Multiple Access (NC-OFDMA) transmissions between fixed backhaul towers. Specifically, we consider joint power control, scheduling and routing strategies to maximize the minimum rate across broadband towers in the network. Depending on the population density and traffic demands of the location under consideration, we discuss the suitable choice of cell size for the backhaul network. Using the example of available TV white space channels in Wichita, Kansas (a small city located in central USA), we provide illustrative numerical examples for designing such wireless backhaul network.

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)