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: "sum rate maximizing cell association via dual connectivity"
  Abstract: This paper proposes a dual-connectivity (DC) profile allocation algorithm, in which a central macro base station (MBS) is underlaid with randomly scattered small base stations (SBSs), operating on different carrier frequencies. We introduce two dual-connectivity profiles and the differences among them. We utilize the characteristics of dual-connectivity profiles and their applying scenarios to reduce feasible combination set to consider. Algorithm analysis and numerical results verify that our proposed algorithm achieve the optimal algorithm's performance within 5 \% gap with quite low complexity up to $10^6$ times.

Connected through hyperedge HE-1 (induced by source paper "distributed user association in energy harvesting dense small cell networks a mean field multi armed bandit approach"):
  with members:
    - "distributed wireless power transfer with energy feedback"
    - "distributed user association in energy harvesting small cell networks an exchange economy with uncertainty"
    - "distributed user association in energy harvesting small cell networks a probabilistic bandit model"
    - "multi armed bandits with application to 5g small cells"
    - "user association in 5g networks a survey and an outlook"
    - "optimum transmission policies for energy harvesting sensor networks powered by a mobile control center"
    - "multicast aware caching for small cell networks"
    - "evolution toward 5g multi tier cellular wireless networks an interference management perspective"

Connected through hyperedge HE-2 (induced by source paper "exploiting dual connectivity in heterogeneous cellular networks"):
  with members:
    - "optimizing user association and activation fractions in heterogeneous wireless networks"
    - "distributed power allocations in heterogeneous networks with dual connectivity using backhaul state information"
    - "proportional fair traffic splitting and aggregation in heterogeneous wireless networks"
    - "an overview of load balancing in hetnets old myths and open problems"
    - "distributed pricing based user association for downlink heterogeneous cellular networks"
    - "user association for load balancing in heterogeneous cellular networks"
    - "spatial sinr games combining base station placement and mobile association"

Connected through hyperedge HE-3 (induced by source paper "optimal traffic splitting policy in lte based heterogeneous network"):
  with members:
    - "proportional fair traffic splitting and aggregation in heterogeneous wireless 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)