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 "coded load balancing in cache networks"):
  Abstract: We consider a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Each incoming content request, arriving uniformly at random to these servers, will be redirected to one or more responsible servers for that request. While assigning each request to its nearest available replica seems to be a reasonable solution, specifically in terms of communication cost, it will result in overloaded servers. Thus, alternatively, we investigate a coded scheme which will address this problem. In this scheme, coded chunks of original files are stored in servers based on the files popularity distribution, which we consider to be Zipf. Then, upon each request arrival, by delivering enough coded chunks to the request origin, the request can be decoded. #R##N#Specifically, we show that if $n$ requests are assigned to $n$ servers based on the proposed coded scheme, the maximum load of servers will be $\Theta(1)$, while in the nearest replica strategy the maximum load is $\Theta(\log n)$. More surprisingly, this coded scheme will have the same communication cost performance as the nearest replica strategy, asymptotically. Finally, our numerical results show that the coded scheme surpasses the uncoded one even in non-asymptotic regimes.

Includes members:
  Member "network coding approach for information centric networking":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure distribution of protected content in information centric networking")
  Member "network coding for critical infrastructure networks":
    also connected through other hyperedges:
      (none)
  Member "caching at the edge with lt codes":
    also connected through other hyperedges:
      (none)
  Member "storage communication and load balancing trade off in distributed cache networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a novel communication cost aware load balancing in content delivery networks using honeybee algorithm")
  Member "optimizing mds codes for caching at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modeling analysis and optimization of caching in multi antenna small cell networks")
  Member "network coding meets multimedia a review":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "agile data offloading over novel fog computing infrastructure for cavs")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "subspace properties of network coding and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on network tomography with network coding")

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)