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 "degrees of freedom of the bursty mimo x channel without feedback"):
  Abstract: We study the sum degrees of freedom (DoF) of the bursty MIMO X channel without feedback, where the four transmitter-receiver links are intermittently on-and-off, controlled by four Bernoulli random sequences which may be arbitrarily correlated, subject to a symmetry assumption: The two direct-links have the same level of burstiness, modeled by $\mathrm{Ber}(p_d)$, and so do the cross-links, modeled by $\mathrm{Ber}(p_c)$. The sum DoF is fully characterized in the regime where $\frac{p_c}{p_d}$ is small, i.e. below a certain threshold, and is partially characterized in the other regime where $\frac{p_c}{p_d}$ is above the threshold. The achievability is proved with a combination of Han-Kobayashi strategy and interference alignment, which can achieve strictly higher DoF than interference alignment alone. The converse proof employs a channel-state-sequence pairing technique. Striking differences are also found between the bursty and the non-bursty X channel. In particular, various interference alignment schemes that achieve the DoF of non-bursty X channels are found to be suboptimal when the channels become bursty. The reciprocity between the forward and the reverse links is lost, and the sum DoF does not saturate when the ratio of the transmitter and the receiver antennas exceeds $\frac{2}{3}$.

Includes members:
  Member "rover to orbiter communication in mars taking advantage of the varying topology":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degrees of freedom of the bursty mimo x channel with instantaneous topological information")
  Member "capacity results for binary fading interference channels with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "binary fading interference channel with no csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "communication through collisions opportunistic utilization of past receptions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "harnessing bursty interference in multicarrier systems with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "role of a relay in bursty multiple access channels")
  Member "topological interference management with alternating connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "opportunistic interference management for multicarrier systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "harnessing bursty interference in multicarrier systems with feedback")

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)