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 "computational efficiency requires simple taxation"):
  Abstract: We characterize the communication complexity of truthful mechanisms. Our departure point is the well known taxation principle. The taxation principle asserts that every truthful mechanism can be interpreted as follows: every player is presented with a menu that consists of a price for each bundle (the prices depend only on the valuations of the other players). Each player is allocated a bundle that maximizes his profit according to this menu. We define the taxation complexity of a truthful mechanism to be the logarithm of the maximum number of menus that may be presented to a player. #R##N#Our main finding is that in general the taxation complexity essentially equals the communication complexity. The proof consists of two main steps. First, we prove that for rich enough domains the taxation complexity is at most the communication complexity. We then show that the taxation complexity is much smaller than the communication complexity only in "pathological" cases and provide a formal description of these extreme cases. #R##N#Next, we study mechanisms that access the valuations via value queries only. In this setting we establish that the menu complexity -- a notion that was already studied in several different contexts -- characterizes the number of value queries that the mechanism makes in exactly the same way that the taxation complexity characterizes the communication complexity. #R##N#Our approach yields several applications, including strengthening the solution concept with low communication overhead, fast computation of prices, and hardness of approximation by computationally efficient truthful mechanisms.

Includes members:
  Member "breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "inapproximability of truthful mechanisms via generalizations of the vc dimension":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "economic efficiency requires interaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "multi parameter mechanisms with implicit payment computation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an efficient e bic to bic transformation and its application to black box reduction in revenue maximization")
  Member "the menu size complexity of auctions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "the computational complexity of truthfulness in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "from convex optimization to randomized mechanisms toward optimal combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")

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)