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 "pl _ 1 p point line minimal problems under partial visibility in three views"):
  Abstract: We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at most one point. This is a large class of interesting minimal problems that allows missing observations in images due to occlusions and missed detections. There is an infinite number of such minimal problems; however, we show that they can be reduced to 140616 equivalence classes by removing superfluous features and relabeling the cameras. We also introduce camera-minimal problems, which are practical for designing minimal solvers, and show how to pick a simplest camera-minimal problem for each minimal problem. This simplification results in 74575 equivalence classes. Only 76 of these were known; the rest are new. In order to identify problems that have potential for practical solving of image matching and 3D reconstruction, we present several smaller natural subfamilies of camera-minimal problems as well as compute solution counts for all camera-minimal problems which have less than 300 solutions for generic data.

Includes members:
  Member "trifocal relative pose from lines at points and its efficient solution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "plmp point line minimal problems in complete multi view visibility")
  Member "plmp point line minimal problems in complete multi view visibility":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "holistically attracted wireframe parsing")
  Member "neighbourhood consensus networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep graph matching consensus")
  Member "five point fundamental matrix estimation for uncalibrated cameras":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "plmp point line minimal problems in complete multi view visibility")
  Member "a minimal closed form solution for multi perspective pose estimation using points and lines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "globally optimal consensus maximization for robust visual inertial localization in point and line map")
  Member "inloc indoor visual localization with dense matching and view synthesis":
    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 "a clever elimination strategy for efficient minimal solvers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimal solvers for indoor uav positioning")
  Member "a minimal solution for two view focal length estimation using two affine correspondences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "plmp point line minimal problems in complete multi view visibility")

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)