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 "exploiting dual connectivity in heterogeneous cellular networks"):
  Abstract: We consider network utility maximization problems over heterogeneous cellular networks (HetNets) that permit dual connectivity. Dual connectivity (DC) is a feature that targets emerging practical HetNet deployments that will comprise of non-ideal (higher latency) connections between transmission nodes, and has been recently introduced to the LTE-Advanced standard. DC allows for a user to be simultaneously served by a macro node as well as one other (typically micro or pico) node and requires relatively coarser level coordination among serving nodes. For such a DC enabled HetNet we comprehensively analyze the problem of determining an optimal user association, where in any feasible association each user can be associated with (i.e., configured to receive data from) any one macro node (in a given set of macro nodes) and any one pico node that lies in the chosen macro node's coverage area. We consider the weighted sum rate system utility subject to per-user maximum and minimum rate constraints, as well as the proportional fairness (PF) system utility. For both utility choices we construct approximation algorithms and establish their respective approximation guarantees. We then validate the performance of our algorithms via numerical results.

Includes members:
  Member "optimizing user association and activation fractions in heterogeneous wireless networks":
    also connected through other hyperedges:
      (none)
  Member "distributed power allocations in heterogeneous networks with dual connectivity using backhaul state information":
    also connected through other hyperedges:
      (none)
  Member "proportional fair traffic splitting and aggregation in heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint path selection and rate allocation framework for 5g self backhauled mm wave networks")
  Member "sum rate maximizing cell association via dual connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed user association in energy harvesting dense small cell networks a mean field multi armed bandit approach")
  Member "an overview of load balancing in hetnets old myths and open problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a hybrid model based and data driven approach to spectrum sharing in mmwave cellular networks")
  Member "distributed pricing based user association for downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning based vehicle cell association algorithm for highly mobile millimeter wave communication")
  Member "user association for load balancing in heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "spatial sinr games combining base station placement and mobile association":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the interplay of competition and cooperation among service providers part ii")

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)