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: "optimal sum dof of the k user miso bc with current and delayed feedback"
  Abstract: This work identifies the optimal sum degrees-of-freedom (DoF) of the $K$-user MISO Broadcast Channel (BC), in the presence of delayed channel-state information at the transmitter (CSIT) and additional current CSIT of imperfect precision. In a setting where the current channel estimation error scales - in the high SNR regime - as $\text{SNR}^{-\alpha}$ for $\alpha\in[0,1]$, the optimal sum-DoF takes the simple form $(1-\alpha) K/(\sum_{k=1}^K \frac{1}{k})+\alpha K$, and is the result of a novel scheme which deviates from existing efforts as it i) digitally combines interference, ii) uses MAT-type alignment where all symbols are decoded irrespective of order, and iii) utilizes a hierarchical quantizer whose output is distributed across rounds in a way that minimizes unwanted interference. These jointly deliver, for the first time, the elusive simultaneous scaling of both MAT-type delayed-CSI gains as well as ZF-type imperfect-CSI gains.

Connected through hyperedge HE-1 (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 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"
    - "capacity results for binary fading interference channels with delayed csit"

Connected through hyperedge HE-2 (induced by source paper "feedback aided coded caching for the miso bc with small caches"):
  with members:
    - "the synergistic gains of coded caching and delayed feedback"
    - "information theoretic caching sequential coding for computing"
    - "joint cache channel coding over erasure broadcast channels"
    - "critical database size for effective caching"
    - "on the benefits of edge caching for mimo interference alignment"
    - "finite length analysis of caching aided coded multicasting"
    - "a transfer learning approach for cache enabled wireless networks"
    - "effect of number of users in multi level coded caching"

Connected through hyperedge HE-3 (induced by source paper "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "optimal dof of the k user broadcast channel with delayed and imperfect current csit"
    - "achieving full dof in heterogeneous parallel broadcast channels with outdated csit"
    - "the synergistic gains of coded caching and delayed feedback"
    - "information theoretic caching sequential coding for computing"
    - "joint cache channel coding over erasure broadcast channels"
    - "critical database size for effective caching"

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)