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 "speeding up future video distribution via channel aware caching aided coded multicast"):
  Abstract: Future Internet usage will be dominated by the consumption of a rich variety of online multimedia services accessed from an exponentially growing number of multimedia capable mobile devices. As such, future Internet designs will be challenged to provide solutions that can deliver bandwidth-intensive delay-sensitive on-demand video-based services over increasingly crowded and bandwidth-limited wireless access networks. One of the main reasons for the bandwidth stress facing wireless network operators is the difficulty to exploit the multicast nature of the wireless medium when wireless users or access points rarely experience the same channel conditions or access the same content at the same time. In this paper, we present and analyze a novel wireless video delivery paradigm based on the combined use of channel-aware caching and coded multicasting that allows simultaneously serving multiple cache-enabled receivers that may be requesting different content and experiencing different channel conditions. To this end, we reformulate the caching-aided coded multicast problem as a joint source-channel coding problem and design an achievable scheme that preserves the cache-enabled multiplicative throughput gains of the error-free scenario, by guaranteeing per-receiver rates unaffected by the presence of receivers with worse channel conditions.

Includes members:
  Member "joint cache channel coding over erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "order optimal rate of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "an efficient coded multicasting scheme preserving the multiplicative caching gain":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decentralized coded caching without file splitting")
  Member "finite length analysis of caching aided coded multicasting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the capacity of broadcast channels with degraded message sets and message cognition under different secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy capacity memory tradeoff of erasure broadcast channels")
  Member "distortion memory tradeoffs in cache aided wireless video delivery":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "a unified scheme for two receiver broadcast channels with receiver message side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a unified inner bound for the two receiver memoryless broadcast channel with channel state and message side information")
  Member "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secrecy capacity memory tradeoff of erasure broadcast channels")

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)