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: "flexible backhaul design and degrees of freedom for linear interference networks"
  Abstract: The considered problem is that of maximizing the degrees of freedom (DoF) in cellular downlink, under a backhaul load constraint that limits the number of messages that can be delivered from a centralized controller to the base station transmitters. A linear interference channel model is considered, where each transmitter is connected to the receiver having the same index as well as one succeeding receiver. The backhaul load is defined as the sum of all the messages available at all the transmitters normalized by the number of users. When the backhaul load is constrained to an integer level B, the asymptotic per user DoF is shown to equal (4B-1)/(4B), and it is shown that the optimal assignment of messages to transmitters is asymmetric and satisfies a local cooperation constraint and that the optimal coding scheme relies only on zero-forcing transmit beamforming. Finally, an extension of the presented coding scheme is shown to apply for more general locally connected and two-dimensional networks.

Connected through hyperedge HE-1 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul"):
  with members:
    - "resolving a feedback bottleneck of multi antenna coded caching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"
    - "multi antenna coded caching"
    - "cache aided interference management in partially connected wireless networks"
    - "complete interference mitigation through receiver caching in wyner s networks"
    - "multi server coded caching"
    - "fundamental limits of caching"

Connected through hyperedge HE-2 (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"
    - "optimality of orthogonal access for one dimensional convex cellular networks"
    - "dynamic interference management"
    - "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-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 "cellular interference alignment"):
  with members:
    - "cellular interference alignment omni directional antennas and asymmetric configurations"
    - "feasibility of interference alignment for the mimo interference channel"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "interference channels with half duplex source cooperation"
    - "cognitive wyner networks with clustered decoding"
    - "on the optimality of treating interference as noise"
    - "degrees of freedom of mimo cellular networks decomposition and linear beamforming design"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"

Connected through hyperedge HE-5 (induced by source paper "on uplink downlink duality for cellular ia"):
  with members:
    - "cellular interference alignment omni directional antennas and asymmetric configurations"
    - "cognitive wyner networks with clustered decoding"
    - "cellular interference alignment"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"
    - "approximately optimal wireless broadcasting"
    - "joint source channel coding with side information using hybrid digital analog codes"

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)