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: "computing socially efficient cake divisions"
  Abstract: We consider a setting in which a single divisible good ("cake") needs to be divided between n players, each with a possibly different valuation function over pieces of the cake. For this setting, we address the problem of finding divisions that maximize the social welfare, focusing on divisions where each player needs to get one contiguous piece of the cake. We show that for both the utilitarian and the egalitarian social welfare functions it is NP-hard to find the optimal division. For the utilitarian welfare, we provide a constant factor approximation algorithm, and prove that no FPTAS is possible unless P=NP. For egalitarian welfare, we prove that it is NP-hard to approximate the optimum to any factor smaller than 2. For the case where the number of players is small, we provide an FPT (fixed parameter tractable) FPTAS for both the utilitarian and the egalitarian welfare objectives.

Connected through hyperedge HE-1 (induced by source paper "dividing a graphical cake"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "connected fair allocation of indivisible goods"
    - "chore division on a graph"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "fair and square cake cutting in two dimensions"

Connected through hyperedge HE-2 (induced by source paper "contiguous cake cutting hardness results and approximation algorithms"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fair and efficient cake division with connected pieces"
    - "connected fair allocation of indivisible goods"
    - "dividing a graphical cake"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "communication complexity of cake cutting"
    - "the query complexity of cake cutting"

Connected through hyperedge HE-3 (induced by source paper "fairly allocating contiguous blocks of indivisible items"):
  with members:
    - "almost envy freeness in group resource allocation"
    - "fair division of a graph"
    - "asymptotic existence of proportionally fair allocations"

Connected through hyperedge HE-4 (induced by source paper "fair and efficient cake division with connected pieces"):
  with members:
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"

Connected through hyperedge HE-5 (induced by source paper "parameterized algorithmics for computational social choice nine research challenges"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "prices matter for the parameterized complexity of shift bribery"
    - "are there any nicely structured preference profiles nearby"
    - "campaign management under approval driven voting rules"
    - "the control complexity of r approval from the single peaked case to the general case"
    - "complexity of control behaviors in k peaked elections for a variant of approval voting"
    - "approximating the maxcover problem with bounded frequencies in fpt time"
    - "confronting intractability via parameters"

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)