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 "distributed storage in mobile wireless networks with device to device communication"):
  Abstract: We consider the use of distributed storage (DS) to reduce the communication cost of content delivery in wireless networks. Content is stored ( cached ) in a number of mobile devices using an erasure correcting code. Users retrieve content from other devices using device-to-device communication or from the base station (BS), at the expense of higher communication cost. We address the repair problem when a device storing data leaves the cell. We introduce a repair scheduling where repair is performed periodically and derive analytical expressions for the overall communication cost of content download and data repair as a function of the repair interval. The derived expressions are then used to evaluate the communication cost entailed by DS using several erasure correcting codes. Our results show that DS can reduce the communication cost with respect to the case where content is downloaded only from the BS, provided that the repairs are performed frequently enough. If devices storing content arrive to the cell, the communication cost using DS is further reduced and, for a large enough arrival rate, it is always beneficial. Interestingly, we show that maximum distance separable codes, which do not perform well for classical DS, can yield a low overall communication cost in wireless DS.

Includes members:
  Member "optimizing mds codes for caching at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "modeling analysis and optimization of caching in multi antenna small cell networks")
  Member "fundamental limits of caching in wireless d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "base station assisted device to device communications for high throughput wireless video networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")
  Member "device to device data storage for mobile cellular systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimizing mds coded caching in wireless networks with device to device communication")
  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 "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "distributed storage allocations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a locality based approach for coded computation")

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)