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 storage regions for massive random access"):
  Abstract: This paper introduces a new source coding paradigm called Massive Random Access (MRA). In MRA, a set of correlated sources is jointly encoded and stored on a server, and clients want to access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only authorized to extract a bitstream from the stored data: no re-encoding can be performed before the transmission of the specific client's request. In this paper, we formally define the MRA framework and we introduce the notion of rate-storage region to characterize the performance of MRA. From an information theoretic analysis, we derive achievable rate-storage bounds for lossless source coding of i.i.d. and non i.i.d. sources, and rate-storage distortion regions for Gaussian sources. We also show two practical implementations of MRA systems based on rate-compatible LDPC codes. Both the theoretical and the experimental results demonstrate that MRA systems can reach the same transmission rates as in traditional point to point source coding schemes, while having a reasonable storage cost overhead. These results constitute a breakthrough for many recent data transmission applications in which only a part of the data is requested by the clients.

Includes members:
  Member "cache aided coded multicast for correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rate memory trade off for caching and delivery of correlated sources")
  Member "universal wyner ziv coding for distortion constrained general side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coding for arbitrarily varying remote sources")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on multistage successive refinement for wyner ziv source coding with degraded side informations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)