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 "throughput region of spatially correlated interference packet networks"):
  Abstract: In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for packet retransmission. Conventional random access protocols interrupt communication to resolve contention which reduces network throughput and increases latency and power consumption. In this work we take a different approach and we develop opportunistic random access protocols rather than pursuing conventional methods. We allow wireless nodes to communicate without interruption and to observe the interference pattern. We then use this interference pattern knowledge and channel statistics to counter the negative impact of interference. The result of our approach is better use of resources (e.g., time and energy) and higher network throughput. We prove the optimality of our protocols using an extremal rank-ratio inequality. An important part of our contributions is the integration of spatial correlation in our assumptions and results. We identify spatial correlation regimes in which inherently outdated feedback becomes as good as idealized instantaneous feedback, and correlation regimes in which feedback does not provide any throughput gain.

Includes members:
  Member "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degrees of freedom of full duplex cellular networks with reconfigurable antennas at base station")
  Member "optimal sum dof of the k user miso bc with current and delayed feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "feedback aided coded caching for the miso bc with small caches")
  Member "optimal dof of the k user broadcast channel with delayed and imperfect current csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback")
  Member "when does spatial correlation add value to delayed channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two user erasure interference channels with local delayed csit")
  Member "two user erasure interference channels with local delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "transmit beamforming for miso broadcast channels with statistical and delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multiuser millimeter wave beamforming strategies with quantized and statistical csit")
  Member "informational bottlenecks in two unicast wireless networks with delayed csit":
    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")
  Member "secure degrees of freedom region of the two user miso broadcast channel with alternating csit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure retrospective interference alignment")

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)