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: "dynamic interference management"
  Abstract: A linear interference network is considered. Long-term fluctuations (shadow fading) in the wireless channel can lead to any link being erased with probability p. Each receiver is interested in one unique message that can be available at M transmitters. In a cellular downlink scenario, the case where M=1 reflects the cell association problem, and the case where M>1 reflects the problem of setting up the backhaul links for Coordinated Multi-Point (CoMP) transmission. In both cases, we analyze Degrees of Freedom (DoF) optimal schemes for the case of no erasures, and propose new schemes with better average DoF performance at high probabilities of erasure. For M=1, we characterize the average per user DoF, and identify the optimal assignment of messages to transmitters at each value of p. For general values of M, we show that there is no strategy for assigning messages to transmitters in large networks that is optimal for all values of p.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments"):
  with members:
    - "the role of transmitter cooperation in linear interference networks with block erasures"
    - "cognitive wyner networks with clustered decoding"
    - "flexible backhaul design and degrees of freedom for linear interference networks"
    - "optimality of orthogonal access for one dimensional convex cellular networks"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "approaching the capacity of wireless networks through distributed interference alignment"

Connected through hyperedge HE-2 (induced by source paper "the role of transmitter cooperation in linear interference networks with block erasures"):
  with members:
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"

Connected through hyperedge HE-3 (induced by source paper "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints"):
  with members:
    - "layered downlink precoding for c ran systems with full dimensional mimo"
    - "conferencing in wyner s asymmetric interference network effect of number of rounds"
    - "network mimo transmitters with no csi can still be very useful"
    - "cloud based topological interference management a case with no cooperative transmission gain"
    - "cell associations that maximize the average uplink downlink degrees of freedom"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "performance of cloud radio networks"
    - "topological interference management with transmitter cooperation"

Connected through hyperedge HE-4 (induced by source paper "cell associations that maximize the average uplink downlink degrees of freedom"):
  with members:
    - "layered downlink precoding for c ran systems with full dimensional mimo"
    - "conferencing in wyner s asymmetric interference network effect of number of rounds"
    - "performance of cloud radio networks"
    - "on uplink downlink duality for cellular ia"
    - "degrees of freedom of uplink downlink multiantenna cellular networks"
    - "cellular interference alignment"
    - "degrees of freedom of interference channels with comp transmission and reception"

Connected through hyperedge HE-5 (induced by source paper "dof analysis in a two layered heterogeneous wireless interference network"):
  with members:
    - "two hop interference channels impact of linear schemes"
    - "massive mimo for next generation wireless systems"

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)