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: "existence of a simple and equitable fair division a short proof"
  Abstract: In this note we study how to share a good between n players in a simple and equitable way. We give a short proof for the existence of such fair divisions.

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"
    - "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "cake cutting explicit examples for impossibility results"):
  with members:
    - "don t cry to be the first symmetric fair division algorithms exist"
    - "the query complexity of cake cutting"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-3 (induced by source paper "don t cry to be the first symmetric fair division exist"):
  with members:
    - "cake cutting explicit examples for impossibility results"
    - "the query complexity of cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-4 (induced by source paper "don t cry to be the first symmetric fair division algorithms exist"):
  with members:
    - "the query complexity of cake cutting"

Connected through hyperedge HE-5 (induced by source paper "how to cut a cake with a gram matrix"):
  with members:
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "resource monotonicity and population monotonicity in cake cutting"

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)