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: "prince privacy preserving mechanisms for influence diffusion in online social networks"
  Abstract: This paper has been withdrawn by the author due to a crucial sign error in equation 1. With the advance of online social networks, there has been extensive research on how to spread influence in online social networks, and many algorithms and models have been proposed. However, many fundamental problems have also been overlooked. Among those, the most important problems are the incentive aspect and the privacy aspect (eg, nodes' relationships) of the influence propagation in online social networks. Bearing these defects in mind, and incorporating the powerful tool from differential privacy, we propose PRINCE, which is a series of \underline{PR}ivacy preserving mechanisms for \underline{IN}fluen\underline{CE} diffusion in online social networks to solve the problems. We not only theoretically prove many elegant properties of PRINCE, but also implement PRINCE to evaluate its performance extensively. The evaluation results show that PRINCE achieves good performances. To the best of our knowledge, PRINCE is the first differentially private mechanism for influence diffusion in online social networks.

Connected through hyperedge HE-1 (induced by source paper "preserving privacy enables coexistence equilibrium of competitive diffusion in social networks"):
  with members:
    - "make up your mind the price of online queries in differential privacy"
    - "the value of privacy strategic data subjects incentive mechanisms and fundamental limits"
    - "competitive diffusion in social networks quality or seeding"
    - "virality prediction and community structure in social networks"
    - "evolution of social attribute networks measurements modeling and implications using google"
    - "diffusion in social networks with competing products"
    - "competitive contagion in networks"

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.SI(Social and Information Networks)