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 "search efficient binary network embedding"):
  Abstract: Traditional network embedding primarily focuses on learning a dense vector representation for each node, which encodes network structure and/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned dense vector representations are inefficient for large-scale similarity search, which requires to find the nearest neighbor measured by Euclidean distance in a continuous vector space. In this paper, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a sparse binary code for each node, by simultaneously modeling node context relations and node attribute relations through a three-layer neural network. BinaryNE learns binary node representations efficiently through a stochastic gradient descent based online learning algorithm. The learned binary encoding not only reduces memory usage to represent each node, but also allows fast bit-wise comparisons to support much quicker network node search compared to Euclidean distance or other distance measures. Our experiments and comparisons show that BinaryNE not only delivers more than 23 times faster search speed, but also provides comparable or better search quality than traditional continuous vector based network embedding methods.

Includes members:
  Member "bernoulli embeddings for graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "understanding and predicting links in graphs a persistent homology perspective")
  Member "sine scalable incomplete network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an api oriented open source python framework for unsupervised learning on graphs")
  Member "network representation learning a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exem expert embedding using dominating set theory with deep learning approaches")
  Member "hashnet deep learning to hash by continuation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on deep hashing methods")
  Member "deepwalk online learning of social representations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "memory based graph networks")
  Member "efficient estimation of word representations in vector space":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on contextual embeddings")
  Member "axiomatic ranking of network role similarity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "realtime index free single source simrank processing on web scale 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)