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"
  Abstract: The topological interference management problem refers to the study of the capacity of partially connected linear (wired and wireless) communication networks with no channel state information at the transmitters (no CSIT) beyond the network topology, i.e., a knowledge of which channel coefficients are zero (weaker than the noise floor in the wireless case). While the problem is originally studied with fixed topology, in this work we explore the implications of varying connectivity, through a series of simple and conceptually representative examples. Specifically, we highlight the synergistic benefits of coding across alternating topologies.

Connected through hyperedge HE-1 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback"):
  with members:
    - "capacity region of erasure broadcast channels with common message and feedback"
    - "throughput region of spatially correlated interference packet networks"
    - "two user erasure interference channels with local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "wireless network information flow a deterministic approach"
    - "interference channels with rate limited feedback"

Connected through hyperedge HE-2 (induced by source paper "capacity results for finite field x channels with delayed csit"):
  with members:
    - "throughput region of spatially correlated interference packet networks"
    - "two user erasure interference channels with local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "interference channels with rate limited feedback"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "degrees of freedom of the bursty mimo x channel with instantaneous topological information"):
  with members:
    - "degrees of freedom of the bursty mimo x channel without feedback"
    - "rover to orbiter communication in mars taking advantage of the varying topology"
    - "capacity results for binary fading interference channels with delayed csit"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-4 (induced by source paper "throughput region of spatially correlated interference packet networks"):
  with members:
    - "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit"
    - "optimal sum dof of the k user miso bc with current and delayed feedback"
    - "optimal dof of the k user broadcast channel with delayed and imperfect current csit"
    - "when does spatial correlation add value to delayed channel state information"
    - "two user erasure interference channels with local delayed csit"
    - "transmit beamforming for miso broadcast channels with statistical and delayed csit"
    - "informational bottlenecks in two unicast wireless networks with delayed csit"
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"

Connected through hyperedge HE-5 (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-6 (induced by source paper "on the dof of parallel miso bcs with partial csit total order and separability"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "optimal dof region of the k user miso bc with partial csit"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "miso networks with imperfect csit a topological rate splitting approach"
    - "miso broadcast channel with hybrid csit beyond two users"
    - "gdof of the miso bc bridging the gap between finite precision and perfect csit"

Connected through hyperedge HE-7 (induced by source paper "miso networks with imperfect csit a topological rate splitting approach"):
  with members:
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "robust transmission in downlink multiuser miso systems a rate splitting approach"
    - "dof analysis of the mimo broadcast channel with alternating hybrid csit"
    - "rate analysis of two receiver miso broadcast channel with finite rate feedback a rate splitting approach"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "multilevel topological interference management"

Connected through hyperedge HE-8 (induced by source paper "when does spatial correlation add value to delayed channel state information"):
  with members:
    - "two user erasure interference channels with local delayed csit"
    - "informational bottlenecks in two unicast wireless networks with delayed csit"
    - "the value of local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "degrees of freedom region of the miso broadcast channel with general mixed 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)