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 "adversarial attack on community detection by hiding individuals"):
  Abstract: It has been demonstrated that adversarial graphs, i.e., graphs with imperceptible perturbations added, can cause deep graph models to fail on node/graph classification tasks. In this paper, we extend adversarial graphs to the problem of community detection which is much more difficult. We focus on black-box attack and aim to hide targeted individuals from the detection of deep graph community detection models, which has many applications in real-world scenarios, for example, protecting personal privacy in social networks and understanding camouflage patterns in transaction networks. We propose an iterative learning framework that takes turns to update two modules: one working as the constrained graph generator and the other as the surrogate community detection model. We also find that the adversarial graphs generated by our method can be transferred to other learning based community detection models.

Includes members:
  Member "gap generalizable approximate graph partitioning framework":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mincut pooling in graph neural networks")
  Member "semi supervised graph classification a hierarchical graph perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness verification for transformers")
  Member "a comprehensive survey on graph neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "adversarial attack on graph structured data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "predict then propagate graph neural networks meet personalized pagerank":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bridging the gap between spatial and spectral domains a survey on graph neural networks")
  Member "constrained graph variational autoencoders for molecule design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hierarchical generation of molecular graphs using structural motifs")
  Member "ga based q attack on community detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "normalized cut loss for weakly supervised cnn segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "weakly supervised salient object detection via scribble annotations")

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)