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: "zoomout spectral upsampling for efficient shape correspondence"
  Abstract: We present a simple and efficient method for refining maps or correspondences by iterative upsampling in the spectral domain that can be implemented in a few lines of code. Our main observation is that high quality maps can be obtained even if the input correspondences are noisy or are encoded by a small number of coefficients in a spectral basis. We show how this approach can be used in conjunction with existing initialization techniques across a range of application scenarios, including symmetry detection, map refinement across complete shapes, non-rigid partial shape matching and function transfer. In each application we demonstrate an improvement with respect to both the quality of the results and the computational speed compared to the best competing methods, with up to two orders of magnitude speed-up in some applications. We also demonstrate that our method is both robust to noisy input and is scalable with respect to shape complexity. Finally, we present a theoretical justification for our approach, shedding light on structural properties of functional maps.

Connected through hyperedge HE-1 (induced by source paper "mina convex mixed integer programming for non rigid shape alignment"):
  with members:
    - "continuous and orientation preserving correspondences via functional maps"
    - "unsupervised deep learning for structured shape matching"
    - "deep functional maps structured prediction for dense shape correspondence"
    - "product manifold filter non rigid shape correspondence via kernel density estimation in the product space"
    - "ds a flexible scalable and provably tight relaxation for matching problems"
    - "a combinatorial solution to non rigid 3d shape to image matching"
    - "efficient globally optimal 2d to 3d deformable shape matching"
    - "alternating direction graph matching"

Connected through hyperedge HE-2 (induced by source paper "deep geometric matrix completion are we doing it right"):
  with members:
    - "implicit regularization in deep matrix factorization"
    - "simplifying graph convolutional networks"
    - "on the optimization of deep networks implicit acceleration by overparameterization"
    - "geometric matrix completion with recurrent multi graph neural networks"
    - "algorithmic regularization in over parameterized matrix recovery"
    - "neural network matrix factorization"
    - "matrix completion on graphs"
    - "functional correspondence by matrix completion"

Connected through hyperedge HE-3 (induced by source paper "smooth shells multi scale shape registration with functional maps"):
  with members:
    - "lbs autoencoder self supervised fitting of articulated meshes to point clouds"
    - "divergence free shape interpolation and correspondence"
    - "continuous and orientation preserving correspondences via functional maps"
    - "3d coded 3d correspondences by deep deformation"
    - "farm functional automatic registration method for 3d human bodies"
    - "product manifold filter non rigid shape correspondence via kernel density estimation in the product space"
    - "efficient deformable shape correspondence via kernel matching"
    - "point wise map recovery and refinement from functional correspondence"

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.GR(Graphics)