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: "online cake cutting"
  Abstract: We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the Dubins-Spanier moving knife procedure can be adapted to apply to such online problems. We propose some desirable properties that online cake cutting procedures might possess like online forms of proportionality and envy-freeness, and identify which properties are in fact possessed by the different online cake procedures.

Connected through hyperedge HE-1 (induced by source paper "online fair division a survey"):
  with members:
    - "facility location problem with capacity constraints algorithmic and mechanism design perspectives"
    - "manipulating the probabilistic serial rule"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "the peerrank method for peer assessment"
    - "allocation in practice"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"

Connected through hyperedge HE-2 (induced by source paper "monotonicity and competitive equilibrium in cake cutting"):
  with members:
    - "competitive division of a mixed manna"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "nash social welfare approximation for strategic agents"
    - "continuity assumptions in cake cutting"
    - "redividing the cake"
    - "an algorithmic framework for strategic fair division"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"

Connected through hyperedge HE-3 (induced by source paper "a simple online fair division problem"):
  with members:
    - "dynamic fair division problem with general valuations"
    - "competitive division of a mixed manna"
    - "online fair division analysing a food bank problem"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-4 (induced by source paper "fair cake cutting in practice"):
  with members:
    - "truthful fair division without free disposal"
    - "deterministic strategyproof and fair cake cutting"
    - "an algorithmic framework for strategic fair division"
    - "incentive compatible two player cake cutting"
    - "information theoretic cutting of a cake"

Connected through hyperedge HE-5 (induced by source paper "resource monotonicity and population monotonicity in connected cake cutting"):
  with members:
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"

Connected through hyperedge HE-6 (induced by source paper "how to re divide a cake fairly"):
  with members:
    - "fair and square cake cutting in two dimensions"
    - "cutting a cake without harming the toppings"
    - "envy free cake cutting in two dimensions"
    - "web and internet economics"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "graph theoretic solutions to computational geometry problems"

Connected through hyperedge HE-7 (induced by source paper "redividing the cake"):
  with members:
    - "envy free cake cutting in two dimensions"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "graph theoretic solutions to computational geometry problems"

Connected through hyperedge HE-8 (induced by source paper "online fair division analysing a food bank problem"):
  with members:
    - "allocation in practice"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"

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.AI(Artificial Intelligence)