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 "object recognition from very few training examples for enhancing bicycle maps"):
  Abstract: In recent years, data-driven methods have shown great success for extracting information about the infrastructure in urban areas. These algorithms are usually trained on large datasets consisting of thousands or millions of labeled training examples. While large datasets have been published regarding cars, for cyclists very few labeled data is available although appearance, point of view, and positioning of even relevant objects differ. Unfortunately, labeling data is costly and requires a huge amount of work. In this paper, we thus address the problem of learning with very few labels. The aim is to recognize particular traffic signs in crowdsourced data to collect information which is of interest to cyclists. We propose a system for object recognition that is trained with only 15 examples per class on average. To achieve this, we combine the advantages of convolutional neural networks and random forests to learn a patch-wise classifier. In the next step, we map the random forest to a neural network and transform the classifier to a fully convolutional network. Thereby, the processing of full images is significantly accelerated and bounding boxes can be predicted. Finally, we integrate data of the Global Positioning System (GPS) to localize the predictions on the map. In comparison to Faster R-CNN and other networks for object recognition or algorithms for transfer learning, we considerably reduce the required amount of labeled data. We demonstrate good performance on the recognition of traffic signs for cyclists as well as their localization in maps.

Includes members:
  Member "deep learning for vanishing point detection using an inverse gnomonic projection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consac robust multi model fitting by conditional sample consensus")
  Member "on support relations and semantic scene graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nodis neural ordinary differential scene understanding")
  Member "the cityscapes dataset for semantic urban scene understanding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "ssd single shot multibox detector":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relatext exploiting visual relationships for arbitrary shaped scene text detection with graph convolutional networks")
  Member "yolo9000 better faster stronger":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "object detection in optical remote sensing images a survey and a new benchmark")
  Member "random forests versus neural networks what s best for camera localization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "visual camera re localization from rgb and rgb d images using dsac")
  Member "learning to detect and localize many objects from few examples":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "full page text recognition learning where to start and when to stop")
  Member "fast r cnn":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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)