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 division via social comparison"
  Abstract: In the classical cake cutting problem, a resource must be divided among agents with different utilities so that each agent believes they have received a fair share of the resource relative to the other agents. We introduce a variant of the problem in which we model an underlying social network on the agents with a graph, and agents only evaluate their shares relative to their neighbors' in the network. This formulation captures many situations in which it is unrealistic to assume a global view, and also exposes interesting phenomena in the original problem. #R##N#Specifically, we say an allocation is locally envy-free if no agent envies a neighbor's allocation and locally proportional if each agent values her own allocation as much as the average value of her neighbor's allocations, with the former implying the latter. While global envy-freeness implies local envy-freeness, global proportionality does not imply local proportionality, or vice versa. A general result is that for any two distinct graphs on the same set of nodes and an allocation, there exists a set of valuation functions such that the allocation is locally proportional on one but not the other. #R##N#We fully characterize the set of graphs for which an oblivious single-cutter protocol-- a protocol that uses a single agent to cut the cake into pieces --admits a bounded protocol with $O(n^2)$ query complexity for locally envy-free allocations in the Robertson-Webb model. We also consider the price of envy-freeness, which compares the total utility of an optimal allocation to the best utility of an allocation that is envy-free. We show that a lower bound of $\Omega(\sqrt{n})$ on the price of envy-freeness for global allocations in fact holds for local envy-freeness in any connected undirected graph. Thus, sparse graphs surprisingly do not provide more flexibility with respect to the quality of envy-free allocations.

Connected through hyperedge HE-1 (induced by source paper "the price of connectivity in fair division"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "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"

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

Connected through hyperedge HE-3 (induced by source paper "fair division through information withholding"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "fair division with minimal sharing"
    - "a little charity guarantees almost envy freeness"
    - "maximin aware allocations of indivisible goods"
    - "when do envy free allocations exist"
    - "networked fairness in cake cutting"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-4 (induced by source paper "maximin aware allocations of indivisible goods"):
  with members:
    - "an improved envy free cake cutting protocol for four agents"
    - "groupwise maximin fair allocation of indivisible goods"
    - "almost envy freeness with general valuations"
    - "networked fairness in cake cutting"
    - "fair division of a graph"

Connected through hyperedge HE-5 (induced by source paper "cake cutting on graphs a discrete and bounded proportional protocol"):
  with members:
    - "an improved envy free cake cutting protocol for four agents"
    - "networked fairness in cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "a discrete and bounded envy free cake cutting protocol for four agents"

Connected through hyperedge HE-6 (induced by source paper "object reachability via swaps under strict and weak preferences"):
  with members:
    - "networked fairness in cake cutting"

Connected through hyperedge HE-7 (induced by source paper "fairness in online social network timelines measurements models and mechanism design"):
  with members:
    - "biases in the facebook news feed a case study on the italian elections"
    - "do diffusion protocols govern cascade growth"
    - "closing the ai knowledge gap"
    - "fairness of exposure in rankings"
    - "quantifying search bias investigating sources of bias for political searches in social media"
    - "alpha fair coded caching"
    - "on fairness and calibration"
    - "interventions over predictions reframing the ethical debate for actuarial risk assessment"

Connected through hyperedge HE-8 (induced by source paper "equity of attention amortizing individual fairness in rankings"):
  with members:
    - "fairness of exposure in rankings"
    - "ranking with fairness constraints"
    - "auditing search engines for differential satisfaction across demographics"
    - "fa ir a fair top k ranking algorithm"
    - "unbiased learning to rank with biased feedback"
    - "equality of opportunity in supervised learning"
    - "measuring fairness in ranked outputs"
    - "fairness through awareness"

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.DS(Data Structures and Algorithms)