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 "deep hashing for signed social network embedding"):
  Abstract: Network embedding is a promising way of network representation, facilitating many signed social network processing and analysis tasks such as link prediction and node classification. Recently, feature hashing has been adopted in several existing embedding algorithms to improve the efficiency, which has obtained a great success. However, the existing feature hashing based embedding algorithms only consider the positive links in signed social networks. Intuitively, negative links can also help improve the performance. Thus, in this paper, we propose a novel deep hashing method for signed social network embedding by considering simultaneously positive and negative links. Extensive experiments show that the proposed method performs better than several state-of-the-art baselines through link prediction task over two real-world signed social networks.

Includes members:
  Member "representation learning on graphs methods and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to segment 3d point clouds in 2d image space")
  Member "sne signed network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable graph embeddings via sparse transpose proximities")
  Member "deep supervised hashing with triplet labels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on deep hashing methods")
  Member "node2vec scalable feature learning for networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep graph matching consensus")
  Member "deep semantic ranking based hashing for multi label image retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on deep hashing methods")
  Member "cyclical learning rates for training neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "feature learning based deep supervised hashing with pairwise labels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on deep hashing methods")
  Member "line large scale information network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")

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)