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 "almn deep embedding learning with geometrical virtual point generating"):
  Abstract: Deep embedding learning becomes more attractive for discriminative feature learning, but many methods still require hard-class mining, which is computationally complex and performance-sensitive. To this end, we propose Adaptive Large Margin N-Pair loss (ALMN) to address the aforementioned issues. Instead of exploring hard example-mining strategy, we introduce the concept of large margin constraint. This constraint aims at encouraging local-adaptive large angular decision margin among dissimilar samples in multimodal feature space so as to significantly encourage intraclass compactness and interclass separability. And it is mainly achieved by a simple yet novel geometrical Virtual Point Generating (VPG) method, which converts artificially setting a fixed margin into automatically generating a boundary training sample in feature space and is an open question. We demonstrate the effectiveness of our method on several popular datasets for image retrieval and clustering tasks.

Includes members:
  Member "sampling matters in deep embedding learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")
  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 "noisy softmax improving the generalization ability of dcnn via postponing the early softmax saturation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simple and effective prevention of mode collapse in deep one class classification")
  Member "deep metric learning with angular loss":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")
  Member "no fuss distance metric learning using proxies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "opengan open set generative adversarial networks")
  Member "smart mining for deep metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "opengan open set generative adversarial networks")
  Member "deep metric learning via facility location":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "opengan open set generative adversarial networks")
  Member "local similarity aware deep feature embedding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "informative sample mining network for multi domain image to image translation")

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)