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: "mechanism design for time critical and cost critical task execution via crowdsourcing"
  Abstract: An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents within a network in order to seek their help in executing an {\em atomic task} as well as in recruiting other agents to execute the task. We study this mechanism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner's goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We identify a set of desirable properties that should ideally be satisfied by a crowdsourcing mechanism. In particular, {\em sybil-proofness} and {\em collapse-proofness} are two complementary properties in our desiderata. We prove that no mechanism can satisfy all the desirable properties simultaneously. This leads us naturally to explore approximate versions of the critical properties. We focus our attention on approximate sybil-proofness and our exploration leads to a parametrized family of payment mechanisms which satisfy collapse-proofness. We characterize the approximate versions of the desirable properties in cost critical and time critical domain.

Connected through hyperedge HE-1 (induced by source paper "certified computation in crowdsourcing"):
  with members:
    - "being robust in high dimensions can be practical"
    - "learning from untrusted data"
    - "avoiding imposters and delinquents adversarial crowdsourcing and peer prediction"
    - "feature multi selection among subjective features"
    - "crowdsourced judgement elicitation with endogenous proficiency"
    - "optimal crowdsourcing contests"
    - "the labor economics of paid crowdsourcing"

Connected through hyperedge HE-2 (induced by source paper "it s about time online macrotask sequencing in expert crowdsourcing"):
  with members:
    - "online assignment of heterogeneous tasks in crowdsourcing markets"
    - "engineering crowdsourced stream processing systems"
    - "analytic methods for optimizing realtime crowdsourcing"
    - "the labor economics of paid crowdsourcing"

Connected through hyperedge HE-3 (induced by source paper "referral embedded provision point mechanisms for crowdfunding of public projects"):
  with members:
    - "time critical social mobilization"
    - "pricing strategies for viral marketing on social networks"

Connected through hyperedge HE-4 (induced by source paper "incentive mechanisms for participatory sensing survey and research challenges"):
  with members:
    - "providing long term participation incentive in participatory sensing"
    - "sacrm social aware crowdsourcing with reputation management in mobile sensing"
    - "optimal prizes for all pay contests in heterogeneous crowdsourcing"
    - "the importance of being earnest in crowdsourcing systems"
    - "motivating smartphone collaboration in data acquisition and distributed computing"
    - "mining users significant driving routes with low power sensors"
    - "fairness and social welfare in incentivizing participatory sensing"
    - "truthful scheduling mechanisms for powering mobile crowdsensing"

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)