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 "layered interference networks with delayed csi dof scaling with distributed transmitters"):
  Abstract: The layered interference network is investigated with delayed channel state information (CSI) at all nodes. It is demonstrated how multi-hopping can be utilized to increase the achievable degrees of freedom (DoF). In particular, a multi-phase transmission scheme is proposed for the $K$-user $2K$-hop interference network in order to systematically exploit the layered structure of the network and delayed CSI to achieve DoF values that scale with $K$. This result provides the first example of a network with distributed transmitters and delayed CSI whose DoF scales with the number of users.

Includes members:
  Member "interference and x networks with noisy cooperation and feedback":
    also connected through other hyperedges:
      (none)
  Member "capacity results for binary fading interference channels with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "ergodic interference alignment with delayed feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure retrospective interference alignment")
  Member "on the degrees of freedom of k user siso interference and x channels with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "linear degrees of freedom of the mimo x channel with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit")
  Member "degrees of freedom of two hop wireless networks everyone gets the entire cake":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "opportunistic network decoupling with virtual full duplex operation in multi source interfering relay networks")
  Member "fundamental limits of cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "on achieving local view capacity via maximal independent graph scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the degrees of freedom of two unicast wireless networks with delayed csit")

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)