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: "improved approximation of storage rate tradeoff for caching with multiple demands"
  Abstract: Caching at the network edge has emerged as a viable solution for alleviating the severe capacity crunch in modern content centric wireless networks by leveraging network load-balancing in the form of localized content storage and delivery. In this work, we consider a cache-aided network where the cache storage phase is assisted by a central server and users can demand multiple files at each transmission interval. To service these demands, we consider two delivery models - $(1)$ centralized content delivery where user demands at each transmission interval are serviced by the central server via multicast transmissions; and $(2)$ device-to-device (D2D) assisted distributed delivery where users multicast to each other in order to service file demands. For such cache-aided networks, we present new results on the fundamental cache storage vs. transmission rate tradeoff. Specifically, we develop a new technique for characterizing information theoretic lower bounds on the storage-rate tradeoff and show that the new lower bounds are strictly tighter than cut-set bounds from literature. Furthermore, using the new lower bounds, we establish the optimal storage-rate tradeoff to within a constant multiplicative gap. We show that, for multiple demands per user, achievable schemes based on repetition of schemes for single demands are order-optimal under both delivery models.

Connected through hyperedge HE-1 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval"):
  with members:
    - "codedprivateml a fast and privacy preserving framework for distributed machine learning"
    - "on coded caching with private demands"
    - "device to device private caching with trusted server"
    - "private and secure distributed matrix multiplication with flexible communication load"
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the fundamental limits of coded data shuffling for distributed learning systems"
    - "near optimal coded data shuffling for distributed learning"

Connected through hyperedge HE-2 (induced by source paper "on coded caching with private demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "device to device secure coded caching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"

Connected through hyperedge HE-3 (induced by source paper "on coded caching with correlated files"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "on caching with more users than files"
    - "on the optimality of uncoded cache placement"
    - "caching aided coded multicasting with multiple random requests"
    - "caching and coded multicasting multiple groupcast index coding"
    - "on the capacity region for index coding"
    - "fundamental limits of caching"

Connected through hyperedge HE-4 (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-5 (induced by source paper "on the fundamental limits of fog ran cache aided networks with downlink and sidelink communications"):
  with members:
    - "an optimal linear error correcting delivery scheme for coded caching with shared caches"
    - "how much can d2d communication reduce content delivery latency in fog networks with edge caching"
    - "a new design framework on device to device coded caching with optimal rate and significantly less subpacketizations"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "full coded caching gains for cache less users"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"

Connected through hyperedge HE-6 (induced by source paper "rate memory trade off for caching and delivery of correlated sources"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coding for cache aided delivery of dynamic correlated content"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "centralized coded caching of correlated contents"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "information theoretic caching the multi user case"

Connected through hyperedge HE-7 (induced by source paper "decentralized caching schemes and performance limits in two layer networks"):
  with members:
    - "riding on the primary a new spectrum sharing paradigm for wireless powered iot devices"
    - "low subpacketization schemes for coded caching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "on edge caching with secrecy constraints"
    - "decentralized coded caching with distinct cache capacities"
    - "fundamental limits of secretive coded caching"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-8 (induced by source paper "efficient file delivery for coded prefetching in shared cache networks with multiple requests per user"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "novel decentralized coded caching through coded prefetching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "from uncoded prefetching to coded prefetching in coded caching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "caching and delivery via interference elimination"
    - "content caching and delivery over heterogeneous wireless networks"
    - "on the optimality of uncoded cache placement"

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)