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 "general truthfulness characterizations via convex analysis"):
  Abstract: We present a model of truthful elicitation which generalizes and extends mechanisms, scoring rules, and a number of related settings that do not quite qualify as one or the other. Our main result is a characterization theorem, yielding characterizations for all of these settings, including a new characterization of scoring rules for non-convex sets of distributions. We generalize this model to eliciting some property of the agent's private information, and provide the first general characterization for this setting. We also show how this yields a new proof of a result in mechanism design due to Saks and Yu.

Includes members:
  Member "the lovasz bregman divergence and connections to rank aggregation clustering and web ranking":
    also connected through other hyperedges:
      (none)
  Member "designing markets for daily deals":
    also connected through other hyperedges:
      (none)
  Member "efficiency revenue trade offs in auctions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "price doubling and item halving robust revenue guarantees for item pricing")
  Member "approaching utopia strong truthfulness and externality resistant mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local computation mechanism design")
  Member "eliciting forecasts from self interested experts scoring rules for decision makers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on manipulation in prediction markets when participants influence outcomes directly")
  Member "a new understanding of prediction markets via no regret learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a decomposition of forecast error in prediction markets")
  Member "statistical exponential families a digest with flash cards":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the jensen shannon symmetrization of distances relying on abstract means")
  Member "characterizing truthful multi armed bandit mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sample complexity of incentivized exploration")

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)