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: "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.

Connected through hyperedge HE-1 (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"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "topological interference management through index coding"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

Connected through hyperedge HE-2 (induced by source paper "topological interference management with transmitter cooperation"):
  with members:
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "topological interference management through index coding"
    - "the degrees of freedom region of temporally correlated mimo networks with delayed csit"
    - "on the capacity region for index coding"
    - "multilevel topological interference management"
    - "optimality of orthogonal access for one dimensional convex cellular networks"
    - "topological interference management with alternating connectivity"
    - "topological interference management with alternating connectivity the wyner type three user interference channel"

Connected through hyperedge HE-3 (induced by source paper "index coding capacity how far can one go with only shannon inequalities"):
  with members:
    - "topological interference management through index coding"
    - "on the capacity region for index coding"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"
    - "non shannon information inequalities in four random variables"
    - "lexicographic products and the power of non linear network coding"
    - "index coding via linear programming"

Connected through hyperedge HE-4 (induced by source paper "itlinq a new approach for spectrum sharing in device to device communication systems"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "spectrum sharing for device to device communication in cellular networks"
    - "topological interference management through index coding"
    - "on the optimality of treating interference as noise"
    - "power control for d2d underlaid cellular networks modeling algorithms and analysis"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "on achieving local view capacity via maximal independent graph scheduling"

Connected through hyperedge HE-5 (induced by source paper "topological interference management with alternating connectivity"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "on the synergistic benefits of alternating csit for the miso bc"
    - "the ergodic capacity of phase fading interference networks"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "degrees of freedom region for the mimo x channel"

Connected through hyperedge HE-6 (induced by source paper "optimality of orthogonal access for one dimensional convex cellular networks"):
  with members:
    - "topological interference management through index coding"
    - "cognitive wyner networks with clustered decoding"
    - "on the capacity region for index coding"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "index coding an interference alignment perspective"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "on the accuracy of the wyner model in cellular networks"

Connected through hyperedge HE-7 (induced by source paper "retroactive anti jamming for miso broadcast channels"):
  with members:
    - "topological interference management through index coding"
    - "topological interference management with alternating connectivity"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "the degrees of freedom regions of two user and certain three user mimo broadcast channels with delayed csit"
    - "completely stale transmitter channel state information is still very useful"

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)