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 "all graphs lead to rome learning geometric and cycle consistent representations with graph convolutional networks"):
  Abstract: Image feature matching is a fundamental part of many geometric computer vision applications, and using multiple images can improve performance. In this work, we formulate multi-image matching as a graph embedding problem then use a Graph Convolutional Network to learn an appropriate embedding function for aligning image features. We use cycle consistency to train our network in an unsupervised fashion, since ground truth correspondence is difficult or expensive to aquire. In addition, geometric consistency losses can be added at training time, even if the information is not available in the test set, unlike previous approaches that optimize cycle consistency directly. To the best of our knowledge, no other works have used learning for multi-image feature matching. Our experiments show that our method is competitive with other optimization based approaches.

Includes members:
  Member "group normalization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on feature normalization and data augmentation")
  Member "relational inductive biases deep learning and graph networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "mimo graph filters for convolutional neural networks":
    also connected through other hyperedges:
      (none)
  Member "convolutional neural networks via node varying graph filters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "edgenets edge varying graph neural networks")
  Member "geometric deep learning going beyond euclidean data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on deep geometry learning from a representation perspective")
  Member "unpaired image to image translation using cycle consistent adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "learning to find good correspondences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "image matching across wide baselines from paper to practice")
  Member "multi image semantic matching by mining consistent features":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "probabilistic permutation synchronization using the riemannian structure of the birkhoff polytope")

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)