human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "signal to noise ratio a robust distance metric for deep metric learning"
  Abstract: Deep metric learning, which learns discriminative features to process image clustering and retrieval tasks, has attracted extensive attention in recent years. A number of deep metric learning methods, which ensure that similar examples are mapped close to each other and dissimilar examples are mapped farther apart, have been proposed to construct effective structures for loss functions and have shown promising results. In this paper, different from the approaches on learning the loss structures, we propose a robust SNR distance metric based on Signal-to-Noise Ratio (SNR) for measuring the similarity of image pairs for deep metric learning. By exploring the properties of our SNR distance metric from the view of geometry space and statistical theory, we analyze the properties of our metric and show that it can preserve the semantic similarity between image pairs, which well justify its suitability for deep metric learning. Compared with Euclidean distance metric, our SNR distance metric can further jointly reduce the intra-class distances and enlarge the inter-class distances for learned features. Leveraging our SNR distance metric, we propose Deep SNR-based Metric Learning (DSML) to generate discriminative feature embeddings. By extensive experiments on three widely adopted benchmarks, including CARS196, CUB200-2011 and CIFAR10, our DSML has shown its superiority over other state-of-the-art methods. Additionally, we extend our SNR distance metric to deep hashing learning, and conduct experiments on two benchmarks, including CIFAR10 and NUS-WIDE, to demonstrate the effectiveness and generality of our SNR distance metric.

Connected through hyperedge HE-1 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning"):
  with members:
    - "ranked list loss for deep metric learning"
    - "metric learning with horde high order regularizer for deep embeddings"
    - "multi similarity loss with general pair weighting for deep metric learning"
    - "hardness aware deep metric learning"
    - "divide and conquer the embedding space for metric learning"
    - "softtriple loss deep metric learning without triplet sampling"
    - "self supervised learning of pretext invariant representations"
    - "deep metric learning with bier boosting independent embeddings robustly"

Connected through hyperedge HE-2 (induced by source paper "a metric learning reality check"):
  with members:
    - "a simple framework for contrastive learning of visual representations"
    - "revisiting training strategies and generalization performance in deep metric learning"
    - "unbiased evaluation of deep metric learning algorithms"
    - "multi similarity loss with general pair weighting for deep metric learning"
    - "hardness aware deep metric learning"
    - "momentum contrast for unsupervised visual representation learning"
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "softtriple loss deep metric learning without triplet sampling"

Connected through hyperedge HE-3 (induced by source paper "instance cross entropy for deep metric learning"):
  with members:
    - "ranked list loss for deep metric learning"
    - "multi similarity loss with general pair weighting for deep metric learning"
    - "hardness aware deep metric learning"
    - "divide and conquer the embedding space for metric learning"
    - "deep metric learning beyond binary supervision"
    - "decoupled networks"
    - "deep randomized ensembles for metric learning"
    - "learning towards minimum hyperspherical energy"

Connected through hyperedge HE-4 (induced by source paper "hybrid attention based decoupled metric learning for zero shot image retrieval"):
  with members:
    - "energy confused adversarial metric learning for zero shot image retrieval and clustering"
    - "deep metric learning with bier boosting independent embeddings robustly"
    - "zero shot sketch image hashing"
    - "discriminative learning of latent features for zero shot recognition"
    - "almn deep embedding learning with geometrical virtual point generating"
    - "attention based ensemble for deep metric learning"
    - "sampling matters in deep embedding learning"
    - "deep metric learning with angular loss"

Question: Please tell me which class the center node 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)