human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement"):
  Abstract: We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of $N$ files, $K$ caches with limited memory $M$, and $K$ users such that each user has access to $L$ consecutive caches with a cyclic wrap-around and requests one file from the central server's catalog. The server assists in file delivery by transmitting a message of size $R$ over a shared error-free link and the goal is to characterize the optimal rate-memory trade-off. This setup was proposed in [1] where an achievable rate and an information-theoretic lower bound were derived. However, the multiplicative gap between them was shown to scale linearly with the access degree $L$ and thus order-optimality could not be established. #R##N#A series of recent works have used a natural mapping of the coded caching problem to the well-known index coding problem to derive tighter characterizations of the optimal rate-memory trade-off under the additional assumption that the caches store uncoded content. We follow a similar strategy for the multi-access framework and provide new bounds for the optimal rate-memory trade-off $R^*(M)$ over all uncoded placement policies. In particular, we derive a new achievable rate for any $L \ge 1$ and a new lower bound, which works for any uncoded placement policy and $L \ge K/2$. We then establish that the (multiplicative) gap between the new achievable rate and the lower bound is at most $2$ independent of all parameters, thus establishing an order-optimal characterization of $R^*(M)$ for any $L\ge K/2$. This is significant improvement over the gap result in [1], albeit under the restriction of uncoded placement policies. Finally, we also characterize $R^*(M)$ exactly for a few special cases.

Includes members:
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "coded caching with shared caches fundamental limits with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "fundamental limits of caching in heterogeneous networks with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches")
  Member "novel decentralized coded caching through coded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mobility aware coded storage and delivery")
  Member "characterizing the rate memory tradeoff in cache networks within a factor of 2":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "improved converses and gap results for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "uncoded placement optimization for coded delivery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a unified framework for constructing centralized coded caching schemes")
  Member "a novel index coding scheme and its application to coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "device to device coded caching with distinct cache sizes")

Question: Please tell me which class the source paper 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)