human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "almost envy free allocations with connected bundles"):
  Abstract: We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an underlying item graph G. When the items are arranged in a path, we show that EF1 allocations are guaranteed to exist for arbitrary monotonic utility functions over bundles, provided that either there are at most four agents, or there are any number of agents but they all have identical utility functions. Our existence proofs are based on classical arguments from the divisible cake-cutting setting, and involve discrete analogues of cut-and-choose, of Stromquist's moving-knife protocol, and of the Su-Simmons argument based on Sperner's lemma. Sperner's lemma can also be used to show that on a path, an EF2 allocation exists for any number of agents. Except for the results using Sperner's lemma, all of our procedures can be implemented by efficient algorithms. Our positive results for paths imply the existence of connected EF1 or EF2 allocations whenever G is traceable, i.e., contains a Hamiltonian path. For the case of two agents, we completely characterize the class of graphs $G$ that guarantee the existence of EF1 allocations as the class of graphs whose biconnected components are arranged in a path. This class is strictly larger than the class of traceable graphs; one can be check in linear time whether a graph belongs to this class, and if so return an EF1 allocation.

Includes members:
  Member "fairly allocating contiguous blocks of indivisible items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores")
  Member "maximin share allocations on cycles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "comparing approximate relaxations of envy freeness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "fair allocation of combinations of indivisible goods and chores":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equitable allocations of indivisible chores")
  Member "fairly allocating many goods with few queries":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the price of connectivity in fair division")
  Member "fair division under cardinality constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "pareto optimal allocation of indivisible goods with connectivity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "equitable allocations of indivisible chores")

Question: Please tell me which class the source paper 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)