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: "allocation in practice"
  Abstract: How do we allocate scarcere sources? How do we fairly allocate costs? These are two pressing challenges facing society today. I discuss two recent projects at NICTA concerning resource and cost allocation. In the first, we have been working with FoodBank Local, a social startup working in collaboration with food bank charities around the world to optimise the logistics of collecting and distributing donated food. Before we can distribute this food, we must decide how to allocate it to different charities and food kitchens. This gives rise to a fair division problem with several new dimensions, rarely considered in the literature. In the second, we have been looking at cost allocation within the distribution network of a large multinational company. This also has several new dimensions rarely considered in the literature.

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"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "online cake cutting"

Connected through hyperedge HE-2 (induced by source paper "deceased organ matching in australia"):
  with members:
    - "manipulating the probabilistic serial rule"
    - "online fair division analysing a food bank problem"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"

Connected through hyperedge HE-3 (induced by source paper "online fair division analysing a food bank problem"):
  with members:
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "online 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.AI(Artificial Intelligence)