human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "truthful linear regression"
  Abstract: We consider the problem of fitting a linear model to data held by individuals who are concerned about their privacy. Incentivizing most players to truthfully report their data to the analyst constrains our design to mechanisms that provide a privacy guarantee to the participants; we use differential privacy to model individuals' privacy losses. This immediately poses a problem, as differentially private computation of a linear model necessarily produces a biased estimation, and existing approaches to design mechanisms to elicit data from privacy-sensitive individuals do not generalize well to biased estimators. We overcome this challenge through an appropriate design of the computation and payment scheme.

Connected through hyperedge HE-1 (induced by source paper "causal feature discovery through strategic modification"):
  with members:
    - "strategic adaptation to classifiers a causal perspective"
    - "the disparate effects of strategic manipulation"
    - "how do classifiers induce agents to invest effort strategically"
    - "the social cost of strategic classification"
    - "strategic classification from revealed preferences"
    - "budget feasible mechanisms for experimental design"
    - "buying private data without verification"
    - "linear regression as a non cooperative game"

Connected through hyperedge HE-2 (induced by source paper "mechanism design for multi party machine learning"):
  with members:
    - "incentive design for efficient federated learning in mobile networks a contract theory approach"
    - "federated learning strategies for improving communication efficiency"
    - "strategyproof linear regression in high dimensions"
    - "privacy preserving visual learning using doubly permuted homomorphic encryption"
    - "communication efficient learning of deep networks from decentralized data"
    - "auctions with severely bounded communication"

Connected through hyperedge HE-3 (induced by source paper "grinding the space learning to classify against strategic agents"):
  with members:
    - "equal opportunity in online classification with partial feedback"
    - "distribution independent pac learning of halfspaces with massart noise"
    - "strategizing against no regret learners"
    - "introduction to multi armed bandits"
    - "nearly tight bounds for robust proper learning of halfspaces with a margin"
    - "competing prediction algorithms"
    - "strategyproof linear regression in high dimensions"
    - "strategic classification from revealed preferences"

Connected through hyperedge HE-4 (induced by source paper "scalable and jointly differentially private packing"):
  with members:
    - "near optimal jointly private packing algorithms via dual multiplicative weight update"
    - "differentially private contextual linear bandits"
    - "private matchings and allocations"
    - "the possibilities and limitations of private prediction markets"
    - "privacy odometers and filters pay as you go composition"
    - "jointly private convex programming"
    - "local private efficient protocols for succinct histograms"
    - "coordination complexity small information coordinating large populations"

Connected through hyperedge HE-5 (induced by source paper "prior free data acquisition for accurate statistical estimation"):
  with members:
    - "strategyproof linear regression in high dimensions"
    - "strategic classification from revealed preferences"
    - "optimal data acquisition for statistical estimation"
    - "learning to incentivize eliciting effort via output agreement"
    - "informed truthfulness in multi task peer prediction"
    - "sequential peer prediction learning to elicit effort using posted prices"
    - "low cost learning via active data procurement"
    - "redrawing the boundaries on purchasing data from privacy sensitive individuals"

Connected through hyperedge HE-6 (induced by source paper "rewarding high quality data via influence functions"):
  with members:
    - "competitive statistical estimation with strategic data sources"
    - "towards efficient data valuation based on the shapley value"
    - "federated learning strategies for improving communication efficiency"
    - "strategyproof linear regression in high dimensions"
    - "optimal data acquisition for statistical estimation"
    - "statistical estimation with strategic data sources in competitive settings"
    - "approval voting and incentives in crowdsourcing"

Connected through hyperedge HE-7 (induced by source paper "individual sensitivity preprocessing for data privacy"):
  with members:
    - "blender enabling local search with a hybrid differential privacy model"
    - "tight lower bounds for locally differentially private selection"
    - "the possibilities and limitations of private prediction markets"
    - "adaptive learning with robust generalization guarantees"
    - "efficient lipschitz extensions for high dimensional graph statistics and node private degree distributions"
    - "heterogeneous differential privacy"
    - "buying private data without verification"
    - "calibrating data to sensitivity in private data analysis"

Connected through hyperedge HE-8 (induced by source paper "how do classifiers induce agents to invest effort strategically"):
  with members:
    - "the disparate effects of strategic manipulation"
    - "a short term intervention for long term fairness in the labor market"
    - "the social cost of strategic classification"
    - "strategyproof linear regression in high dimensions"
    - "strategic classification from revealed preferences"

Question: Please tell me which class the center node 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)