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 "the complexity of contracts"):
  Abstract: We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff over all incentive-compatible contracts---known in economics as "second-best" solutions. We also study a natural relaxation to approximately incentive-compatible contracts. #R##N#We focus on principal-agent settings with succinctly described (and exponentially large) outcome spaces. We show that the computational complexity of computing a near-optimal contract depends fundamentally on the number of agent actions. For settings with a constant number of actions, we present a fully polynomial-time approximation scheme (FPTAS) for the separation oracle of the dual of the problem of minimizing the principal's payment to the agent, and use this subroutine to efficiently compute a delta-incentive-compatible (delta-IC) contract whose expected payoff matches or surpasses that of the optimal IC contract. #R##N#With an arbitrary number of actions, we prove that the problem is hard to approximate within any constant c. This inapproximability result holds even for delta-IC contracts where delta is a sufficiently rapidly-decaying function of c. On the positive side, we show that simple linear delta-IC contracts with constant delta are sufficient to achieve a constant-factor approximation of the "first-best" (full-welfare-extracting) solution, and that such a contract can be computed in polynomial time.

Includes members:
  Member "delegated search approximates efficient search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the secretary recommendation problem")
  Member "a duality based unified approach to bayesian mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "simple versus optimal contracts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "escaping cannibalization correlation robust pricing for a unit demand buyer")
  Member "bernoulli factories and black box reductions in mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an efficient e bic to bic transformation and its application to black box reduction in revenue maximization")
  Member "the menu size complexity of revenue approximation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal mechanism design for single minded agents")
  Member "algorithmic bayesian persuasion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "public bayesian persuasion being almost optimal and almost persuasive")
  Member "mixture selection mechanism design and signaling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "public bayesian persuasion being almost optimal and almost persuasive")
  Member "non optimal mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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.DS(Data Structures and Algorithms)