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: "efficient community detection in large networks using content and links"
  Abstract: In this paper we discuss a very simple approach of combining content and link information in graph structures for the purpose of community discovery, a fundamental task in network analysis. Our approach hinges on the basic intuition that many networks contain noise in the link structure and that content information can help strengthen the community signal. This enables ones to eliminate the impact of noise (false positives and false negatives), which is particularly prevalent in online social networks and Web-scale information networks. #R##N#Specifically we introduce a measure of signal strength between two nodes in the network by fusing their link strength with content similarity. Link strength is estimated based on whether the link is likely (with high probability) to reside within a community. Content similarity is estimated through cosine similarity or Jaccard coefficient. We discuss a simple mechanism for fusing content and link similarity. We then present a biased edge sampling procedure which retains edges that are locally relevant for each graph node. The resulting backbone graph can be clustered using standard community discovery algorithms such as Metis and Markov clustering. #R##N#Through extensive experiments on multiple real-world datasets (Flickr, Wikipedia and CiteSeer) with varying sizes and characteristics, we demonstrate the effectiveness and efficiency of our methods over state-of-the-art learning and mining approaches several of which also attempt to combine link and content analysis for the purposes of community discovery. Specifically we always find a qualitative benefit when combining content with link analysis. Additionally our biased graph sampling approach realizes a quantitative benefit in that it is typically several orders of magnitude faster than competing approaches.

Connected through hyperedge HE-1 (induced by source paper "social science guided feature engineering a novel approach to signed link analysis"):
  with members:
    - "less is more semi supervised causal inference for detecting pathogenic users in social media"
    - "hawkes process for understanding the influence of pathogenic social media accounts"
    - "signed link prediction with sparse data the role of personality information"
    - "privacy in social media identification mitigation and applications"
    - "protecting user privacy an approach for untraceable web browsing history and unambiguous user profiles"
    - "early identification of pathogenic social media accounts"
    - "signed network modeling based on structural balance theory"
    - "semi supervised learning for detecting human trafficking"

Connected through hyperedge HE-2 (induced by source paper "a block based generative model for attributed networks embedding"):
  with members:
    - "adversarially regularized graph autoencoder for graph embedding"
    - "attributed social network embedding"
    - "node2vec scalable feature learning for networks"
    - "semi supervised classification with graph convolutional networks"
    - "stochastic block model and exploratory analysis in signed networks"
    - "deepwalk online learning of social representations"

Connected through hyperedge HE-3 (induced by source paper "a survey of community search over big graphs"):
  with members:
    - "exploring communities in large profiled graphs"
    - "efficient algorithms for densest subgraph discovery"
    - "community discovery in dynamic networks a survey"
    - "pp dblp modeling and generating attributed public private networks with dblp"
    - "an optimal and progressive approach to online search of top k influential communities"
    - "local community detection in dynamic networks"
    - "diversified coherent core search on multi layer graphs"
    - "network community detection a review and visual survey"

Connected through hyperedge HE-4 (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-5 (induced by source paper "relation learning on social networks with multi modal graph edge variational autoencoders"):
  with members:
    - "i know you ll be back interpretable new user clustering and churn prediction on a mobile social application"
    - "similarity modeling on heterogeneous networks via automatic path discovery"
    - "neural embedding propagation on heterogeneous networks"
    - "cubenet multi facet hierarchical heterogeneous network construction analysis and mining"
    - "representation learning on graphs with jumping knowledge networks"
    - "fastgcn fast learning with graph convolutional networks via importance sampling"
    - "relationship profiling over social networks reverse smoothness from similarity to closeness"
    - "metapad meta pattern discovery from massive text corpora"

Connected through hyperedge HE-6 (induced by source paper "communitygan community detection with generative adversarial nets"):
  with members:
    - "adversarial network embedding"
    - "seqgan sequence generative adversarial nets with policy gradient"
    - "node2vec scalable feature learning for networks"
    - "semi supervised classification with graph convolutional networks"
    - "gradient estimation using stochastic computation graphs"
    - "line large scale information network embedding"
    - "deepwalk online learning of social representations"
    - "using triangles to improve community detection in directed networks"

Connected through hyperedge HE-7 (induced by source paper "detection of community structures in networks with nodal features based on generative probabilistic approach"):
  with members:
    - "iedc an integrated approach for overlapping and non overlapping community detection"
    - "the ground truth about metadata and community detection in networks"
    - "structure and inference in annotated networks"
    - "overlapping community detection using neighborhood inflated seed expansion"
    - "general optimization technique for high quality community detection in complex networks"
    - "community detection in networks with node attributes"
    - "mining attribute structure correlated patterns in large attributed graphs"
    - "relation strength aware clustering of heterogeneous information networks with incomplete attributes"

Connected through hyperedge HE-8 (induced by source paper "community detection in multiplex networks"):
  with members:
    - "overlapping community detection by local decentralised vertex centred process"
    - "node centric community detection in multilayer networks with layer coverage diversification bias"
    - "mapping higher order network flows in memory and multilayer networks with infomap"
    - "clustering attributed graphs models measures and methods"
    - "community detection in multiplex networks using locally adaptive random walks"
    - "a local perspective on community structure in multilayer networks"
    - "clustering on multi layer graphs via subspace analysis on grassmann manifolds"
    - "mining attribute structure correlated patterns in large attributed graphs"

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)