human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "randomized experiments to detect and estimate social influence in networks"):
  Abstract: Estimation of social influence in networks can be substantially biased in observational studies due to homophily and network correlation in exposure to exogenous events. Randomized experiments, in which the researcher intervenes in the social system and uses randomization to determine how to do so, provide a methodology for credibly estimating of causal effects of social behaviors. In addition to addressing questions central to the social sciences, these estimates can form the basis for effective marketing and public policy. In this review, we discuss the design space of experiments to measure social influence through combinations of interventions and randomizations. We define an experiment as combination of (1) a target population of individuals connected by an observed interaction network, (2) a set of treatments whereby the researcher will intervene in the social system, (3) a randomization strategy which maps individuals or edges to treatments, and (4) a measurement of an outcome of interest after treatment has been assigned. We review experiments that demonstrate potential experimental designs and we evaluate their advantages and tradeoffs for answering different types of causal questions about social influence. We show how randomization also provides a basis for statistical inference when analyzing these experiments.

Includes members:
  Member "discussion quality diffuses in the digital public square":
    also connected through other hyperedges:
      (none)
  Member "designing and deploying online field experiments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "inferring individual level causal models from graph based relational time series")
  Member "graph cluster randomization network exposure to multiple universes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "inferring individual level causal models from graph based relational time series")
  Member "selection effects in online sharing consequences for peer adoption":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "studying and modeling the connection between people s preferences and content sharing")
  Member "the role of social networks in information diffusion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep learning approach on information diffusion in heterogeneous networks")
  Member "social influence in social advertising evidence from field experiments":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "locec local community based edge classification in large online social networks")
  Member "cooperation and contagion in web based networked public goods experiments":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computational human dynamics")
  Member "supervised random walks predicting and recommending links in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "few shot learning on graphs via super classes based on graph spectral measures")

Question: Please tell me which class the source paper 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)