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 through index coding"):
  Abstract: This paper studies linear interference networks, both wired and wireless, with no channel state information at the transmitters except a coarse knowledge of the end-to-end one-hop topology of the network that only allows a distinction between weak (zero) and significant (nonzero) channels and no further knowledge of the channel coefficients' realizations. The network capacity (wired) and degrees of freedom (DoF) (wireless) are found to be bounded above by the capacity of an index coding problem for which the antidote graph is the complement of the given interference graph. The problems are shown to be equivalent under linear solutions. An interference alignment perspective is then used to translate the existing index coding solutions into the wired network capacity and wireless network DoF solutions, as well as to find new and unified solutions to different classes of all three problems.

Includes members:
  Member "cognitive wyner networks with clustered decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "optimality of orthogonal access for one dimensional convex cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "degrees of freedom of time correlated miso broadcast channel with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate splitting for multi antenna downlink precoder design and practical implementation")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "an equivalence between network coding and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")
  Member "degrees of freedom of mimo x networks spatial scale invariance one sided decomposability and linear feasibility":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "degrees of freedom of interference networks with transmitter side caches")
  Member "degrees of freedom of interference channels with comp transmission and reception":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")

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)