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 "topological interference management with reconfigurable antennas"):
  Abstract: We study the symmetric degrees-of-freedom (DoF) of partially connected interference networks under linear coding strategies without channel state information at the transmitters beyond topology. We assume that the receivers are equipped with reconfigurable antennas that can switch among their preset modes. In such a network setting, we characterize the class of network topologies in which half linear symmetric DoF is achievable. Moreover, we derive a general upper bound on the linear symmetric DoF for arbitrary network topologies. We also show that this upper bound is tight if the transmitters have at most two co-interferers.

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 "throughput region of spatially correlated interference packet networks")
  Member "linear degrees of freedom for k user miso interference channels with blind interference alignment":
    also connected through other hyperedges:
      (none)
  Member "topological interference management with just retransmission what are the best topologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when does an ensemble of matrices with randomly scaled rows lose rank")
  Member "when does an ensemble of matrices with randomly scaled rows lose rank":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "topological interference management with decoded message passing")
  Member "topological interference management with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "topological interference management with alternating connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "index coding capacity how far can one go with only shannon inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")

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)