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: "revisiting training strategies and generalization performance in deep metric learning"
  Abstract: Deep Metric Learning (DML) is arguably one of the most influential lines of research for learning visual similarities with many proposed approaches every year. Although the field benefits from the rapid progress, the divergence in training protocols, architectures, and parameter choices make an unbiased comparison difficult. To provide a consistent reference point, we revisit the most widely used DML objective functions and conduct a study of the crucial parameter choices as well as the commonly neglected mini-batch sampling process. Based on our analysis, we uncover a correlation between the embedding space compression and the generalization performance of DML models. Exploiting these insights, we propose a simple, yet effective, training regularization to reliably boost the performance of ranking-based DML models on various standard benchmark datasets.

Connected through hyperedge HE-1 (induced by source paper "rethinking zero shot video classification end to end training for realistic applications"):
  with members:
    - "action recognition with spatial temporal discriminative filter banks"
    - "divide and conquer the embedding space for metric learning"
    - "action2vec a crossmodal embedding approach to action learning"
    - "cross and learn cross modal self supervision"
    - "informed democracy voting based novelty detection for action recognition"
    - "visual data synthesis via gan for zero shot video classification"
    - "encoder decoder with atrous separable convolution for semantic image segmentation"
    - "sniper efficient multi scale training"

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"
    - "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"
    - "signal to noise ratio a robust distance metric for deep metric learning"
    - "softtriple loss deep metric learning without triplet sampling"

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)