human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on allocating goods to maximize fairness"
  Abstract: Given a set of $m$ agents and a set of $n$ items, where agent $A$ has utility $u_{A,i}$ for item $i$, our goal is to allocate items to agents to maximize fairness. Specifically, the utility of an agent is the sum of its utilities for items it receives, and we seek to maximize the minimum utility of any agent. While this problem has received much attention recently, its approximability has not been well-understood thus far: the best known approximation algorithm achieves an $\tilde{O}(\sqrt{m})$-approximation, and in contrast, the best known hardness of approximation stands at 2. #R##N#Our main result is an approximation algorithm that achieves an $\tilde{O}(n^{\eps})$ approximation for any $\eps=\Omega(\log\log n/\log n)$ in time $n^{O(1/\eps)}$. In particular, we obtain poly-logarithmic approximation in quasi-polynomial time, and for any constant $\eps > 0$, we obtain $O(n^{\eps})$ approximation in polynomial time. An interesting aspect of our algorithm is that we use as a building block a linear program whose integrality gap is $\Omega(\sqrt m)$. We bypass this obstacle by iteratively using the solutions produced by the LP to construct new instances with significantly smaller integrality gaps, eventually obtaining the desired approximation. #R##N#We also investigate the special case of the problem, where every item has a non-zero utility for at most two agents. We show that even in this restricted setting the problem is hard to approximate upto any factor better tha 2, and show a factor $(2+\eps)$-approximation algorithm running in time $poly(n,1/\eps)$ for any $\eps>0$. This special case can be cast as a graph edge orientation problem, and our algorithm can be viewed as a generalization of Eulerian orientations to weighted graphs.

Connected through hyperedge HE-1 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution"):
  with members:
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"
    - "unrelated machine scheduling of jobs with uniform smith ratios"
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "lift and round to improve weighted completion time on unrelated machines"
    - "minimizing flow time on unrelated machines"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-2 (induced by source paper "heterogeneous coded computation across heterogeneous workers"):
  with members:
    - "computation scheduling for distributed machine learning with straggling workers"
    - "hierarchical coded computation"
    - "wireless network intelligence at the edge"
    - "speeding up distributed machine learning using codes"
    - "speeding up distributed gradient descent by utilizing non persistent stragglers"
    - "on the effect of task to worker assignment in distributed computing systems with stragglers"
    - "on the optimal recovery threshold of coded matrix multiplication"
    - "coded computation over heterogeneous clusters"

Connected through hyperedge HE-3 (induced by source paper "restricted max min allocation approximation and integrality gap"):
  with members:
    - "integrality gap of the configuration lp for the restricted max min fair allocation"
    - "a tale of santa claus hypergraphs and matroids"
    - "restricted max min fair allocation"
    - "combinatorial algorithm for restricted max min fair allocation"
    - "quasi polynomial local search for restricted max min fair allocation"
    - "a new approximation technique for resource allocation problems"
    - "new constructive aspects of the lovasz local lemma"

Connected through hyperedge HE-4 (induced by source paper "local search breaks 1 75 for graph balancing"):
  with members:
    - "a quasi polynomial approximation for the restricted assignment problem"
    - "lazy local search meets machine scheduling"
    - "a combinatorial approximation algorithm for graph balancing with light hyper edges"
    - "quasi polynomial local search for restricted max min fair allocation"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-5 (induced by source paper "a tale of santa claus hypergraphs and matroids"):
  with members:
    - "integrality gap of the configuration lp for the restricted max min fair allocation"
    - "local search breaks 1 75 for graph balancing"
    - "restricted max min fair allocation"
    - "finding perfect matchings in bipartite hypergraphs"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-6 (induced by source paper "parameterized orientable deletion"):
  with members:
    - "not so easy problems for tree decomposable graphs"
    - "on the configuration lp for scheduling on unrelated machines"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-7 (induced by source paper "restricted max min fair allocation"):
  with members:
    - "on 1 epsilon restricted max min fair allocation problem"
    - "a new approximation technique for resource allocation problems"
    - "new constructive aspects of the lovasz local lemma"

Connected through hyperedge HE-8 (induced by source paper "fair allocation of indivisible goods improvement and generalization"):
  with members:
    - "fair allocation of indivisible goods to asymmetric agents"
    - "approximation algorithms for computing maximin share allocations"
    - "approximate maximin shares for groups of agents"
    - "combinatorial algorithm for restricted max min fair allocation"
    - "combinatorial auctions via posted prices"
    - "bayesian games and the smoothness framework"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "combinatorial auctions with decreasing marginal utilities"

Question: Please tell me which class the center node 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)