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: "achieving full dof in heterogeneous parallel broadcast channels with outdated csit"
  Abstract: We consider communication over heterogeneous parallel channels, where a transmitter is connected to two users via two parallel channels: a multiple-input multiple-output (MIMO) broadcast channel (BC) and a noiseless rate-limited multicast channel. We characterize the optimal degrees of freedom (DoF) region of this setting when the transmitter has delayed channel state information (CSIT) regarding the MIMO BC. Our results show that jointly coding over the two channels strictly outperforms simple channel aggregation and can even achieve the instantaneous CSIT performance with completely outdated CSIT on the MIMO BC in the sum DoF sense; this happens when the multicast rate of the second channel is larger than a certain threshold. The main idea is to send information over the MIMO BC at a rate above its capacity and then use the second channel to send additional side information to allow for reliable decoding at both receivers. We call this scheme a two-phase overload-multicast strategy. We show that such a strategy is also sum DoF optimal for the    $K$   -user MIMO BC with a parallel multicast channel when the rate of the multicast channel is high enough and can again achieve the instantaneous CSIT performance (optimal sum DoF) with completely outdated CSIT. For the regime where the capacity of the multicast channel is small, we propose another joint coding strategy, which is sum DoF optimal.

Connected through hyperedge HE-1 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels"):
  with members:
    - "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "state adaptive coded caching for symmetric broadcast channels"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "storage latency trade off in cache aided fog radio access networks"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "the role of caching in future communication systems and networks"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"

Connected through hyperedge HE-2 (induced by source paper "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the dof of parallel miso bcs with partial csit total order and separability"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-3 (induced by source paper "the synergistic gains of coded caching and delayed feedback"):
  with members:
    - "information theoretic caching sequential coding for computing"
    - "joint cache channel coding over erasure broadcast channels"
    - "critical database size for effective caching"
    - "caching aided coded multicasting with multiple random requests"
    - "a transfer learning approach for cache enabled wireless networks"
    - "effect of number of users in multi level coded caching"
    - "the performance analysis of coded cache in wireless fading channel"
    - "cache enabled broadcast packet erasure channels with state feedback"

Connected through hyperedge HE-4 (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 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"
    - "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)