human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "obvious manipulations in cake cutting"):
  Abstract: In cake-cutting, strategy-proofness is a very costly requirement in terms of fairness: for n = 2 it implies a dictatorial allocation, whereas for n ≥ 3 it requires that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril, called not-obvious manipulability, is compatible with the strong fairness property of proportionality, which guarantees that each agent receives 1/n of the cake. Both properties are satisfied by the leftmost leaves mechanism, an adaptation of the Dubins - Spanier moving knife procedure. Most other classical proportional mechanisms in literature are obviously manipulable, including the original moving knife mechanism. Not-obvious manipulability explains why leftmost leaves is manipulated less often in practice than other proportional mechanisms.

Includes members:
  Member "fair cake cutting in practice":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fairness and efficiency in cake cutting with single peaked preferences")
  Member "deterministic strategyproof and fair cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "truthful fair division without free disposal")
  Member "fair and square cake cutting in two dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dividing a graphical cake")
  Member "resource monotonicity and population monotonicity in connected cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "monotonicity and competitive equilibrium in cake cutting")
  Member "cake cutting algorithms for piecewise constant and piecewise uniform valuations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "monotonicity and competitive equilibrium in cake cutting")
  Member "truthful fair division":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fair division with minimal sharing")

Question: Please tell me which class the source paper 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)