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 "reduced transmission in multi server coded caching"):
  Abstract: Coded caching has been widely used in the wireless network for shifting the some transmissions during the peak traffic times to the off-peak traffic times. Multi-server coded caching, which can share responsibility for the total amount of transmission in the wireless network during the peak traffic times by means of the collaboration among these servers, can be seen everywhere in our life. The three servers setting (two data servers and one parity check server) is used in practice, e.g. redundant array of independent disks-4. In this scenario, there are total $N$ files which are equally stored in two data servers respectively and $K$ users each of which has the memory size of $M$ files. Each server connects to users by an independently channel. During the off-peak traffic times, two data servers place some parts of each files in each user's cache. In that time, servers do not know users' requests in future. During the peak traffic times each user just requests one file from $N$ files. Luo et al. in 2016 proposed the first coded caching scheme for this setting. In this paper, we proposed some method that further reduces the amount of transmission in each channel when $\frac{KM}{N}$ is odd. This method also improves the transmission rate for systems with general multiply servers.

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 in a multi server system with random topology":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "routing based delivery in combination type networks with random topology")
  Member "on the placement delivery array design for centralized coded caching scheme":
    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 "a new converse bound for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "caching and delivery via interference elimination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the optimality of uncoded cache placement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental limits of caching with secure delivery":
    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)