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: "content delivery in erasure broadcast channels with cache and feedback"
  Abstract: We study a content delivery problem in a K-user erasure broadcast channel such that a content providing server wishes to deliver requested files to users, each equipped with a cache of a finite memory. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours reliably by the decentralized content placement, we characterize the achievable rate region as a function of the memory sizes and the erasure probabilities. The proposed delivery scheme, based on the broadcasting scheme by Wang and Gatzianas et al., exploits the receiver side information established during the placement phase. Our results can be extended to centralized content placement as well as multi-antenna broadcast channels with state feedback.

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 "content caching and delivery in wireless radio access networks"):
  with members:
    - "mobility aware coded storage and delivery"
    - "cache aided fog radio access networks with partial connectivity"
    - "a converse bound for cache aided interference networks"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "online edge caching and wireless delivery in fog aided networks with dynamic content popularity"

Connected through hyperedge HE-3 (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-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 "coded caching with heterogeneous cache sizes and link qualities the two user case"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching in a multi server system with random topology"
    - "benefits of cache assignment on degraded broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "cache aided content delivery over erasure broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "coded caching for heterogeneous systems an optimization perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "benefits of cache assignment on degraded broadcast channels"
    - "optimization of heterogeneous coded caching"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"

Connected through hyperedge HE-7 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching"):
  with members:
    - "cooperative multi sender index coding"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "leveraging coding techniques for speeding up distributed computing"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "achieving spatial scalability for coded caching over wireless networks"
    - "a new combinatorial design of coded distributed computing"
    - "low subpacketization schemes for coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"

Connected through hyperedge HE-8 (induced by source paper "the caching broadcast channel with a wire and cache tapping adversary of type ii"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "combination networks with or without secrecy constraints the impact of caching relays"

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)