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: "eliciting expertise without verification"
  Abstract: A central question of crowd-sourcing is how to elicit expertise from agents. This is even more difficult when answers cannot be directly verified. A key challenge is that sophisticated agents may strategically withhold effort or information when they believe their payoff will be based upon comparison with other agents whose reports will likely omit this information due to lack of effort or expertise. #R##N#Our work defines a natural model for this setting based on the assumption that \emph{more sophisticated agents know the beliefs of less sophisticated agents}. #R##N#We then provide a mechanism design framework for this setting. From this framework, we design several novel mechanisms, for both the single and multiple question settings, that (1) encourage agents to invest effort and provide their information honestly; (2) output a correct "hierarchy" of the information when agents are rational.

Connected through hyperedge HE-1 (induced by source paper "dominantly truthful multi task peer prediction with a constant number of tasks"):
  with members:
    - "water from two rocks maximizing the mutual information"
    - "incentivizing evaluation via limited access to ground truth peer prediction makes things worse"
    - "informed truthfulness in multi task peer prediction"
    - "equilibrium selection in information elicitation without verification via information monotonicity"
    - "an information theoretic framework for designing information elicitation mechanisms that reward truth telling"
    - "truth serums for massively crowdsourced evaluation tasks"
    - "crowdsourced judgement elicitation with endogenous proficiency"

Connected through hyperedge HE-2 (induced by source paper "water from two rocks maximizing the mutual information"):
  with members:
    - "incentivizing evaluation via limited access to ground truth peer prediction makes things worse"
    - "informed truthfulness in multi task peer prediction"
    - "a survey on multi view learning"
    - "crowdsourced judgement elicitation with endogenous proficiency"

Connected through hyperedge HE-3 (induced by source paper "an information theoretic framework for designing information elicitation mechanisms that reward truth telling"):
  with members:
    - "water from two rocks maximizing the mutual information"
    - "peer prediction with heterogeneous tasks"
    - "incentivizing evaluation via limited access to ground truth peer prediction makes things worse"
    - "putting peer prediction under the micro economic scope and making truth telling focal"
    - "informed truthfulness in multi task peer prediction"
    - "equilibrium selection in information elicitation without verification via information monotonicity"
    - "crowdsourced judgement elicitation with endogenous proficiency"
    - "mechanisms for making crowds truthful"

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)