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: "network weirdness exploring the origins of network paradoxes"
  Abstract: Social networks have many counter-intuitive properties, including the "friendship paradox" that states, on average, your friends have more friends than you do. Recently, a variety of other paradoxes were demonstrated in online social networks. This paper explores the origins of these network paradoxes. Specifically, we ask whether they arise from mathematical properties of the networks or whether they have a behavioral origin. We show that sampling from heavy-tailed distributions always gives rise to a paradox in the mean, but not the median. We propose a strong form of network paradoxes, based on utilizing the median, and validate it empirically using data from two online social networks. Specifically, we show that for any user the majority of user's friends and followers have more friends, followers, etc. than the user, and that this cannot be explained by statistical properties of sampling. Next, we explore the behavioral origins of the paradoxes by using the shuffle test to remove correlations between node degrees and attributes. We find that paradoxes for the mean persist in the shuffled network, but not for the median. We demonstrate that strong paradoxes arise due to the assortativity of user attributes, including degree, and correlation between degree and attribute.

Connected through hyperedge HE-1 (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"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "clustering and community detection in directed networks a survey"
    - "friendship paradox redux your friends are more interesting 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"
    - "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"
    - "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 "centrality friendship paradoxes when our friends are more important than us"):
  with members:
    - "the happiness paradox your friends are happier than you"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "friendship paradox redux your friends are more interesting than you"
    - "total communicability as a centrality measure"
    - "using friends as sensors to detect global scale contagious outbreaks"

Connected through hyperedge HE-4 (induced by source paper "information is not a virus and other consequences of human cognitive limits"):
  with members:
    - "the majority illusion in social networks"
    - "user effort and network structure mediate access to information in networks"
    - "the simple rules of social contagion"
    - "portrait of an online shopper understanding and predicting consumer behavior"
    - "friendship paradox redux your friends are more interesting than you"
    - "stochastic models predict user behavior in social media"
    - "information diffusion and external influence in networks"
    - "social dynamics of digg"

Connected through hyperedge HE-5 (induced by source paper "neighbor neighbor correlations explain measurement bias in networks"):
  with members:
    - "the majority illusion in social networks"
    - "identification of core periphery structure in networks"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "friendship paradox redux your friends are more interesting than you"
    - "virality prediction and community structure in social networks"
    - "core periphery structure in networks"
    - "systematic topology analysis and generation using degree correlations"

Connected through hyperedge HE-6 (induced by source paper "the majority illusion in social networks"):
  with members:
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "structural properties of ego networks"
    - "friendship paradox redux your friends are more interesting than you"
    - "using friends as sensors to detect global scale contagious outbreaks"
    - "social dynamics of digg"

Connected through hyperedge HE-7 (induced by source paper "qualities and inequalities in online social networks through the lens of the generalized friendship paradox"):
  with members:
    - "measuring the generalized friendship paradox in networks with quality dependent connectivity"
    - "generalized friendship paradox in complex networks the case of scientific collaboration"
    - "friendship paradox redux your friends are more interesting than you"
    - "using friends as sensors to detect global scale contagious outbreaks"
    - "the anatomy of the facebook social graph"

Connected through hyperedge HE-8 (induced by source paper "assembling thefacebook using heterogeneity to understand online social network assembly"):
  with members:
    - "social resilience in online communities the autopsy of friendster"
    - "potential networks contagious communities and understanding social network structure"
    - "friendship networks and social status"
    - "social structure of facebook networks"
    - "the anatomy of the facebook social graph"
    - "four degrees of separation"

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)