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 "unsupervised euclidean distance attack on network embedding"):
  Abstract: Considering the wide application of network embedding methods in graph data mining, inspired by the adversarial attack in deep learning, this paper proposes a Genetic Algorithm (GA) based Euclidean Distance Attack strategy (EDA) to attack the network embedding, so as to prevent certain structural information from being discovered. EDA focuses on disturbing the Euclidean distance between a pair of nodes in the embedding space as much as possible through minimal modifications of the network structure. Since a large number of downstream network algorithms, such as community detection and node classification, rely on the Euclidean distance between nodes to evaluate the similarity between them in the embedding space, EDA can be considered as a universal attack on a variety of network algorithms. Different from traditional supervised attack strategies, EDA does not need labeling information, and, in other words, is an unsupervised network embedding attack method.

Includes members:
  Member "network embedding as matrix factorization unifying deepwalk line pte and node2vec":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "ga based q attack on community detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "attack graph convolutional networks by adding fake nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of adversarial learning on graphs")
  Member "data poisoning attack against unsupervised node embedding methods":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "humpty dumpty controlling word meanings via corpus poisoning")
  Member "target defense against link prediction based attacks via evolutionary perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mga momentum gradient attack on network")
  Member "hiding individuals and communities in a social network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "synthesizing robust adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial ranking attack and defense")
  Member "node2vec scalable feature learning for networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep graph matching consensus")

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)