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: "competitive contagion in networks"
  Abstract: We develop a game-theoretic framework for the study of competition between firms who have budgets to "seed" the initial adoption of their products by consumers located in a social network. The payoffs to the firms are the eventual number of adoptions of their product through a competitive stochastic diffusion process in the network. This framework yields a rich class of competitive strategies, which depend in subtle ways on the stochastic dynamics of adoption, the relative budgets of the players, and the underlying structure of the social network. #R##N#We identify a general property of the adoption dynamics --- namely, decreasing returns to local adoption --- for which the inefficiency of resource use at equilibrium (the Price of Anarchy) is uniformly bounded above, across all networks. We also show that if this property is violated the Price of Anarchy can be unbounded, thus yielding sharp threshold behavior for a broad class of dynamics. #R##N#We also introduce a new notion, the Budget Multiplier, that measures the extent that imbalances in player budgets can be amplified at equilibrium. We again identify a general property of the adoption dynamics --- namely, proportional local adoption between competitors --- for which the (pure strategy) Budget Multiplier is uniformly bounded above, across all networks. We show that a violation of this property can lead to unbounded Budget Multiplier, again yielding sharp threshold behavior for a broad class of dynamics.

Connected through hyperedge HE-1 (induced by source paper "approximation algorithms for coordinating ad campaigns on social networks"):
  with members:
    - "optimizing ad allocation in social advertising"
    - "from competition to complementarity comparative influence diffusion and maximization"
    - "influence maximization near optimal time complexity meets practical efficiency"
    - "viral marketing meets social advertising ad allocation with minimum regret"
    - "maximizing social influence in nearly optimal time"
    - "symmetry and approximability of submodular maximization problems"
    - "submodular maximization by simulated annealing"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-2 (induced by source paper "beyond worst case in approximability of nonsubmodular influence maximization"):
  with members:
    - "don t be greedy leveraging community structure to find high quality seed sets for influence maximization"
    - "robust influence maximization"
    - "robust influence maximization"
    - "information contagion an empirical study of the spread of news on digg and twitter social networks"

Connected through hyperedge HE-3 (induced by source paper "competitive contagion with sparse seeding"):
  with members:
    - "competitive diffusion in social networks quality or seeding"
    - "optimal pricing in networks with externalities"

Connected through hyperedge HE-4 (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"
    - "prince privacy preserving mechanisms for influence diffusion in online social networks"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "new models and methods for formation and analysis of social networks"):
  with members:
    - "formation of stable strategic networks with desired topologies"
    - "preference elicitation for general random utility models"
    - "the role of social networks in information diffusion"
    - "incentive compatible influence maximization in social networks and application to viral marketing"
    - "adaptive submodularity theory and applications in active learning and stochastic optimization"

Connected through hyperedge HE-6 (induced by source paper "optimal investment strategies for competing camps in a social network a broad framework"):
  with members:
    - "novel multidimensional models of opinion dynamics in social networks"
    - "opinion dynamics in social networks with hostile camps consensus vs polarization"
    - "opinion maximization in social networks"
    - "opinion dynamics in social networks a local interaction game with stubborn agents"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-7 (induced by source paper "on the dynamics of deterministic epidemic propagation over networks"):
  with members:
    - "second order moment closure for tighter epidemic thresholds"
    - "stability of spreading processes over time varying large scale networks"
    - "sirs epidemics on complex networks concurrence of exact markov chain and approximated models"

Connected through hyperedge HE-8 (induced by source paper "don t be greedy leveraging community structure to find high quality seed sets for influence maximization"):
  with members:
    - "beyond worst case in approximability of nonsubmodular influence maximization"
    - "discovering small target sets in social networks a fast and effective algorithm"
    - "a cost function for similarity based hierarchical clustering"
    - "influence maximization near optimal time complexity meets practical efficiency"
    - "sketch based influence maximization and computation scaling up with guarantees"
    - "maximizing social influence in nearly optimal time"
    - "finding overlapping communities in social networks toward a rigorous approach"
    - "information contagion an empirical study of the spread of news on digg and twitter social 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.GT(Computer Science and Game Theory)