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 "cloud based topological interference management a case with no cooperative transmission gain"):
  Abstract: We study the problem of managing interference in linear networks, with backhaul constraints that admit centralized allocation of messages to transmitters through the cloud. Our setting is that of a generic channel, where no channel state information is available at the transmitters. Knowing only the network topology, we characterize the optimal decisions for assigning messages to transmitters, given that each receiver is interested in one message that can be available at N transmitters. We show that using linear cooperation schemes, the per user degrees of freedom does not increase as we increase N beyond unity. Hence, we conclude for the considered problem that linear cooperative transmission does not increase the degrees of freedom.

Includes members:
  Member "joint optimization of cloud and edge processing for fog radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "power efficient resource allocation in c rans with sinr constraints and deadlines")
  Member "network mimo transmitters with no csi can still be very useful":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust regularized zf in cooperative broadcast channel under distributed csit")
  Member "cloud radio access network virtualizing wireless access for dense heterogeneous systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "performance of cloud radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint uplink downlink cell associations for interference networks with local connectivity")
  Member "when does an ensemble of matrices with randomly scaled rows lose rank":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "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":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure degrees of freedom of one hop wireless networks with no eavesdropper csit")

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)