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: "coexisting success probability and throughput of multi rat wireless networks with unlicensed band access"
  Abstract: In this letter, the coexisting success probability and throughput of a wireless network consisting of multiple subnetworks of different radio access technologies (RATs) is investigated. The coexisting success probability that is defined as the average of all success probabilities of all subnetworks is found in closed-form and it will be shown to have the concavity over the number of channels in the unlicensed band. The optimal deployment densities of all different RATs access points (APs) that maximize the coexisting success probability are shown to exist and can be found under the derived constraint on network parameters. The coexisting throughput is defined as the per-channel sum of all spectrum efficiencies of all subnetworks and numerical results show that it is significantly higher than the throughput of the unlicensed band only accessed by WiFi APs.

Connected through hyperedge HE-1 (induced by source paper "traffic management for heterogeneous networks with opportunistic unlicensed spectrum sharing"):
  with members:
    - "modeling and analyzing the coexistence of wi fi and lte in unlicensed spectrum"
    - "fundamentals of the downlink green coverage and energy efficiency in heterogeneous networks"
    - "on the limits of coexisting coverage and capacity in multi rat heterogeneous networks"
    - "random cell association and void probability in poisson distributed cellular networks"
    - "small cell traffic balancing over licensed and unlicensed bands"
    - "optimal cell load and throughput in green small cell networks with generalized cell association"
    - "coexistence of wi fi and heterogeneous small cell networks sharing unlicensed spectrum"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"

Connected through hyperedge HE-2 (induced by source paper "on the limits of coexisting coverage and capacity in multi rat heterogeneous networks"):
  with members:
    - "fundamentals of the downlink green coverage and energy efficiency in heterogeneous networks"
    - "random cell association and void probability in poisson distributed cellular networks"
    - "next generation m2m cellular networks challenges and practical considerations"
    - "optimal cell load and throughput in green small cell networks with generalized cell association"
    - "coexistence of wi fi and heterogeneous small cell networks sharing unlicensed spectrum"
    - "adaptive downlink comp in heterogeneous cellular networks with imperfect overhead messaging"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"

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)