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 "replication based outer bounds and the optimality of half the cake for rank deficient mimo interference networks"):
  Abstract: In order to gain new insights into MIMO interference networks, the optimality of $\sum_{k=1}^K M_k/2$ (half the cake per user) degrees of freedom is explored for a $K$-user multiple-input-multiple-output (MIMO) interference channel where the cross-channels have arbitrary rank constraints, and the $k^{th}$ transmitter and receiver are equipped with $M_k$ antennas each. The result consolidates and significantly generalizes results from prior studies by Krishnamurthy et al., of rank-deficient interference channels where all users have $M$ antennas, and by Tang et al., of full rank interference channels where the $k^{th}$ user pair has $M_k$ antennas. The broader outcome of this work is a novel class of replication-based outer bounds for arbitrary rank-constrained MIMO interference networks where replicas of existing users are added as auxiliary users and the network connectivity is chosen to ensure that any achievable scheme for the original network also works in the new network. The replicated network creates a new perspective of the problem, so that even simple arguments such as user cooperation become quite powerful when applied in the replicated network, giving rise to stronger outer bounds, than when applied directly in the original network. Remarkably, the replication based bounds are broadly applicable not only to MIMO interference channels with arbitrary rank-constraints, but much more broadly, even beyond Gaussian settings.

Includes members:
  Member "genie chains exploring outer bounds on the degrees of freedom of mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable dof delay trade offs for the k user mimo interference channel with delayed csit")
  Member "are generalized cut set bounds tight for the deterministic interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity region of the symmetric injective k user deterministic interference channel")
  Member "degrees of freedom of the rank deficient interference channel with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the symmetric k user interference channels with limited feedback")
  Member "feasibility of interference alignment for the mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "the dof of the asymmetric mimo interference channel with square direct link channel matrices":
    also connected through other hyperedges:
      (none)
  Member "the feasibility conditions for interference alignment in mimo networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "topological interference management with user admission control via riemannian optimization")
  Member "genie tree and degrees of freedom of the symmetric mimo interfering broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the degrees of freedom of the miso interference broadcast channel with delayed csit")
  Member "a feasibility test for linear interference alignment in mimo channels with constant coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "role of interference alignment in wireless cellular network optimization")

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)