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 the complexity of chore division"
  Abstract: We study the proportional chore division problem where a protocol wants to divide a negatively valued object, called chore, among $n$ different players. The goal is to find an allocation such that cost of the chore assigned to each player be at most $1/n$ of the total cost. This problem is the dual variant of the cake cutting problem in which we want to allocate a desirable object. Edmonds and Pruhs showed that any protocol for the proportional cake cutting must use at least $\Omega(n \log n)$ queries in the worst case, however, finding a lower bound for the proportional chore division remained an interesting open problem. We show that chore division and cake cutting problems are closely related to each other and provide an $\Omega(n \log n)$ lower bound for chore division. We also consider the problem when players have unequal entitlements and show that any protocol for chore division and cake cutting must use an unbounded number of queries. Finally, we present a simple algorithm that allocates a chore among the players with unequal entitlements using an unbounded but finite number of queries.

Connected through hyperedge HE-1 (induced by source paper "chore division on a graph"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "networked fairness in cake cutting"
    - "fair division of a graph"
    - "fair division via social comparison"

Connected through hyperedge HE-2 (induced by source paper "truthful fair division without free disposal"):
  with members:
    - "deterministic strategyproof and fair cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "incentive compatible two player cake cutting"
    - "truthful fair division"

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)