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: "maximin share allocations on cycles"
  Abstract: The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the case when goods form a graph and the goal is to allocate goods to agents so that each agent's bundle forms a connected subgraph. For the maximin share fairness criterion researchers proved that if goods form a tree, allocations offering each agent a bundle of at least her maximin share value always exist. Moreover, they can be found in polynomial time. We consider here the problem of maximin share allocations of goods on a cycle. Despite the simplicity of the graph, the problem turns out to be significantly harder than its tree version. We present cases when maximin share allocations of goods on cycles exist and provide results on allocations guaranteeing each agent a certain portion of her maximin share. We also study algorithms for computing maximin share allocations of goods on cycles.

Connected through hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods"):
  with members:
    - "computing envy freeable allocations with limited subsidies"
    - "one dollar each eliminates envy"
    - "fair division of mixed divisible and indivisible goods"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "an improved approximation algorithm for maximin shares"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "comparing approximate relaxations of envy freeness"

Connected through hyperedge HE-2 (induced by source paper "the price of connectivity in fair division"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fairly allocating many goods with few queries"
    - "chore division on a graph"
    - "almost envy free allocations with connected bundles"
    - "fair division under cardinality constraints"
    - "when do envy free allocations exist"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-3 (induced by source paper "graphical one sided markets"):
  with members:
    - "schelling games on graphs"
    - "swap stability in schelling games on graphs"
    - "schelling segregation with strategic agents"
    - "fair allocation of indivisible items with externalities"
    - "almost envy free allocations with connected bundles"
    - "fair division of a graph"
    - "fair division via social comparison"
    - "efficient equilibria in polymatrix coordination games"

Connected through hyperedge HE-4 (induced by source paper "dividing a graphical cake"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "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"
    - "fair division of a graph"

Connected through hyperedge HE-5 (induced by source paper "an improved approximation algorithm for maximin shares"):
  with members:
    - "fair division of indivisible goods among strategic agents"
    - "a little charity guarantees almost envy freeness"
    - "connected fair allocation of indivisible goods"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "the fair division of hereditary set systems"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "groupwise maximin fair allocation of indivisible goods"
    - "approximation algorithms for computing maximin share allocations"

Connected through hyperedge HE-6 (induced by source paper "almost envy free allocations with connected bundles"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "comparing approximate relaxations of envy freeness"
    - "fair allocation of combinations of indivisible goods and chores"
    - "fairly allocating many goods with few queries"
    - "fair division under cardinality constraints"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-7 (induced by source paper "chore division on a graph"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "on the complexity of chore division"
    - "networked fairness in cake cutting"
    - "fair division of a graph"
    - "fair division via social comparison"

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.SI(Social and Information Networks)