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 "directional statistics based deep metric learning for image classification and retrieval"):
  Abstract: Deep distance metric learning (DDML), which is proposed to learn image similarity metrics in an end-to-end manner based on the convolution neural network, has achieved encouraging results in many computer vision tasks.$L2$-normalization in the embedding space has been used to improve the performance of several DDML methods. However, the commonly used Euclidean distance is no longer an accurate metric for $L2$-normalized embedding space, i.e., a hyper-sphere. Another challenge of current DDML methods is that their loss functions are usually based on rigid data formats, such as the triplet tuple. Thus, an extra process is needed to prepare data in specific formats. In addition, their losses are obtained from a limited number of samples, which leads to a lack of the global view of the embedding space. In this paper, we replace the Euclidean distance with the cosine similarity to better utilize the $L2$-normalization, which is able to attenuate the curse of dimensionality. More specifically, a novel loss function based on the von Mises-Fisher distribution is proposed to learn a compact hyper-spherical embedding space. Moreover, a new efficient learning algorithm is developed to better capture the global structure of the embedding space. Experiments for both classification and retrieval tasks on several standard datasets show that our method achieves state-of-the-art performance with a simpler training procedure. Furthermore, we demonstrate that, even with a small number of convolutional layers, our model can still obtain significantly better classification performance than the widely used softmax loss.

Includes members:
  Member "triplet center loss for multi view 3d object retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pf net point fractal network for 3d point cloud completion")
  Member "sphereface deep hypersphere embedding for face recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "prototypical networks for few shot learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "von mises fisher mixture model based deep learning application to face verification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "directional deep embedding and appearance learning for fast video object segmentation")
  Member "part based deep hashing for large scale person re identification":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cdpm convolutional deformable part models for semantically aligned person re identification")
  Member "rethinking feature discrimination and polymerization for large scale recognition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the devil is in the channels mutual channel loss for fine grained image classification")
  Member "l2 constrained softmax loss for discriminative face verification":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalizing face representation with unlabeled data")
  Member "fast training of triplet based deep binary embedding networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep heterogeneous hashing for face video retrieval")

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.CV(Computer Vision and Pattern Recognition)