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 "verifiably truthful mechanisms"):
  Abstract: It is typically expected that if a mechanism is truthful, then the agents would, indeed, truthfully report their private information. But why would an agent believe that the mechanism is truthful? We wish to design truthful mechanisms, whose truthfulness can be verified efficiently (in the computational sense). Our approach involves three steps: (i) specifying the structure of mechanisms, (ii) constructing a verification algorithm, and (iii) measuring the quality of verifiably truthful mechanisms. We demonstrate this approach using a case study: approximate mechanism design without money for facility location.

Includes members:
  Member "complexity of mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mechanism design for public projects via neural networks")
  Member "on the power of deterministic mechanisms for facility location games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "from hotelling to load balancing approximation and the principle of minimum differentiation")
  Member "mix and match":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smoothed and average case approximation ratios of mechanisms beyond the worst case analysis")
  Member "truthful assignment without money":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "approximately optimal mechanism design via differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "facility location problem in differential privacy model revisited")
  Member "sum of us strategyproof selection from the selectors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "impartial selection with additive approximation guarantees")
  Member "on the power of randomization in algorithmic mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of black box mechanism design with priors")

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)