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 "who to trust for truthfully maximizing welfare"):
  Abstract: We introduce a general approach based on \emph{selective verification} and obtain approximate mechanisms without money for maximizing the social welfare in the general domain of utilitarian voting. Having a good allocation in mind, a mechanism with verification selects few critical agents and detects, using a verification oracle, whether they have reported truthfully. If yes, the mechanism produces the desired allocation. Otherwise, the mechanism ignores any misreports and proceeds with the remaining agents. We obtain randomized truthful (or almost truthful) mechanisms without money that verify only $O(\ln m / \epsilon)$ agents, where $m$ is the number of outcomes, independently of the total number of agents, and are $(1-\epsilon)$-approximate for the social welfare. We also show that any truthful mechanism with a constant approximation ratio needs to verify $\Omega(\log m)$ agents. A remarkable property of our mechanisms is \emph{robustness}, namely that their outcome depends only on the reports of the truthful agents.

Includes members:
  Member "truthful approximations to range voting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "truthful ownership transfer with expert advice blending mechanism design with and without money")
  Member "combinatorial auctions without money":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "the exponential mechanism for social welfare private truthful and nearly optimal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a differentially private incentive design for traffic offload to public transportation")
  Member "on the power of deterministic mechanisms for facility location games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "from hotelling to load balancing approximation and the principle of minimum differentiation")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "approximately optimal mechanism design via differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "facility location problem in differential privacy model revisited")
  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")
  Member "optimal mechansim design and money burning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "benchmark design and prior independent optimization")

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)