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 "communication complexity of cake cutting"):
  Abstract: We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and moving-knife), we roughly partition the various fair-allocation problems into 3 classes: "easy" (constant number of rounds of logarithmic many bits), "medium" (poly-logarithmic total communication), and "hard". Our main technical result concerns two of the "medium" problems (perfect allocation for 2 players and equitable allocation for any number of players) which we prove are not in the "easy" class. Our main open problem is to separate the "hard" from the "medium" classes.

Includes members:
  Member "consensus halving is ppa complete":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consenus halving does it ever get easier")
  Member "the query complexity of cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "contiguous cake cutting hardness results and approximation algorithms")
  Member "combinatorial auctions do need modest interaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "a discrete and bounded envy free cake cutting protocol for any number of agents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "waste makes haste bounded time algorithms for envy free cake cutting with free disposal":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dividing a graphical cake")
  Member "hardness results for consensus halving":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "consenus halving does it ever get easier")
  Member "communication complexity for algorithm designers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "welfare maximization with limited interaction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")

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)