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 data acquisition for statistical estimation"):
  Abstract: We consider a data analyst's problem of purchasing data from strategic agents to compute an unbiased estimate of a statistic of interest. Agents incur private costs to reveal their data and the costs can be arbitrarily correlated with their data. Once revealed, data are verifiable. This paper focuses on linear unbiased estimators. We design an individually rational and incentive compatible mechanism that optimizes the worst-case mean-squared error of the estimation, where the worst-case is over the unknown correlation between costs and data, subject to a budget constraint in expectation. We characterize the form of the optimal mechanism in closed-form. We further extend our results to acquiring data for estimating a parameter in regression analysis, where private costs can correlate with the values of the dependent variable but not with the values of the independent variables.

Includes members:
  Member "strategic classification from revealed preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decisions counterfactual explanations and strategic behavior")
  Member "low cost learning via active data procurement":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards data auctions with externalities")
  Member "truthful linear regression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "causal feature discovery through strategic modification")
  Member "redrawing the boundaries on purchasing data from privacy sensitive individuals":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prior free data acquisition for accurate statistical estimation")
  Member "buying private data without verification":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "causal feature discovery through strategic modification")
  Member "conducting truthful surveys cheaply":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards data auctions with externalities")
  Member "approximately optimal auctions for selling privacy when costs are correlated with data":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "prospect theoretic analysis of privacy preserving mechanism")
  Member "selling privacy at auction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "guidelines for implementing and auditing differentially private systems")

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)