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 "proximity aware balanced allocations in cache networks"):
  Abstract: We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems that reduces network imbalance. In this paper, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. #R##N#Since the memory limitation and the proximity constraint cause correlation in the server selection process, we may not benefit from the power of two choices in general. However, we prove that in certain regimes, in terms of memory limitation and proximity constraint, our scheme results in the maximum load of order $\Theta(\log\log n)$ (here $n$ is the number of servers and requests), and at the same time, leads to a low communication cost. This is an exponential improvement in the maximum load compared to the scheme which assigns each request to the nearest available replica. Finally, we investigate our scheme performance by extensive simulations.

Includes members:
  Member "multi server coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "balanced allocation on graphs a random walk approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "storage communication and load balancing trade off in distributed cache networks")
  Member "fundamental limits of caching in wireless d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  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 "femtocaching wireless video content delivery through distributed caching helpers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cache allocations for consecutive requests of categorized contents service provider s perspective")
  Member "tight bounds for parallel randomized load balancing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simple and sharp analysis of k means")
  Member "balanced allocation on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "load balancing performance in distributed storage with regular balanced redundancy")

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.DS(Data Structures and Algorithms)