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 "a statistical density based analysis of graph clustering algorithm performance"):
  Abstract: Measuring graph clustering quality remains an open problem. To address it, we introduce quality measures based on comparisons of intra- and inter-cluster densities, an accompanying statistical test of the significance of their differences and a step-by-step routine for clustering quality assessment. Our null hypothesis does not rely on any generative model for the graph, unlike modularity which uses the configuration model as a null model. Our measures are shown to meet the axioms of a good clustering quality function, unlike the very commonly used modularity measure. They also have an intuitive graph-theoretic interpretation, a formal statistical interpretation and can be easily tested for significance. Our work is centered on the idea that well clustered graphs will display a significantly larger intra-cluster density than inter-cluster density. We develop tests to validate the existence of such a cluster structure. We empirically explore the behavior of our measures under a number of stress test scenarios and compare their behavior to the commonly used modularity and conductance measures. Empirical stress test results confirm that our measures compare very favorably to the established ones. In particular, they are shown to be more responsive to graph structure and less sensitive to sample size and breakdowns during numerical implementation and less sensitive to uncertainty in connectivity. These features are especially important in the context of larger data sets or when the data may contain errors in the connectivity patterns.

Includes members:
  Member "using synthetic networks for parameter tuning in community detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph clustering via qubo and digital annealing")
  Member "size matters a comparative analysis of community detection algorithms":
    also connected through other hyperedges:
      (none)
  Member "graph sketching based massive data clustering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graph based clustering under differential privacy")
  Member "on the evaluation potential of quality functions in community detection for different contexts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "community discovery in dynamic networks a survey")
  Member "analysis of network clustering algorithms and cluster quality metrics at scale":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "artificial benchmark for community detection abcd fast random graph model with community structure")
  Member "extension of modularity density for overlapping community structure":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "community detection algorithm evaluation with ground truth data")
  Member "axioms for graph clustering quality functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graph clustering via qubo and digital annealing")
  Member "defining and evaluating network communities based on ground truth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "certified robustness of community detection against adversarial structural perturbation via randomized smoothing")

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)