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: "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"
  Abstract: We consider a wireless network in which $K$ transmitters, each equipped with a single antenna, fully cooperate to serve $K$ single antenna receivers, each equipped with a cache memory. The transmitters have access to partial knowledge of the channel state information. For a symmetric setting, in terms of channel strength levels, partial channel knowledge levels and cache sizes, we characterize the generalized degrees of freedom (GDoF) up to a constant multiplicative factor. The achievability scheme exploits the interplay between spatial multiplexing gains and coded-multicasting gain. On the other hand, a cut-set argument in conjunction with a new application of the aligned image sets approach are used to derive the outer bound. We further show that the characterized order-optimal GDoF is also attained in a decentralized setting, where no coordination is required for content placement in the caches.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic"):
  with members:
    - "fundamental limits of wireless caching under uneven capacity channels"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "cache aided communications with multiple antennas at finite snr"
    - "centralized and decentralized cache aided interference management in heterogeneous parallel channels"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels"):
  with members:
    - "subpacketization rate trade off in multi antenna coded caching"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "a new design framework on device to device coded caching with optimal rate and significantly less subpacketizations"
    - "a low complexity cache aided multi antenna content delivery scheme"
    - "full coded caching gains for cache less users"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "centralized caching with unequal cache sizes"
    - "cache aided communications with multiple antennas at finite snr"

Connected through hyperedge HE-3 (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"
    - "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"
    - "flexible backhaul design and degrees of freedom for linear interference networks"
    - "fundamental limits of caching"

Connected through hyperedge HE-4 (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-5 (induced by source paper "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "alpha fair coded caching"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "fundamental limits of cloud and cache aided interference management with multi antenna base stations"

Connected through hyperedge HE-6 (induced by source paper "resolving a feedback bottleneck of multi antenna coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "full coded caching gains for cache less users"
    - "on multi server coded caching in the low memory regime"
    - "alpha fair coded caching"
    - "multi antenna interference management for coded caching"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"
    - "on the coded caching delivery design over wireless networks"

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)