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 "upper bounds on number of steals in rooted trees"):
  Abstract: Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the computation can be modeled by rooted trees. In particular, we show that if the computation with n processors starts with one processor having a complete k-ary tree of height h (and the remaining n ? 1 processors having nothing), the maximum possible number of steals is ?i=1n(k?1)ihi${\sum }_{i=1}^{n}(k-1)^{i}\binom {h}{i}$.

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 "truthful allocation mechanisms without payments characterization and implications on fairness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "approximate maximin shares for groups of agents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "assigning a small agreeable set of indivisible items to multiple players":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing a small agreeable set of indivisible items")
  Member "on truthful mechanisms for maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "asymptotic existence of proportionally fair allocations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fairly allocating contiguous blocks of indivisible items")

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)