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: "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
  Abstract: We consider fair allocation of indivisible items under additive utilities. When the utilities can be negative, the existence and complexity of an allocation that satisfies Pareto optimality and proportionality up to one item (PROP1) is an open problem. We show that there exists a strongly polynomial-time algorithm that always computes an allocation satisfying Pareto optimality and proportionality up to one item even if the utilities are mixed and the agents have asymmetric weights. We point out that the result does not hold if either of Pareto optimality or PROP1 is replaced with slightly stronger concepts.

Connected through hyperedge HE-1 (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"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "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-2 (induced by source paper "on weighted envy freeness in indivisible item allocation"):
  with members:
    - "weighted maxmin fair share allocation of indivisible chores"
    - "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"

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)