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: "towards linear time overlapping community detection in social networks"
  Abstract: Membership diversity is a characteristic aspect of social networks in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a fast algorithm1, called SLPA, for overlapping community detection in large-scale networks. SLPA spreads labels according to dynamic interaction rules. It can be applied to both unipartite and bipartite networks. It is also able to uncover overlapping nested hierarchy. The time complexity of SLPA scales linearly with the number of edges in the network. Experiments in both synthetic and real- world networks show that SLPA has an excellent performance in identifying both node and community level overlapping structures.

Connected through hyperedge HE-1 (induced by source paper "community detection in node attributed social networks a survey"):
  with members:
    - "attributed graph clustering a deep attentional embedding approach"
    - "non linear attributed graph clustering by symmetric nmf with pu learning"
    - "efficiently clustering very large attributed graphs"
    - "a survey on network embedding"
    - "heterogeneous information network embedding for meta path based proximity"
    - "a comprehensive survey of graph embedding problems techniques and applications"
    - "mining application aware community organization with expanded feature subspaces from concerned attributes in social networks"
    - "node2vec scalable feature learning for networks"

Connected through hyperedge HE-2 (induced by source paper "community structure a comparative evaluation of community detection methods"):
  with members:
    - "an empirical characterization of community structures in complex networks using a bivariate map of quality metrics"
    - "efficient method for estimating the number of communities in a network"
    - "the many facets of community detection in complex networks"
    - "the ground truth about metadata and community detection in networks"
    - "z score based modularity for community detection in networks"
    - "metrics for community analysis a survey"
    - "mixing local and global information for community detection in large networks"
    - "comparative evaluation of community detection algorithms a topological approach"

Connected through hyperedge HE-3 (induced by source paper "ensemble based overlapping community detection using disjoint community structures"):
  with members:
    - "dyperm maximizing permanence for dynamic community detection"
    - "iedc an integrated approach for overlapping and non overlapping community detection"
    - "ensemble based algorithms to detect disjoint and overlapping communities in networks"
    - "metrics for community analysis a survey"
    - "think locally act locally detection of small medium sized and large communities in large networks"
    - "on the formation of circles in co authorship networks"
    - "leveraging disjoint communities for detecting overlapping community structure"
    - "overlapping community detection in networks the state of the art and comparative study"

Connected through hyperedge HE-4 (induced by source paper "an enhanced multi objective biogeography based optimization algorithm for automatic detection of overlapping communities in a social network with node attributes"):
  with members:
    - "evaluating the effect of topic consideration in identifying communities of rating based social networks"
    - "partitioning networks with node attributes by compressing information flow"
    - "structure and overlaps of communities in networks"
    - "slpa uncovering overlapping communities in social networks via a speaker listener interaction dynamic process"
    - "empirical comparison of algorithms for network community detection"
    - "detect overlapping and hierarchical community structure in networks"

Connected through hyperedge HE-5 (induced by source paper "on efficiently detecting overlapping communities over distributed dynamic graphs"):
  with members:
    - "labelrankt incremental community detection in dynamic networks via label propagation"
    - "finding connected components on map reduce in logarithmic rounds"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"

Connected through hyperedge HE-6 (induced by source paper "ensemble based discovery of disjoint overlapping and fuzzy community structures in networks"):
  with members:
    - "ensemble based algorithms to detect disjoint and overlapping communities in networks"
    - "permanence and community structure in complex networks"
    - "metrics for community analysis a survey"
    - "think locally act locally detection of small medium sized and large communities in large networks"
    - "personalized pagerank solution paths"
    - "leveraging disjoint communities for detecting overlapping community structure"
    - "yasca a collective intelligence approach for community detection in complex networks"
    - "overlapping community detection in networks the state of the art and comparative study"

Connected through hyperedge HE-7 (induced by source paper "label propagation for clustering"):
  with members:
    - "corrected overlap weight and clustering coefficient"
    - "the many facets of community detection in complex networks"
    - "clustering scientific publications based on citation relations a systematic comparison of different methods"
    - "identifying robust communities and multi community nodes by combining top down and bottom up approaches to clustering"
    - "on the relationship between gaussian stochastic blockmodels and label propagation algorithms"
    - "group detection in complex networks an algorithm and comparison of the state of the art"
    - "labelrank a stabilized label propagation algorithm for community detection in networks"
    - "demon a local first discovery method for overlapping communities"

Connected through hyperedge HE-8 (induced by source paper "iedc an integrated approach for overlapping and non overlapping community detection"):
  with members:
    - "memory enriched big bang big crunch optimization algorithm for data clustering"
    - "relevant based structure learning for feature selection"
    - "uncovering the small community structure in large networks a local spectral approach"
    - "overlapping community detection using neighborhood inflated seed expansion"
    - "general optimization technique for high quality community detection in complex networks"
    - "overlapping community detection in networks the state of the art and comparative study"
    - "social structure of facebook networks"
    - "defining and evaluating network communities based on ground truth"

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)