human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "when does an ensemble of matrices with randomly scaled rows lose rank"
  Abstract: We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. This problem has applications in wireless interference management and recommendation systems. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and graph theories to derive the necessary and sufficient conditions. As an application, we discuss how this result can be applied to the problem of topological interference management, and characterize the linear symmetric degrees of freedom for a class of network topologies.

Connected through hyperedge HE-1 (induced by source paper "topological interference management with decoded message passing"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "on critical index coding problems"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "cognitive wyner networks with clustered decoding"
    - "cellular interference alignment"

Connected through hyperedge HE-2 (induced by source paper "topological interference management with user admission control via riemannian optimization"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems"
    - "low rank matrix completion for topological interference management by riemannian pursuit"
    - "low rank tensor completion a riemannian manifold preconditioning approach"
    - "an overview of low rank matrix recovery from incomplete observations"
    - "wireless communications in the era of big data"
    - "heterogeneous cellular networks using wireless backhaul fast admission control and large system analysis"

Connected through hyperedge HE-3 (induced by source paper "low rank matrix completion for topological interference management by riemannian pursuit"):
  with members:
    - "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems"
    - "large scale convex optimization for dense wireless cooperative networks"
    - "large scale convex optimization for ultra dense cloud ran"
    - "feasibility of interference alignment for the mimo interference channel"
    - "a matrix completion approach to linear index coding problem"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "cellular interference alignment"

Connected through hyperedge HE-4 (induced by source paper "on tdma optimality in locally connected networks with no csit"):
  with members:
    - "network mimo transmitters with no csi can still be very useful"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "performance of cloud radio networks"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "optimality of orthogonal access for one dimensional convex cellular networks"

Connected through hyperedge HE-5 (induced by source paper "cloud based topological interference management a case with no cooperative transmission gain"):
  with members:
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "network mimo transmitters with no csi can still be very useful"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "performance of cloud radio networks"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

Connected through hyperedge HE-6 (induced by source paper "topological interference management with reconfigurable antennas"):
  with members:
    - "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit"
    - "linear degrees of freedom for k user miso interference channels with blind interference alignment"
    - "topological interference management with just retransmission what are the best topologies"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "topological interference management with alternating connectivity"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-7 (induced by source paper "topological interference management with just retransmission what are the best topologies"):
  with members:
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "resolving entanglements in topological interference management with alternating connectivity"
    - "itlinq a new approach for spectrum sharing in device to device communication systems"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "on the index coding problem and its relation to network coding and matroid theory"

Question: Please tell me which class the center node 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)