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: "weighted maxmin fair share allocation of indivisible chores"
  Abstract: We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly used algorithms that work well for the allocation of goods to asymmetric agents, and even for chores to symmetric agents do not provide good approximations for allocation of chores to asymmetric agents under WMMS. As a consequence, we present a novel polynomial-time constant-approximation algorithm, via linear program, for OWMMS. For two special cases: the binary valuation case and the 2-agent case, we provide exact or better constant-approximation algorithms.

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"
    - "maximin share allocations on cycles"
    - "an improved approximation algorithm for maximin shares"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "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"
    - "an algorithmic framework for approximating maximin share allocation of 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 algorithmic framework for approximating maximin share allocation of chores"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "a little charity guarantees almost envy freeness"
    - "an improved approximation algorithm for maximin shares"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "fair allocation of combinations of indivisible goods and chores"
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-4 (induced by source paper "on weighted envy freeness in indivisible item allocation"):
  with members:
    - "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
    - "when do envy free allocations exist"
    - "the complexity of cake cutting with unequal shares"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "approximate maximin shares for groups of agents"
    - "democratic fair allocation of indivisible goods"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-5 (induced by source paper "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"):
  with members:
    - "fair division with minimal sharing"
    - "algorithms for competitive division of chores"
    - "fair allocation of combinations of indivisible goods and chores"
    - "on the proximity of markets with integral equilibria"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "competitive equilibria with indivisible goods and generic budgets"

Connected through hyperedge HE-6 (induced by source paper "strategyproof and approximately maxmin fair share allocation of chores"):
  with members:
    - "fair allocation of combinations of indivisible goods and chores"
    - "approximation algorithms for computing maximin share allocations"
    - "on truthful mechanisms for maximin share allocations"
    - "egalitarianism of random assignment mechanisms"

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)