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 "the caching broadcast channel with a wire and cache tapping adversary of type ii"):
  Abstract: This paper introduces the notion of cache-tapping into the information theoretic models of coded caching. In particular, the wiretap II channel model in the presence of multiple receivers equipped with fixed-size cache memories, and an adversary who is able to choose symbols to tap into from cache placement, in addition to or in lieu of, delivery transmission, is introduced. The model is hence termed the caching broadcast channel with a wire and cache tapping adversary of type II. The legitimate parties know neither whether cache placement, delivery, or both phases are tapped, nor the positions in which they are tapped. Only the size of the overall tapped set is known. For the instance of two receivers and two library files, the strong secrecy capacity of the model, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified. Lower and upper bounds on the achievable strong secrecy file rate are derived when the library has more than two files. Achievability schemes in this paper rely on a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. A genie-aided upper bound, in which a genie provides the transmitter with user demands before cache placement, establishes the converse for the two files instance. For the library of more than two files, the upper bound is constructed by three successive channel transformations. Our results establish that strong information theoretic security is possible against a powerful adversary who optimizes its attack over both phases of communication in a cache-aided system.

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 heterogeneous cache sizes and link qualities the two user case":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages")
  Member "secrecy capacity memory tradeoff of erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on coded caching with private demands")
  Member "a new wiretap channel model and its strong secrecy capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "benefits of cache assignment on degraded broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cache aided content delivery over erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "combination networks with or without secrecy constraints the impact of caching relays":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on coded caching with private demands")

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)