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 "probabilistic verification for obviously strategyproof mechanisms"):
  Abstract: Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent definition. A research agenda, initiated in [Ferraioli&Ventre, AAAI 2017], is to find a small (possibly, the smallest) set of conditions allowing to implement an OSP mechanism. To this aim, we define a model of probabilistic verification wherein agents are caught misbehaving with a certain probability, and show how OSP mechanisms can implement every social choice function at the cost of either imposing very large fines for lies or verifying a linear number of agents.

Includes members:
  Member "gibbard satterthwaite success stories and obvious strategyproofness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "obvious strategyproofness needs monitoring for good approximations")
  Member "sequential posted price mechanisms with correlated valuations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "waterfall bandits learning to sell ads online")
  Member "no stable matching mechanism is obviously strategy proof":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "obvious strategyproofness needs monitoring for good approximations")
  Member "a simple and approximately optimal mechanism for an additive buyer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "combinatorial auctions without money":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "a truthful randomized mechanism for combinatorial public projects via convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the limitations of optimization from samples")

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)