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: "which friends are more popular than you contact strength and the friendship paradox in social networks"
  Abstract: The friendship paradox states that in a social network, egos tend to have lower degree than their alters, or, "your friends have more friends than you do". Most research has focused on the friendship paradox and its implications for information transmission, but treating the network as static and unweighted. Yet, people can dedicate only a finite fraction of their attention budget to each social interaction: a high-degree individual may have less time to dedicate to individual social links, forcing them to modulate the quantities of contact made to their different social ties. Here we study the friendship paradox in the context of differing contact volumes between egos and alters, finding a connection between contact volume and the strength of the friendship paradox. The most frequently contacted alters exhibit a less pronounced friendship paradox compared with the ego, whereas less-frequently contacted alters are more likely to be high degree and give rise to the paradox. We argue therefore for a more nuanced version of the friendship paradox: "your closest friends have slightly more friends than you do", and in certain networks even: "your best friend has no more friends than you do". We demonstrate that this relationship is robust, holding in both a social media and a mobile phone dataset. These results have implications for information transfer and influence in social networks, which we explore using a simple dynamical model.

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"
    - "influence maximization over markovian graphs a stochastic optimization approach"
    - "engagement dynamics and sensitivity analysis of youtube videos"
    - "the majority illusion in social networks"
    - "the happiness paradox your friends are happier than you"

Connected through hyperedge HE-2 (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"
    - "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"
    - "friendship paradox redux your friends are more interesting than you"
    - "using friends as sensors to detect global scale contagious outbreaks"

Connected through hyperedge HE-3 (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"
    - "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"
    - "friendship paradox redux your friends are more interesting than you"
    - "using friends as sensors to detect global scale contagious outbreaks"

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)