human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "keyword aware influential community search in large attributed graphs"):
  Abstract: We introduce a novel keyword-aware influential community query KICQ that finds the most influential communities from an attributed graph, where an influential community is defined as a closely connected group of vertices having some dominance over other groups of vertices with the expertise (a set of keywords) matching with the query terms (words or phrases). We first design the KICQ that facilitates users to issue an influential CS query intuitively by using a set of query terms, and predicates (AND or OR). In this context, we propose a novel word-embedding based similarity model that enables semantic community search, which substantially alleviates the limitations of exact keyword based community search. Next, we propose a new influence measure for a community that considers both the cohesiveness and influence of the community and eliminates the need for specifying values of internal parameters of a network. Finally, we propose two efficient algorithms for searching influential communities in large attributed graphs. We present detailed experiments and a case study to demonstrate the effectiveness and efficiency of the proposed approaches.

Includes members:
  Member "exploring communities in large profiled graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of community search over big graphs")
  Member "a survey of community search over big graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "an optimal and progressive approach to online search of top k influential communities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of community search over big graphs")
  Member "efficient estimation of word representations in vector space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on contextual embeddings")
  Member "distributed representations of words and phrases and their compositionality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "truss decomposition in massive networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient bitruss decomposition for large scale bipartite graphs")
  Member "efficient community detection in large networks using content and links":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "social science guided feature engineering a novel approach to signed link analysis")
  Member "an o m algorithm for cores decomposition of networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fastgae fast scalable and effective graph autoencoders with stochastic subgraph decoding")

Question: Please tell me which class the source paper 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)