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 "a fast distributed algorithm for α fair packing problems"):
  Abstract: Over the past two decades, fair resource allocation problems received considerable attention in a variety of application areas. While polynomial time distributed algorithms have been designed for max-min fair resource allocation, the design of distributed algorithms with convergence guarantees for the more general �−fair allocations received little attention. In this paper, we study weighted �-fair packing problems, that is, the problems of maximizing the objective functions P j wjx 1 � j /(1 − �) when � 6 1 and P j wj lnxj when � = 1 over linear constraints Ax ≤ b, x ≥ 0, where wj are positive weights and A and b are non-negative. We consider the distributed computation model that was used for packing linear programs and network utility maximization problems. Under this model, we provide a distributed algorithm for general �. The algorithm uses simple local update rules and is stateless (namely, it allows asynchronous updates, is self-stabilizing, and allows incremental and local adjustments). It converges to approximate solutions in running times that have an inverse polynomial dependence on the approximation parameter ". The convergence time has polylogarithmic dependence on the problem size for � 6 1, and a nearly-linear dependence on the number of variables for � = 1. These are the best convergence times known for these problems.

Includes members:
  Member "max min fair rate allocation and routing in energy harvesting networks algorithmic analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a fast distributed stateless algorithm for alpha fair packing problems")
  Member "using optimization to break the epsilon barrier a faster and simpler width independent algorithm for solving positive linear programs in parallel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved convergence for ell_ infty and ell_1 regression via iteratively reweighted least squares")
  Member "an axiomatic theory of fairness in network resource allocation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair resource allocation in federated learning")
  Member "sequential and parallel algorithms for mixed packing and covering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed assignment with limited communication for multi robot multi target tracking")
  Member "congestion control with explicit rate indication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi path alpha fair resource allocation at scale in distributed software defined networks")

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.DC(Distributed, Parallel, and Cluster Computing)