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 "greeninfra capacity of large scale hybrid networks with cost effective infrastructure"):
  Abstract: The cost-effective impact and fundamental limits of infrastructure support with rate-limited wired backhaul links (i.e., GreenInfra support), directly connecting base stations (BSs), are analyzed in a large-scale hybrid network of unit node density, where multi-antenna BSs are deployed. We consider a general scenario such that the rate of each BS-to-BS link scales at an arbitrary rate relative to the number of randomly located wireless nodes, $n$. For the operating regimes with respect to the number of BSs and the number of antennas at each BS, we first analyze the minimum rate of each backhaul link, $C_{\textrm{BS}}$, required to guarantee the same throughput scaling as in the infinite-capacity backhaul link case. We then identify the operating regimes in which the required rate $C_{\textrm{BS}}$ scales slower than $n^\epsilon$ for an arbitrarily small $\epsilon>0$ (i.e., the regimes where $C_{\textrm{BS}}$ does not need to be infinitely large). We also show the case where our network with GreenInfra is fundamentally in the infrastructure-limited regime, in which the performance is limited by the rate of backhaul links. In addition, we derive a generalized throughput scaling law including the case where the rate of each backhaul link scales slower than $C_{\textrm{BS}}$. To validate the throughput scaling law for finite values of system parameters, numerical evaluation is also shown via computer simulations.

Includes members:
  Member "scaling laws for infrastructure single and multihop wireless networks in wideband regimes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity scaling of cellular networks impact of bandwidth infrastructure density and number of antennas")
  Member "parallel opportunistic routing in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the effects of subpacketization in content centric mobile networks")
  Member "improved capacity scaling in wireless networks with infrastructure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the effects of subpacketization in content centric mobile networks")
  Member "on capacity scaling in arbitrary wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks")
  Member "information theoretic operating regimes of large wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity scaling of cellular networks impact of bandwidth infrastructure density and number of antennas")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wireless mesh networking with devices equipped with multi connectivity")

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.IT(Information Theory)