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: "time critical social mobilization"
  Abstract: The World Wide Web is commonly seen as a platform that can harness the collective abilities of large numbers of people to accomplish tasks with unprecedented speed, accuracy, and scale. To explore the Web’s ability for social mobilization, the Defense Advanced Research Projects Agency (DARPA) held the DARPA Network Challenge, in which competing teams were asked to locate 10 red weather balloons placed at locations around the continental United States. Using a recursive incentive mechanism that both spread information about the task and incentivized individuals to act, our team was able to find all 10 balloons in less than 9 hours, thus winning the Challenge. We analyzed the theoretical and practical properties of this mechanism and compared it with other approaches.

Connected through hyperedge HE-1 (induced by source paper "collaborative data acquisition"):
  with members:
    - "selling multiple items via social networks"
    - "multi winner contests for strategic diffusion in social networks"
    - "mechanism design in social networks"
    - "regularized minimax conditional entropy for crowdsourcing"
    - "optimal crowdsourcing contests"

Connected through hyperedge HE-2 (induced by source paper "maximal information propagation with budgets"):
  with members:
    - "selling multiple items via social networks"
    - "multi winner contests for strategic diffusion in social networks"
    - "mechanism design in social networks"

Connected through hyperedge HE-3 (induced by source paper "selling multiple items via social networks"):
  with members:
    - "customer sharing in economic networks with costs"
    - "mechanism design in social networks"

Connected through hyperedge HE-4 (induced by source paper "fixed price diffusion mechanism design"):
  with members:
    - "selling multiple items via social networks"
    - "mechanism design in social networks"

Connected through hyperedge HE-5 (induced by source paper "crowdsourcing data acquisition via social networks"):
  with members:
    - "regularized minimax conditional entropy for crowdsourcing"
    - "optimal crowdsourcing contests"

Connected through hyperedge HE-6 (induced by source paper "recruiting hay to find needles recursive incentives and innovation in social networks"):
  with members:
    - "recommending targeted strangers from whom to solicit information on social media"

Connected through hyperedge HE-7 (induced by source paper "multi winner contests for strategic diffusion in social networks"):
  with members:
    - "selling multiple items via social networks"
    - "information design in crowdfunding under thresholding policies"
    - "an online mechanism for ridesharing in autonomous mobility on demand systems"
    - "the rise of social bots"
    - "the simple rules of social contagion"
    - "social dynamics of digg"
    - "a data based approach to social influence maximization"

Connected through hyperedge HE-8 (induced by source paper "quantifying surveillance in the networked age node based intrusions and group privacy"):
  with members:
    - "measuring large scale social networks with high resolution"
    - "the anatomy of the facebook social graph"
    - "four degrees of separation"

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.CY(Computers and Society)