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 "combination networks with or without secrecy constraints the impact of caching relays"):
  Abstract: This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches in addition to the end users. First, a new centralized coded caching scheme is developed that utilizes maximum distance separable (MDS) coding, jointly optimizes cache placement and delivery phase, and enables decomposing the combination network into a set virtual multicast sub-networks. It is shown that if the sum of the memory of an end user and its connected relay nodes is sufficient to store the database, then the server can disengage in the delivery phase and all the end users' requests can be satisfied by the caches in the network. Lower bounds on the normalized delivery load using genie-aided cut-set arguments are presented along with second hop optimality. Next recognizing the information security concerns of coded caching, this new model is studied under three different secrecy settings: 1) secure delivery where we require an external entity must not gain any information about the database files by observing the transmitted signals over the network links, 2) secure caching, where we impose the constraint that end users must not be able to obtain any information about files that they did not request, and 3) both secure delivery and secure caching, simultaneously. We demonstrate how network topology affects the system performance under these secrecy requirements. Finally, we provide numerical results demonstrating the system performance in each of the settings considered.

Includes members:
  Member "caching in combination networks novel multicast message generation and delivery by leveraging the network topology":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on coded caching with private demands")
  Member "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement")
  Member "coded caching for networks with the resolvability property":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "caching and delivery via interference elimination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "on caching with more users than files":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "fundamental limits of secretive coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subpacketization in coded caching with demand privacy")
  Member "fundamental limits of caching with secure delivery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on coded caching with private demands")
  Member "cache aided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)