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 "on multi server coded caching in the low memory regime"):
  Abstract: In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small. We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at the content delivery phase. Surprisingly, in contrast to previous multi-server results which were proved to be order-optimal within a multiplicative factor of 2, for the low memory regime we prove that our achievable scheme is optimal. Moreover, we compare the performance of our scheme with the uncoded solution, and show our proposal improvement over the uncoded scheme. Our results also apply to Degrees-of-Freedom (DoF) analysis of Multiple-Input Single-Output Broadcast Channels (MISO-BC) with cache-enabled users, where the multiple-antenna transmitter replaces the role of multiple servers. This shows that interference management in the low memory regime needs different caching techniques compared with medium-high memory regimes discussed in previous works.

Includes members:
  Member "adding transmitters dramatically boosts coded caching gains for finite file sizes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "improved rate for a multi server coded caching":
    also connected through other hyperedges:
      (none)
  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 "physical layer schemes for wireless coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "multi antenna coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning to code coded caching via deep reinforcement learning")
  Member "on storage allocation in cache enabled interference channels with mixed csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna interference management for coded caching")
  Member "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "hierarchical coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")

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)