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: "fair cake cutting in practice"
  Abstract: Using a lab experiment, we investigate the real-life performance of envy-free and proportional cake-cutting procedures with respect to fairness and preference manipulation. We find that envy-free procedures, in particular Selfridge-Conway, are fairer and also are perceived as fairer than their proportional counterparts, despite the fact that agents very often manipulate them. Our results support the practical use of the celebrated Selfridge-Conway procedure, and more generally, of envy-free cake-cutting mechanisms. #R##N#We also find that subjects learn their opponents' preferences after repeated interaction and use this knowledge to improve their allocated share of the cake. Learning reduces truth-telling behavior, but also reduces envy.

Connected through hyperedge HE-1 (induced by source paper "fairness and efficiency in cake cutting with single peaked preferences"):
  with members:
    - "obvious manipulations in cake cutting"
    - "fair division with minimal sharing"
    - "monotonicity and competitive equilibrium in cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-2 (induced by source paper "obvious manipulations in cake cutting"):
  with members:
    - "deterministic strategyproof and fair cake cutting"
    - "fair and square cake cutting in two dimensions"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "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)