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 "interference networks with no csit impact of topology"):
  Abstract: We consider partially-connected $K$-user interference networks, where the transmitters have no knowledge about the channel gain values, but they are aware of network topology (or connectivity). We introduce several linear algebraic and graph theoretic concepts to derive new topology-based outer bounds and inner bounds on the symmetric degrees-of-freedom (DoF) of these networks. We evaluate our bounds for two classes of networks to demonstrate their tightness for most networks in these classes, quantify the gain of our inner bounds over benchmark interference management strategies, and illustrate the effect of network topology on these gains.

Includes members:
  Member "capacity results for binary fading interference channels with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "on the degrees of freedom of k user siso interference and x channels with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "degrees of freedom of two hop wireless networks everyone gets the entire cake":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "opportunistic network decoupling with virtual full duplex operation in multi source interfering relay networks")
  Member "sum capacity of interference channels with a local view impact of distributed decisions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir")
  Member "dynamic interference mitigation for generalized partially connected quasi static mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interference alignment via message passing")
  Member "on achieving local view capacity via maximal independent graph scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the degrees of freedom of two unicast wireless networks with delayed 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)