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 "outlier edge detection using random graph generation models and applications"):
  Abstract: Outliers are samples that are generated by different mechanisms from other normal data samples. Graphs, in particular social network graphs, may contain nodes and edges that are made by scammers, malicious programs or mistakenly by normal users. Detecting outlier nodes and edges is important for data mining and graph analytics. However, previous research in the field has merely focused on detecting outlier nodes. In this article, we study the properties of edges and propose outlier edge detection algorithms using two random graph generation models. We found that the edge-ego-network, which can be defined as the induced graph that contains two end nodes of an edge, their neighboring nodes and the edges that link these nodes, contains critical information to detect outlier edges. We evaluated the proposed algorithms by injecting outlier edges into some real-world graph data. Experiment results show that the proposed algorithms can effectively detect outlier edges. In particular, the algorithm based on the Preferential Attachment Random Graph Generation model consistently gives good performance regardless of the test graph data. Further more, the proposed algorithms are not limited in the area of outlier edge detection. We demonstrate three different applications that benefit from the proposed algorithms: 1) a preprocessing tool that improves the performance of graph clustering algorithms; 2) an outlier node detection algorithm; and 3) a novel noisy data clustering algorithm. These applications show the great potential of the proposed outlier edge detection techniques.

Includes members:
  Member "limited random walk algorithm for big graph data clustering":
    also connected through other hyperedges:
      (none)
  Member "a survey on social media anomaly detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic iterative hard thresholding for graph structured sparsity optimization")
  Member "graph based anomaly detection and description a survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "graph degree linkage agglomerative clustering on a directed graph":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "clustering by directly disentangling latent space")
  Member "clustering with multi layer graphs a spectral perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "community detection on mixture multi layer networks via regularized tensor decomposition")
  Member "demon a local first discovery method for overlapping communities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "self falsifiable hierarchical detection of overlapping communities on social networks")
  Member "defining and evaluating network communities based on ground truth":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "certified robustness of community detection against adversarial structural perturbation via randomized smoothing")
  Member "a classification for community discovery methods in complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey of community search over big graphs")

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)