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: "an algorithmic framework for approximating maximin share allocation of chores"
  Abstract: In this paper, we consider the problem of how to fairly dividing $m$ indivisible chores among $n$ agents. The fairness measure we considered here is the maximin share. The previous best known result is that there always exists a $\frac{4}{3}$ approximation maximin share allocation. With a novel algorithm, we can always find a $\frac{11}{9}$ approximation maximin share allocation for any instances. We also discuss how to improve the efficiency of the algorithm and its connection to the job scheduling problem.

Connected through hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods"):
  with members:
    - "computing envy freeable allocations with limited subsidies"
    - "one dollar each eliminates envy"
    - "fair division of mixed divisible and indivisible goods"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "maximin share allocations on cycles"
    - "an improved approximation algorithm for maximin shares"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "comparing approximate relaxations of envy freeness"

Connected through hyperedge HE-2 (induced by source paper "equitable allocations of indivisible chores"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fair division with minimal sharing"
    - "algorithms for competitive division of chores"
    - "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "almost envy freeness and welfare efficiency in fair division with goods or bads"
    - "fair allocation of combinations of indivisible goods and chores"

Connected through hyperedge HE-3 (induced by source paper "an improved approximation algorithm for maximin shares"):
  with members:
    - "fair division of indivisible goods among strategic agents"
    - "a little charity guarantees almost envy freeness"
    - "maximin share allocations on cycles"
    - "connected fair allocation of indivisible goods"
    - "the fair division of hereditary set systems"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "groupwise maximin fair allocation of indivisible goods"
    - "approximation algorithms for computing maximin share allocations"

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.GT(Computer Science and Game Theory)