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: "near optimal joint object matching via convex relaxation"
  Abstract: Joint matching over a collection of objects aims at aggregating information from a large collection of similar instances (e.g. images, graphs, shapes) to improve maps between pairs of them. Given multiple matches computed between a few object pairs in isolation, the goal is to recover an entire collection of maps that are (1) globally consistent, and (2) close to the provided maps --- and under certain conditions provably the ground-truth maps. Despite recent advances on this problem, the best-known recovery guarantees are limited to a small constant barrier --- none of the existing methods find theoretical support when more than $50\%$ of input correspondences are corrupted. Moreover, prior approaches focus mostly on fully similar objects, while it is practically more demanding to match instances that are only partially similar to each other. #R##N#In this paper, we develop an algorithm to jointly match multiple objects that exhibit only partial similarities, given a few pairwise matches that are densely corrupted. Specifically, we propose to recover the ground-truth maps via a parameter-free convex program called MatchLift, following a spectral method that pre-estimates the total number of distinct elements to be matched. Encouragingly, MatchLift exhibits near-optimal error-correction ability, i.e. in the asymptotic regime it is guaranteed to work even when a dominant fraction $1-\Theta\left(\frac{\log^{2}n}{\sqrt{n}}\right)$ of the input maps behave like random outliers. Furthermore, MatchLift succeeds with minimal input complexity, namely, perfect matching can be achieved as soon as the provided maps form a connected map graph. We evaluate the proposed algorithm on various benchmark data sets including synthetic examples and real-world examples, all of which confirm the practical applicability of MatchLift.

Connected through hyperedge HE-1 (induced by source paper "rgb d individual segmentation"):
  with members:
    - "lf net learning local features from images"
    - "srda generating instance segmentation annotation via scanning reasoning and domain adaptation"
    - "applying domain randomization to synthetic data for object category detection"
    - "imagenet trained cnns are biased towards texture increasing shape bias improves accuracy and robustness"
    - "neighbourhood consensus networks"
    - "semi parametric image synthesis"
    - "path aggregation network for instance segmentation"
    - "sniper efficient multi scale training"

Connected through hyperedge HE-2 (induced by source paper "probabilistic permutation synchronization using the riemannian structure of the birkhoff polytope"):
  with members:
    - "synchronisation of partial multi matchings via non negative factorisations"
    - "ppfnet global context aware local features for robust 3d point matching"
    - "bayesian pose graph optimization via bingham distributions and tempered geodesic mcmc"
    - "averaging stochastic gradient descent on riemannian manifolds"
    - "orb slam2 an open source slam system for monocular stereo and rgb d cameras"
    - "cad priors for accurate and flexible instance reconstruction"
    - "consistent multiple graph matching with multi layer random walks synchronization"
    - "multi image semantic matching by mining consistent features"

Connected through hyperedge HE-3 (induced by source paper "synchronisation of partial multi matchings via non negative factorisations"):
  with members:
    - "ds a flexible scalable and provably tight relaxation for matching problems"
    - "distributable consistent multi object matching"
    - "a constrained clustering based approach for matching a collection of feature sets"
    - "spectral synchronization of multiple views in se 3"
    - "efficient and non convex coordinate descent for symmetric nonnegative matrix factorization"
    - "multi graph matching via affinity optimization with graduated consistency regularization"
    - "a dual ascent framework for lagrangean decomposition of combinatorial problems"
    - "alternating direction graph matching"

Connected through hyperedge HE-4 (induced by source paper "region segmentation via deep learning and convex optimization"):
  with members:
    - "nesti net normal estimation for unstructured 3d point clouds using convolutional neural networks"
    - "pcpnet learning local shape properties from raw point clouds"
    - "deep attractor network for single microphone speaker separation"
    - "deep projective 3d semantic segmentation"
    - "pointnet deep hierarchical feature learning on point sets in a metric space"
    - "semantic instance segmentation with a discriminative loss function"
    - "permutation invariant training of deep models for speaker independent multi talker speech separation"
    - "3d u net learning dense volumetric segmentation from sparse annotation"

Connected through hyperedge HE-5 (induced by source paper "convex optimisation for inverse kinematics"):
  with members:
    - "reticam real time human performance capture from monocular video"
    - "convex relaxations for pose graph optimization with outliers"
    - "rotation averaging and strong duality"
    - "ganerated hands for real time 3d hand tracking from monocular rgb"
    - "vnect real time 3d human pose estimation with a single rgb camera"
    - "real time hand tracking under occlusion from an egocentric rgb d sensor"
    - "non iterative rigid 2d 3d point set registration using semidefinite programming"
    - "real time hand tracking using a sum of anisotropic gaussians model"

Connected through hyperedge HE-6 (induced by source paper "clear a consistent lifting embedding and alignment rectification algorithm for multi agent data association"):
  with members:
    - "synchronisation of partial multi matchings via non negative factorisations"
    - "all graphs lead to rome learning geometric and cycle consistent representations with graph convolutional networks"
    - "multi image semantic matching by mining consistent features"
    - "distributable consistent multi object matching"
    - "a constrained clustering based approach for matching a collection of feature sets"
    - "multi graph matching via affinity optimization with graduated consistency regularization"
    - "netvlad cnn architecture for weakly supervised place recognition"
    - "multi image matching via fast alternating minimization"

Connected through hyperedge HE-7 (induced by source paper "learning transformation synchronization"):
  with members:
    - "open3d a modern library for 3d data processing"
    - "recurrent transformer networks for semantic correspondence"
    - "robust rotation synchronization via low rank and sparse matrix decomposition"
    - "learning to find good correspondences"
    - "spectral synchronization of multiple views in se 3"
    - "a large dataset of object scans"
    - "a solution for multi alignment by transformation synchronisation"
    - "multi image matching via fast alternating minimization"

Connected through hyperedge HE-8 (induced by source paper "distributed and consistent multi image feature matching via quickmatch"):
  with members:
    - "ps dbscan an efficient parallel dbscan algorithm based on platform of ai pai"
    - "billion scale similarity search with gpus"
    - "anchornet a weakly supervised network to learn geometry sensitive features for semantic matching"
    - "accelerated nearest neighbor search with quick adc"
    - "multi image semantic matching by mining consistent features"
    - "distributable consistent multi object matching"
    - "multi image matching via fast alternating minimization"
    - "hypercolumns for object segmentation and fine grained localization"

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.LG(Machine Learning)