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: "on the average performance of caching and coded multicasting with random demands"
  Abstract: For a network with one sender, $n$ receivers (users) and $m$ possible messages (files), caching side information at the users allows to satisfy arbitrary simultaneous demands by sending a common (multicast) coded message. In the worst-case demand setting, explicit deterministic and random caching strategies and explicit linear coding schemes have been shown to be order optimal. In this work, we consider the same scenario where the user demands are random i.i.d., according to a Zipf popularity distribution. In this case, we pose the problem in terms of the minimum average number of equivalent message transmissions. We present a novel decentralized random caching placement and a coded delivery scheme which are shown to achieve order-optimal performance. As a matter of fact, this is the first order-optimal result for the caching and coded multicasting problem in the case of random demands.

Connected through hyperedge HE-1 (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"
    - "noisy broadcast networks with receiver caching"
    - "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"

Connected through hyperedge HE-2 (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-3 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "interference networks with caches at both ends"
    - "on coded caching in the overloaded miso broadcast channel"
    - "multi antenna coded caching"

Connected through hyperedge HE-4 (induced by source paper "cache assisted broadcast relay wireless networks a delivery time cache memory tradeoff"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "waveform and spectrum management for unmanned aerial systems beyond 2025"
    - "cache aided interference management in partially connected wireless networks"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"

Connected through hyperedge HE-5 (induced by source paper "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "a novel centralized strategy for coded caching with non uniform demands"
    - "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands"
    - "speeding up distributed machine learning using codes"
    - "uncoded caching and cross level coded delivery for non uniform file popularity"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "structural properties of uncoded placement optimization for coded delivery"

Connected through hyperedge HE-6 (induced by source paper "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"
    - "adaptive delivery in caching networks"
    - "optimization of heterogeneous coded caching"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "multihop caching aided coded multicasting for the next generation of cellular networks"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "big data caching for networking moving from cloud to edge"

Connected through hyperedge HE-7 (induced by source paper "on coding for cache aided delivery of dynamic correlated content"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "centralized coded caching of correlated contents"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "correlation aware distributed caching and coded delivery"
    - "cache aided coded multicast for correlated sources"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "a rate distortion approach to caching"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-8 (induced by source paper "a novel centralized strategy for coded caching with non uniform demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "a new converse bound for coded caching"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of 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)