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 user admission control via riemannian optimization"):
  Abstract: Topological interference management (TIM) provides a promising way to manage interference only based on the network connectivity information. Previous works on the TIM problem mainly focus on using the index coding approach and graph theory to establish conditions of network topologies to achieve the feasibility of topological interference management. In this paper, we propose a novel user admission control approach via sparse and low-rank optimization to maximize the number of admitted users for achieving the feasibility of topological interference management. To assist efficient algorithms design for the formulated rank-constrained (i.e., degrees-of-freedom (DoF) allocation) l0-norm maximization (i.e., user capacity maximization) problem, we propose a regularized smoothed l1- norm minimization approach to induce sparsity pattern, thereby guiding the user selection. We further develop a Riemannian trust-region algorithm to solve the resulting rank-constrained smooth optimization problem via exploiting the quotient manifold of fixed-rank matrices. Simulation results demonstrate the effectiveness and near-optimal performance of the proposed Riemannian algorithm to maximize the number of admitted users for topological interference management.

Includes members:
  Member "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a fundamental tradeoff between computation and communication in distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beamforming design for large scale antenna arrays using deep learning")
  Member "low rank matrix completion for topological interference management by riemannian pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "low rank matrix completion a contemporary survey")
  Member "low rank tensor completion a riemannian manifold preconditioning approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nonconvex low rank symmetric tensor completion from noisy data")
  Member "an overview of low rank matrix recovery from incomplete observations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "wireless communications in the era of big data":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "artificial intelligence enabled wireless networking for 5g and beyond recent advances and future challenges")
  Member "heterogeneous cellular networks using wireless backhaul fast admission control and large system analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs")

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)