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 "capacity of three dimensional erasure networks"):
  Abstract: In this paper, we introduce a large-scale three-dimensional (3D) erasure network, where $n$ wireless nodes are randomly distributed in a cuboid of $n^{\lambda}\times n^{\mu}\times n^{\nu}$ with $\lambda+\mu+\nu=1$ for $\lambda,\mu,\nu>0$, and completely characterize its capacity scaling laws. Two fundamental path-loss attenuation models (i.e., exponential and polynomial power-law models) are used to suitably model an erasure probability for packet transmission. Then, under the two erasure models, we introduce a routing protocol using percolation highway in 3D space, and then analyze its achievable throughput scaling laws. It is shown that, under the two erasure models, the aggregate throughput scaling $n^{\min\{1-\lambda,1-\mu,1-\nu\}}$ can be achieved in the 3D erasure network. This implies that the aggregate throughput scaling $n^{2/3}$ can be achieved in 3D cubic erasure networks while $\sqrt{n}$ can be achieved in two-dimensional (2D) square erasure networks. The gain comes from the fact that, compared to 2D space, more geographic diversity can be exploited via 3D space, which means that generating more simultaneous percolation highways is possible. In addition, cut-set upper bounds on the capacity scaling are derived to verify that the achievable scheme based on the 3D percolation highway is order-optimal within a polylogarithmic factor under certain practical operating regimes on the decay parameters.

Includes members:
  Member "parallel opportunistic routing in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (induced by source paper "throughput scaling of covert communication over wireless adhoc 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.IT(Information Theory)