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 "optimal budget feasible mechanisms for additive valuations"):
  Abstract: In this paper, we obtain tight approximation guarantee for budget-feasible mechanisms with an additive buyer. We propose a new simple randomized mechanism with approximation ratio of $2$, improving the previous best known result of $3$. Our bound is tight with respect to either the optimal offline benchmark, or its fractional relaxation. We also present a simple deterministic mechanism with the tight approximation guarantee of $3$ against the fractional optimum, improving the best known result of $\sqrt{2} + 2$ for the weaker integral benchmark.

Includes members:
  Member "on budget feasible mechanism design for symmetric submodular objectives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "simple and efficient budget feasible mechanisms for monotone submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "budget feasible mechanisms on matroids":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "coverage matching and beyond new results on budgeted mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "bayesian budget feasibility with posted pricing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "mechanism design for crowdsourcing an optimal 1 1 e competitive budget feasible mechanism for large markets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "budget feasible mechanisms for experimental design":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "causal feature discovery through strategic modification")
  Member "on the approximability of budget feasible mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")

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)