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: "topological interference management with alternating connectivity the wyner type three user interference channel"
  Abstract: Interference management in a three-user interference channel with alternating connectivity with only topological knowledge at the transmitters is considered. The network has a Wyner-type channel flavor, i.e., for each connectivity state the receivers observe at most one interference signal in addition to their desired signal. Degrees of freedom (DoF) upper bounds and lower bounds are derived. The lower bounds are obtained from a scheme based on joint encoding across the alternating states. Given a uniform distribution among the connectivity states, it is shown that the channel has 2+ 1/9 DoF. This provides an increase in the DoF as compared to encoding over each state separately, which achieves 2 DoF only.

Connected through hyperedge HE-1 (induced by source paper "topological interference management with decoded message passing"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "on critical index coding problems"
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "cognitive wyner networks with clustered decoding"

Connected through hyperedge HE-2 (induced by source paper "wireless coded caching a topological perspective"):
  with members:
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "complete interference mitigation through receiver caching in wyner s networks"
    - "multi library coded caching"
    - "effect of number of users in multi level coded caching"
    - "cache enabled broadcast packet erasure channels with state feedback"
    - "cache aided interference channels"

Connected through hyperedge HE-3 (induced by source paper "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"):
  with members:
    - "topological interference management with decoded message passing"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "topological interference management with reconfigurable antennas"
    - "storage capacity of repairable networks"
    - "topological interference management with transmitter cooperation"
    - "a rate distortion approach to index coding"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"

Connected through hyperedge HE-4 (induced by source paper "rover to orbiter communication in mars taking advantage of the varying topology"):
  with members:
    - "two hop interference channels impact of linear schemes"
    - "capacity results for binary fading interference channels with delayed csit"
    - "topological interference management through index coding"
    - "resolving entanglements in topological interference management with alternating connectivity"
    - "on the vector broadcast channel with alternating csit a topological perspective"
    - "topological interference management with alternating connectivity"
    - "wireless network information flow a deterministic approach"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-5 (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"
    - "index coding capacity how far can one go with only shannon inequalities"

Connected through hyperedge HE-6 (induced by source paper "resolving entanglements in topological interference management with alternating connectivity"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "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"
    - "on the degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "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)