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: "integrated structure investigation in complex networks by label propagation"
  Abstract: The investigation of network structure has important significance to understand the functions of various complex networks. The communities with hierarchical and overlapping structures and the special nodes like hubs and outliers are all common structure features to the networks. Network structure investigation has attracted considerable research effort recently. However, existing studies have only partially explored the structure features. In this paper, a label propagation based integrated network structure investigation algorithm (LINSIA) is proposed. The main novelty here is that LINSIA can uncover hierarchical and overlapping communities, as well as hubs and outliers. Moreover, LINSIA can provide insight into the label propagation mechanism and propose a parameter-free solution that requires no prior knowledge. In addition, LINSIA can give out a soft-partitioning result and depict the degree of overlapping nodes belonging to each relevant community. The proposed algorithm is validated on various synthetic and real-world networks. Experimental results demonstrate that the algorithm outperforms several state-of-the-art methods.

Connected through hyperedge HE-1 (induced by source paper "overlapping community detection using superior seed set selection in social networks"):
  with members:
    - "overlapping community detection using neighborhood inflated seed expansion"
    - "overlapping community detection in networks the state of the art and comparative study"

Connected through hyperedge HE-2 (induced by source paper "predicting the evolution of complex networks via similarity dynamics"):
  with members:
    - "full scale cascade dynamics prediction with a local first approach"
    - "the lifecycle and cascade of wechat social messaging groups"
    - "ultra accurate collaborative information filtering via directed user similarity"
    - "can cascades be predicted"
    - "the rich club phenomenon in the internet topology"

Connected through hyperedge HE-3 (induced by source paper "full scale cascade dynamics prediction with a local first approach"):
  with members:
    - "from micro to macro uncovering and predicting information cascading process with behavioral dynamics"
    - "predicting successful memes using network and community structure"
    - "virality prediction and community structure in social networks"
    - "uncovering the temporal dynamics of diffusion networks"

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)