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 "generalized low rank optimization for topological cooperation in ultra dense networks"):
  Abstract: Network densification is a natural way to support dense mobile applications under stringent requirements, such as ultra-low latency, ultra-high data rate, and massive connecting devices. Severe interference in ultra-dense networks poses a key bottleneck. Sharing channel state information (CSI) and messages across transmitters can potentially alleviate interferences and improve system performance. Most existing works on interference coordination require significant CSI signaling overhead and are impractical in ultra-dense networks. This paper investigate topological cooperation to manage interferences in message sharing based only on network connectivity information. In particular, we propose a generalized low-rank optimization approach to maximize achievable degrees-of-freedom (DoFs). To tackle the challenges of poor structure and non-convex rank function, we develop Riemannian optimization algorithms to solve a sequence of complex fixed rank subproblems through a rank growth strategy. By exploiting the non-compact Stiefel manifold formed by the set of complex full column rank matrices, we develop Riemannian optimization algorithms to solve the complex fixed-rank optimization problem by applying the semidefinite lifting technique and Burer-Monteiro factorization approach. Numerical results demonstrate the computational efficiency and higher DoFs achieved by the proposed algorithms.

Includes members:
  Member "no spurious local minima in nonconvex low rank problems a unified geometric analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "no spurious local minima in deep quadratic networks")
  Member "low rank matrix completion for topological interference management by riemannian pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low rank matrix completion a contemporary survey")
  Member "matrix completion has no spurious local minimum":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "an overview of low rank matrix recovery from incomplete observations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "large scale convex optimization for dense wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "large scale beamforming for massive mimo via randomized sketching")
  Member "feasibility of interference alignment for the mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "topological interference management with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")

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)