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: "noisy broadcast networks with receiver caching"
  Abstract: We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure probabilities and no cache memories. We present lower and upper bounds on the capacity-memory tradeoff of this network. The lower bound is achieved by a new joint cache-channel coding idea and significantly improves on schemes that are based on separate cache-channel coding. We discuss how this coding idea could be extended to more general discrete memoryless broadcast channels and to unequal cache sizes. Our upper bound holds for all stochastically degraded broadcast channels. #R##N#For the described packet-erasure broadcast network, our lower and upper bounds are tight when there is a single weak receiver (and any number of strong receivers) and the cache memory size does not exceed a given threshold. When there are a single weak receiver, a single strong receiver, and two files, then we can strengthen our upper and lower bounds so as they coincide over a wide regime of cache sizes. #R##N#Finally, we completely characterise the rate-memory tradeoff for general discrete-memoryless broadcast channels with arbitrary cache memory sizes and arbitrary (asymmetric) rates when all receivers always demand exactly the same file.

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 "multi antenna coded content delivery with caching a low complexity solution"):
  with members:
    - "a low complexity cache aided multi antenna content delivery scheme"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "opportunistic content delivery in fading broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"
    - "edge caching wireless networks performance analysis and optimization"
    - "multi antenna interference management for coded caching"
    - "scalable content delivery with coded caching in multi antenna fading channels"

Connected through hyperedge HE-3 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm"):
  with members:
    - "caching at base stations with heterogeneous user demands and spatial locality"
    - "optimized base station cache allocation for cloud radio access network with multicast backhaul"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "cloud radio access networks with coded caching"
    - "analysis and optimization of caching and multicasting in large scale cache enabled wireless networks"

Connected through hyperedge HE-4 (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-5 (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-6 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "on coded caching with heterogeneous distortion requirements"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "a rate distortion approach to caching"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "distortion memory tradeoffs in cache aided wireless video delivery"
    - "on the average performance of caching and coded multicasting with random demands"

Connected through hyperedge HE-7 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "optimal error correcting delivery scheme for coded caching with symmetric batch prefetching"
    - "caching and delivery via interference elimination"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-8 (induced by source paper "on the optimality of ali niesen decentralized coded caching scheme with and without error correction"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "optimal error correcting delivery scheme for coded caching with symmetric batch prefetching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "online coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "optimal index codes with near extreme rates"

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)