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 "beyond the ultra dense barrier paradigm shifts on the road beyond 1000x wireless capacity"):
  Abstract: It has become increasingly clear that the current design paradigm for mobile broadband systems is not a scalable and economically feasible way to solve the expected future 'capacity crunch', in particular in indoor locations with large user densities. 'Moore's law', e.g. state-of-the art signal processing and advanced antenna techniques now being researched, as well as more millimeter wave spectrum indeed provide more capacity, but are not the answer to the 3-4 orders of magnitude more capacity at today's cost, that is needed.We argue that solving the engineering problem of providing high data rates alone is not sufficient. Instead we need to solve the techno-economic problem to find both business models and scalable technical solutions that provide extreme area capacity for a given cost and energy consumption. In this paper we will show that achieving very high capacities is indeed feasible in indoor environments.

Includes members:
  Member "asymptotic behavior of ultra dense cellular networks and its economic impact":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "self organized scheduling request for uplink 5g networks a d2d clustering approach")
  Member "economics of wifi offloading trading delay for cellular capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards jointly optimal placement and delivery to code or not to code in wireless caching networks")

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)