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 "using network motifs to characterize temporal network evolution leading to diffusion inhibition"):
  Abstract: Network motifs are patterns of over-represented node interactions in a network which have been previously used as building blocks to understand various aspects of the social networks. In this paper, we use motif patterns to characterize the information diffusion process in social networks. We study the lifecycle of information cascades to understand what leads to saturation of growth in terms of cascade reshares, thereby resulting in expiration, an event we call ``diffusion inhibition''. In an attempt to understand what causes inhibition, we use motifs to dissect the network obtained from information cascades coupled with traces of historical diffusion or social network links. Our main results follow from experiments on a dataset of cascades from the Weibo platform and the Flixster movie ratings. We observe the temporal counts of 5-node undirected motifs from the cascade temporal networks leading to the inhibition stage. Empirical evidences from the analysis lead us to conclude the following about stages preceding inhibition: (1) individuals tend to adopt information more from users they have known in the past through social networks or previous interactions thereby creating patterns containing triads more frequently than acyclic patterns with linear chains and (2) users need multiple exposures or rounds of social reinforcement for them to adopt an information and as a result information starts spreading slowly thereby leading to the death of the cascade. Following these observations, we use motif based features to predict the edge cardinality of the network exhibited at the time of inhibition. We test features of motif patterns by using regression models for both individual patterns and their combination and we find that motifs as features are better predictors of the future network organization than individual node centralities.

Includes members:
  Member "expecting to be hip hawkes intensity processes for social media popularity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nestpp modeling thread dynamics in online discussion forums")
  Member "understanding and forecasting lifecycle events in information cascades":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "leveraging motifs to model the temporal dynamics of diffusion networks")
  Member "higher order organization of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "do cascades recur":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "estimating attention flow in online video networks")
  Member "toward early and order of magnitude cascade prediction in social networks":
    also connected through other hyperedges:
      (none)
  Member "coevolve a joint point process model for information diffusion and network co evolution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "predicting dynamic embedding trajectory in temporal interaction networks")
  Member "seismic a self exciting point process model for predicting tweet popularity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inf vae a variational autoencoder framework to integrate homophily and influence in diffusion prediction")
  Member "can cascades be predicted":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep collaborative embedding for information cascade prediction")

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)