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: "friendship paradox redux your friends are more interesting than you"
  Abstract: Feld's friendship paradox states that "your friends have more friends than you, on average." This paradox arises because extremely popular people, despite being rare, are overrepresented when averaging over friends. Using a sample of the Twitter firehose, we confirm that the friendship paradox holds for >98% of Twitter users. Because of the directed nature of the follower graph on Twitter, we are further able to confirm more detailed forms of the friendship paradox: everyone you follow or who follows you has more friends and followers than you. This is likely caused by a correlation we demonstrate between Twitter activity, number of friends, and number of followers. In addition, we discover two new paradoxes: the virality paradox that states "your friends receive more viral content than you, on average," and the activity paradox, which states "your friends are more active than you, on average." The latter paradox is important in regulating online communication. It may result in users having difficulty maintaining optimal incoming information rates, because following additional users causes the volume of incoming tweets to increase super-linearly. While users may compensate for increased information flow by increasing their own activity, users become information overloaded when they receive more information than they are able or willing to process. We compare the average size of cascades that are sent and received by overloaded and underloaded users. And we show that overloaded users post and receive larger cascades and they are poor detector of small cascades.

Connected through hyperedge HE-1 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference"):
  with members:
    - "what do your friends think efficient polling methods for networks using friendship paradox"
    - "centrality friendship paradoxes when our friends are more important than us"
    - "conjoining uncooperative societies facilitates evolution of cooperation"
    - "contagions in social networks effects of monophilic contagion friendship paradox and reactive networks"
    - "which friends are more popular than you contact strength and the friendship paradox in social networks"
    - "influence maximization over markovian graphs a stochastic optimization approach"
    - "engagement dynamics and sensitivity analysis of youtube videos"
    - "the majority illusion in social networks"

Connected through hyperedge HE-2 (induced by source paper "friendship paradox biases perceptions in directed networks"):
  with members:
    - "what do your friends think efficient polling methods for networks using friendship paradox"
    - "do diffusion protocols govern cascade growth"
    - "centrality friendship paradoxes when our friends are more important than us"
    - "the majority illusion in social networks"
    - "the h index paradox your coauthors have a higher h index than you do"
    - "network weirdness exploring the origins of network paradoxes"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "clustering and community detection in directed networks a survey"

Connected through hyperedge HE-3 (induced by source paper "maximum likelihood estimation of power law degree distributions using friendship paradox based sampling"):
  with members:
    - "information diffusion in social networks friendship paradox based models and statistical inference"
    - "centrality friendship paradoxes when our friends are more important than us"
    - "which friends are more popular than you contact strength and the friendship paradox in social networks"
    - "the majority illusion in social networks"
    - "qualities and inequalities in online social networks through the lens of the generalized friendship paradox"
    - "tracking infection diffusion in social networks filtering algorithms and threshold bounds"
    - "network weirdness exploring the origins of network paradoxes"
    - "using friends as sensors to detect global scale contagious outbreaks"

Connected through hyperedge HE-4 (induced by source paper "what do your friends think efficient polling methods for networks using friendship paradox"):
  with members:
    - "information diffusion in social networks friendship paradox based models and statistical inference"
    - "friendship paradox biases perceptions in directed networks"
    - "centrality friendship paradoxes when our friends are more important than us"
    - "gemsec graph embedding with self clustering"
    - "the majority illusion in social networks"
    - "qualities and inequalities in online social networks through the lens of the generalized friendship paradox"
    - "online reputation and polling systems data incest social learning and revealed preferences"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"

Connected through hyperedge HE-5 (induced by source paper "contagions in social networks effects of monophilic contagion friendship paradox and reactive networks"):
  with members:
    - "what do your friends think efficient polling methods for networks using friendship paradox"
    - "centrality friendship paradoxes when our friends are more important than us"
    - "which friends are more popular than you contact strength and the friendship paradox in social networks"
    - "influence maximization over markovian graphs a stochastic optimization approach"
    - "the happiness paradox your friends are happier than you"
    - "tracking infection diffusion in social networks filtering algorithms and threshold bounds"
    - "scalable methods for adaptively seeding a social network"
    - "using friends as sensors to detect global scale contagious outbreaks"

Connected through hyperedge HE-6 (induced by source paper "centrality friendship paradoxes when our friends are more important than us"):
  with members:
    - "the happiness paradox your friends are happier than you"
    - "network weirdness exploring the origins of network paradoxes"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "total communicability as a centrality measure"
    - "using friends as sensors to detect global scale contagious outbreaks"

Connected through hyperedge HE-7 (induced by source paper "beautiful and damned combined effect of content quality and social ties on user engagement"):
  with members:
    - "to click or not to click automatic selection of beautiful thumbnails from videos"
    - "online actions with offline impact how online social networks influence online and offline user behavior"
    - "the majority illusion in social networks"
    - "photo aesthetics ranking network with attributes and content adaptation"
    - "yfcc100m the new data in multimedia research"
    - "an image is worth more than a thousand favorites surfacing the hidden beauty of flickr pictures"
    - "the beauty of capturing faces rating the quality of digital portraits"
    - "imagenet large scale visual recognition challenge"

Connected through hyperedge HE-8 (induced by source paper "which friends are more popular than you contact strength and the friendship paradox in social networks"):
  with members:
    - "collective attention in the age of mis information"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "using friends as sensors to detect global scale contagious outbreaks"
    - "the anatomy of the facebook social graph"

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)