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 "interference alignment in dense wireless networks"):
  Abstract: We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer bounds for the $n\times n$-dimensional unicast and the $n\times 2^n$-dimensional multicast capacity regions of such a wireless network. These inner and outer bounds differ only by a factor $O(\log(n))$, yielding a fairly tight scaling characterization of the entire regions. The communication schemes achieving the inner bounds use interference alignment as a central technique and are, at least conceptually, surprisingly simple.

Includes members:
  Member "the ergodic capacity of phase fading interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs")
  Member "interference alignment based sum capacity bounds for random dense gaussian interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "delay rate tradeoff in ergodic interference alignment")
  Member "the balanced unicast and multicast capacity regions of large wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless 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 "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "product multicommodity flow in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gossip based information spreading in mobile networks")
  Member "information theoretic operating regimes of large wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity scaling of cellular networks impact of bandwidth infrastructure density and number of antennas")

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)