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 transmitter cooperation"):
  Abstract: Interference networks with no channel state information at the transmitter (CSIT) except for the knowledge of the connectivity graph have been recently studied under the topological interference management (TIM) framework. In this paper, we consider a similar problem with topological knowledge but in a distributed broadcast channel setting, i.e. a network where transmitter cooperation is enabled. We show that the topological information can also be exploited in this case to strictly improve the degrees of freedom (DoF) as long as the network is not fully connected, which is a reasonable assumption in practice. Achievability schemes based on selective graph coloring, interference alignment, and hypergraph covering, are proposed. Together with outer bounds built upon generator sequence, the concept of compound channel settings, and the relation to index coding, we characterize the symmetric DoF for so-called regular networks with constant number of interfering links, and identify the sufficient and/or necessary conditions for the arbitrary network topologies to achieve a certain amount of symmetric DoF.

Includes members:
  Member "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  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 "the degrees of freedom region of temporally correlated mimo networks with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "addressing the curse of mobility in massive mimo with prony based angular delay domain channel predictions")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "multilevel topological interference management":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit")
  Member "optimality of orthogonal access for one dimensional convex cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "topological interference management with alternating connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "topological interference management with alternating connectivity the wyner type three user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "topological interference management with decoded message passing")

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)