{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-matching","name":"Graph Matching","slug":"graph-matching","description_markdown":"**Graph Matching** is the problem of finding correspondences between two sets of vertices while preserving complex relational information among them. Since the graph structure has a strong capacity to represent objects and robustness to severe deformation and outliers, it is frequently adopted to formulate various correspondence problems in the field of computer vision. Theoretically, the Graph Matching problem can be solved by exhaustively searching the entire solution space. However, this approach is infeasible in practice because the solution space expands exponentially as the size of input data increases. For that reason, previous studies have attempted to solve the problem by using various approximation techniques.\n\n\n<span class=\"description-source\">Source: [Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization ](https://arxiv.org/abs/1712.02575)</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":477,"papers_with_code":163,"benchmarks":7,"benchmark_tables_in_archive":7,"benchmark_tables_shown":7,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":11,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-matching-on-pascal-voc","slug":"graph-matching-on-pascal-voc","dataset":"PASCAL VOC","dataset_url":"/dataset/pascal-voc","rows_in_archive":31,"metrics":["F1 score","matching accuracy"],"first_row_in_archive_order":{"model":"URL","paper_title":"Universe Points Representation Learning for Partial Multi-Graph Matching","paper_url":"/paper/universe-points-representation-learning-for","paper_date":"2022-12-01","arxiv_id":"2212.00780","code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-matching-on-willow-object-class","slug":"graph-matching-on-willow-object-class","dataset":"Willow Object Class","dataset_url":null,"rows_in_archive":23,"metrics":["matching accuracy","F1 score"],"first_row_in_archive_order":{"model":"COMMON","paper_title":"Graph Matching with Bi-level Noisy Correspondence","paper_url":"/paper/graph-matching-with-bi-level-noisy","paper_date":"2022-12-08","arxiv_id":"2212.04085","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"},{"title":"Lin-Yijie/Graph-Matching-Networks","url":"https://github.com/Lin-Yijie/Graph-Matching-Networks/tree/main/COMMON"},{"title":"xlearning-scu/2023-iccv-common","url":"https://github.com/xlearning-scu/2023-iccv-common"}],"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-matching-with-bi-level-noisy#ran","syntology_url":"https://syntology.ai/paper/2212.04085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04085"}},"official":{"repos":["Thinklab-SJTU/ThinkMatch","xlearning-scu/2023-iccv-common","Lin-Yijie/Graph-Matching-Networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-matching-on-spair-71k","slug":"graph-matching-on-spair-71k","dataset":"SPair-71k","dataset_url":"/dataset/spair-71k","rows_in_archive":8,"metrics":["matching accuracy"],"first_row_in_archive_order":{"model":"CREAM","paper_title":"Cross-modal Retrieval with Noisy Correspondence via Consistency Refining and Mining","paper_url":"/paper/cross-modal-retrieval-with-noisy","paper_date":"2024-03-25","arxiv_id":null,"code_links":[{"title":"XLearning-SCU/2024-TIP-CREAM","url":"https://github.com/XLearning-SCU/2024-TIP-CREAM"}],"syntology":null}},{"leaderboard":"/sota/graph-matching-on-imcpt-sparsegm-100","slug":"graph-matching-on-imcpt-sparsegm-100","dataset":"IMCPT-SparseGM-100","dataset_url":"/dataset/imcpt-sparsegm-100","rows_in_archive":6,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"GCAN-AFAT-U","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","paper_url":"/paper/deep-learning-of-partial-graph-matching-via","paper_date":"2023-01-01","arxiv_id":null,"code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"syntology":null}},{"leaderboard":"/sota/graph-matching-on-imcpt-sparsegm-50","slug":"graph-matching-on-imcpt-sparsegm-50","dataset":"IMCPT-SparseGM-50","dataset_url":"/dataset/imcpt-sparsegm","rows_in_archive":6,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"GCAN-AFAT-I","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","paper_url":"/paper/deep-learning-of-partial-graph-matching-via","paper_date":"2023-01-01","arxiv_id":null,"code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"syntology":null}},{"leaderboard":"/sota/graph-matching-on-rare","slug":"graph-matching-on-rare","dataset":"RARE","dataset_url":"/dataset/rare","rows_in_archive":5,"metrics":["Spearman Correlation"],"first_row_in_archive_order":{"model":"Smatch","paper_title":"Smatch: an Evaluation Metric for Semantic Feature Structures","paper_url":"/paper/smatch-an-evaluation-metric-for-semantic","paper_date":"2013-08-01","arxiv_id":null,"code_links":[{"title":"snowblink14/smatch","url":"https://github.com/snowblink14/smatch"}],"syntology":null}},{"leaderboard":"/sota/graph-matching-on-cub","slug":"graph-matching-on-cub","dataset":"CUB","dataset_url":"/dataset/cub-200-2011","rows_in_archive":4,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"URL","paper_title":"Universe Points Representation Learning for Partial Multi-Graph Matching","paper_url":"/paper/universe-points-representation-learning-for","paper_date":"2022-12-01","arxiv_id":"2212.00780","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/cub-200-2011","name":"CUB-200-2011","full_name":"Caltech-UCSD Birds-200-2011","num_papers_in_archive":2235},{"url":"/dataset/pascal-voc","name":"PASCAL VOC","full_name":"PASCAL Visual Object Classes Challenge","num_papers_in_archive":198},{"url":"/dataset/spair-71k","name":"SPair-71k","full_name":"","num_papers_in_archive":71},{"url":"/dataset/occluded-reid","name":"Occluded REID","full_name":"Occluded REID","num_papers_in_archive":65},{"url":"/dataset/birdsong","name":"BirdSong","full_name":"","num_papers_in_archive":35},{"url":"/dataset/linux","name":"Linux","full_name":"Linux Program Dependence Graphs","num_papers_in_archive":14},{"url":"/dataset/mindboggle","name":"Mindboggle","full_name":"","num_papers_in_archive":9},{"url":"/dataset/rare","name":"RARE","full_name":"Randomized AMRs with Rewired Edges","num_papers_in_archive":5},{"url":"/dataset/dispscenes","name":"DispScenes","full_name":null,"num_papers_in_archive":2},{"url":"/dataset/imcpt-sparsegm-100","name":"IMCPT-SparseGM-100","full_name":"","num_papers_in_archive":1},{"url":"/dataset/imcpt-sparsegm","name":"IMCPT-SparseGM-50","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":477,"of_with_code":163,"tagged_in_all":477,"counts":{"archive_papers_tagged":477,"with_a_code_link":163,"where_syntology_ran_a_sample":35,"not_listed_spam_title":0,"listed":477,"listed_where_code_ran":35,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":27,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":27,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/molgan-an-implicit-generative-model-for-small","slug":"molgan-an-implicit-generative-model-for-small","title":"MolGAN: An implicit generative model for small molecular graphs","date":"2018-05-30","arxiv_id":"1805.11973","repositories_listed":11,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":10,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/molgan-an-implicit-generative-model-for-small#ran","syntology_url":"https://syntology.ai/paper/1805.11973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11973"}},"official":{"repos":["nicola-decao/MolGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/deep-graph-matching-via-blackbox","slug":"deep-graph-matching-via-blackbox","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-03-25","arxiv_id":"2003.11657","repositories_listed":5,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-graph-matching-via-blackbox#ran","syntology_url":"https://syntology.ai/paper/2003.11657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11657"}},"official":{"repos":["martius-lab/blackbox-deep-graph-matching"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graphecho-graph-driven-unsupervised-domain","slug":"graphecho-graph-driven-unsupervised-domain","title":"GraphEcho: Graph-Driven Unsupervised Domain Adaptation for Echocardiogram Video Segmentation","date":"2023-09-20","arxiv_id":"2309.11145","repositories_listed":4,"syntology":null},{"url":"/paper/multiple-heads-are-better-than-one-few-shot","slug":"multiple-heads-are-better-than-one-few-shot","title":"Multiple Heads are Better than One: Few-shot Font Generation with Multiple Localized Experts","date":"2021-04-02","arxiv_id":"2104.00887","repositories_listed":4,"syntology":null},{"url":"/paper/pharmaconet-accelerating-structure-based","slug":"pharmaconet-accelerating-structure-based","title":"PharmacoNet: Accelerating Large-Scale Virtual Screening by Deep Pharmacophore Modeling","date":"2023-10-01","arxiv_id":"2310.00681","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pharmaconet-accelerating-structure-based#ran","syntology_url":"https://syntology.ai/paper/2310.00681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00681"}},"official":{"repos":["seonghwanseo/molvoxel","seonghwanseo/pharmaconet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-matching-with-bi-level-noisy","slug":"graph-matching-with-bi-level-noisy","title":"Graph Matching with Bi-level Noisy Correspondence","date":"2022-12-08","arxiv_id":"2212.04085","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-matching-with-bi-level-noisy#ran","syntology_url":"https://syntology.ai/paper/2212.04085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04085"}},"official":{"repos":["Thinklab-SJTU/ThinkMatch","xlearning-scu/2023-iccv-common","Lin-Yijie/Graph-Matching-Networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-histogram-based-graph-matching-for","slug":"semantic-histogram-based-graph-matching-for","title":"Semantic Histogram Based Graph Matching for Real-Time Multi-Robot Global Localization in Large Scale Environment","date":"2020-10-19","arxiv_id":"2010.09297","repositories_listed":3,"syntology":null},{"url":"/paper/amr-similarity-metrics-from-principles","slug":"amr-similarity-metrics-from-principles","title":"AMR Similarity Metrics from Principles","date":"2020-01-29","arxiv_id":"2001.10929","repositories_listed":3,"syntology":null},{"url":"/paper/dynamic-graph-representation-for-partially","slug":"dynamic-graph-representation-for-partially","title":"Dynamic Graph Representation for Partially Occluded Biometrics","date":"2019-12-01","arxiv_id":"1912.00377","repositories_listed":3,"syntology":null},{"url":"/paper/graph-matching-networks-for-learning-the-1","slug":"graph-matching-networks-for-learning-the-1","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","date":"2019-04-29","arxiv_id":"1904.12787","repositories_listed":3,"syntology":null},{"url":"/paper/multiscale-dynamic-graph-representation-for","slug":"multiscale-dynamic-graph-representation-for","title":"Multiscale Dynamic Graph Representation for Biometric Recognition with Occlusions","date":"2023-07-27","arxiv_id":"2307.14617","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-manifold-alignment-with-joint","slug":"unsupervised-manifold-alignment-with-joint","title":"Unsupervised Manifold Alignment with Joint Multidimensional Scaling","date":"2022-07-06","arxiv_id":"2207.02968","repositories_listed":2,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":2,"n_instrument":12,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 12 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unsupervised-manifold-alignment-with-joint#ran","syntology_url":"https://syntology.ai/paper/2207.02968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02968"}},"official":{"repos":["borgwardtlab/jointmds"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/a-comparative-study-of-graph-matching","slug":"a-comparative-study-of-graph-matching","title":"A Comparative Study of Graph Matching Algorithms in Computer Vision","date":"2022-07-01","arxiv_id":"2207.00291","repositories_listed":2,"syntology":{"n":22,"n_ran":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":0,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comparative-study-of-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2207.00291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.00291"}},"official":{"repos":["vislearn/gmbench"],"state":"official (archive's flag): 22 ran","n_ran":22,"n_constructed":0,"n_ran_no_instrument_failure":21,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-backpropagation-through","slug":"gradient-backpropagation-through","title":"Backpropagation through Combinatorial Algorithms: Identity with Projection Works","date":"2022-05-30","arxiv_id":"2205.15213","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-networks-for-cross-camera-data","slug":"graph-neural-networks-for-cross-camera-data","title":"Graph Neural Networks for Cross-Camera Data Association","date":"2022-01-17","arxiv_id":"2201.06311","repositories_listed":2,"syntology":null},{"url":"/paper/joint-graph-learning-and-matching-for","slug":"joint-graph-learning-and-matching-for","title":"Joint Graph Learning and Matching for Semantic Feature Correspondence","date":"2021-09-01","arxiv_id":"2109.00240","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-edge-attention-for-graph-matching","slug":"adaptive-edge-attention-for-graph-matching","title":"Adaptive Edge Attention for Graph Matching with Outliers","date":"2021-08-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deep-graph-matching-meets-mixed-integer","slug":"deep-graph-matching-meets-mixed-integer","title":"Deep graph matching meets mixed-integer linear programming: Relax at your own risk ?","date":"2021-08-01","arxiv_id":"2108.00394","repositories_listed":2,"syntology":null},{"url":"/paper/robust-point-cloud-registration-framework","slug":"robust-point-cloud-registration-framework","title":"Robust Point Cloud Registration Framework Based on Deep Graph Matching","date":"2021-03-07","arxiv_id":"2103.04256","repositories_listed":2,"syntology":{"n":38,"n_ran":26,"n_constructed":6,"n_ran_checked":20,"n_instrument":6,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":38,"phrase":"26 ran (of which 6 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 6 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/robust-point-cloud-registration-framework#ran","syntology_url":"https://syntology.ai/paper/2103.04256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.04256"}},"official":{"repos":["fukexue/RGM"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":8,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fusion-moves-for-graph-matching","slug":"fusion-moves-for-graph-matching","title":"Fusion Moves for Graph Matching","date":"2021-01-28","arxiv_id":"2101.12085","repositories_listed":2,"syntology":null},{"url":"/paper/deep-reinforcement-learning-of-graph-matching","slug":"deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","arxiv_id":"2012.08950","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-of-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2012.08950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08950"}},"official":{"repos":["thinklab-sjtu/rgm","Thinklab-SJTU/awesome-ml4co"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/high-order-information-matters-learning","slug":"high-order-information-matters-learning","title":"High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification","date":"2020-03-18","arxiv_id":"2003.08177","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/high-order-information-matters-learning#ran","syntology_url":"https://syntology.ai/paper/2003.08177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08177"}},"official":{"repos":["wangguanan/HOReID"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-graph-matching-consensus-1","slug":"deep-graph-matching-consensus-1","title":"Deep Graph Matching Consensus","date":"2020-01-27","arxiv_id":"2001.09621","repositories_listed":2,"syntology":null},{"url":"/paper/learning-cross-modal-context-graph-for-visual-1","slug":"learning-cross-modal-context-graph-for-visual-1","title":"Learning Cross-modal Context Graph for Visual Grounding","date":"2019-11-20","arxiv_id":"1911.09042","repositories_listed":2,"syntology":null},{"url":"/paper/mtab-matching-tabular-data-to-knowledge-graph","slug":"mtab-matching-tabular-data-to-knowledge-graph","title":"MTab: Matching Tabular Data to Knowledge Graph using Probability Models","date":"2019-10-01","arxiv_id":"1910.00246","repositories_listed":2,"syntology":null},{"url":"/paper/isonn-isomorphic-neural-network-for-graph","slug":"isonn-isomorphic-neural-network-for-graph","title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","date":"2019-07-22","arxiv_id":"1907.09495","repositories_listed":2,"syntology":null},{"url":"/paper/sembleu-a-robust-metric-for-amr-parsing","slug":"sembleu-a-robust-metric-for-amr-parsing","title":"SemBleu: A Robust Metric for AMR Parsing Evaluation","date":"2019-05-26","arxiv_id":"1905.10726","repositories_listed":2,"syntology":null},{"url":"/paper/sosnet-second-order-similarity-regularization","slug":"sosnet-second-order-similarity-regularization","title":"SOSNet: Second Order Similarity Regularization for Local Descriptor Learning","date":"2019-04-10","arxiv_id":"1904.05019","repositories_listed":2,"syntology":null},{"url":"/paper/gromov-wasserstein-learning-for-graph","slug":"gromov-wasserstein-learning-for-graph","title":"Gromov-Wasserstein Learning for Graph Matching and Node Embedding","date":"2019-01-17","arxiv_id":"1901.06003","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gromov-wasserstein-learning-for-graph#ran","syntology_url":"https://syntology.ai/paper/1901.06003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.06003"}},"official":{"repos":["HongtengXu/gwl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/map-inference-via-block-coordinate-frank","slug":"map-inference-via-block-coordinate-frank","title":"MAP inference via Block-Coordinate Frank-Wolfe Algorithm","date":"2018-06-13","arxiv_id":"1806.05049","repositories_listed":2,"syntology":null},{"url":"/paper/latent-fingerprint-recognition-role-of","slug":"latent-fingerprint-recognition-role-of","title":"Latent Fingerprint Recognition: Role of Texture Template","date":"2018-04-27","arxiv_id":"1804.10337","repositories_listed":2,"syntology":null},{"url":"/paper/multi-image-semantic-matching-by-mining","slug":"multi-image-semantic-matching-by-mining","title":"Multi-Image Semantic Matching by Mining Consistent Features","date":"2017-11-21","arxiv_id":"1711.07641","repositories_listed":2,"syntology":null},{"url":"/paper/alternating-direction-graph-matching","slug":"alternating-direction-graph-matching","title":"Alternating Direction Graph Matching","date":"2016-11-22","arxiv_id":"1611.07583","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/alternating-direction-graph-matching#ran","syntology_url":"https://syntology.ai/paper/1611.07583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07583"}},"official":null}},{"url":"/paper/probing-neural-topology-of-large-language","slug":"probing-neural-topology-of-large-language","title":"Probing Neural Topology of Large Language Models","date":"2025-06-01","arxiv_id":"2506.01042","repositories_listed":1,"syntology":null},{"url":"/paper/packhero-a-scalable-graph-based-approach-for","slug":"packhero-a-scalable-graph-based-approach-for","title":"PackHero: A Scalable Graph-based Approach for Efficient Packer Identification","date":"2025-05-31","arxiv_id":"2506.00659","repositories_listed":1,"syntology":null},{"url":"/paper/learning-without-isolation-pathway-protection","slug":"learning-without-isolation-pathway-protection","title":"Learning without Isolation: Pathway Protection for Continual Learning","date":"2025-05-24","arxiv_id":"2505.18568","repositories_listed":1,"syntology":null},{"url":"/paper/graph-reward-sql-execution-free-reinforcement","slug":"graph-reward-sql-execution-free-reinforcement","title":"Graph-Reward-SQL: Execution-Free Reinforcement Learning for Text-to-SQL via Graph Matching and Stepwise Reward","date":"2025-05-18","arxiv_id":"2505.12380","repositories_listed":1,"syntology":null},{"url":"/paper/test-time-domain-generalization-via-universe","slug":"test-time-domain-generalization-via-universe","title":"Test-Time Domain Generalization via Universe Learning: A Multi-Graph Matching Approach for Medical Image Segmentation","date":"2025-03-17","arxiv_id":"2503.13012","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/test-time-domain-generalization-via-universe#ran","syntology_url":"https://syntology.ai/paper/2503.13012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.13012"}},"official":{"repos":["yore0/ttdg-mgm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hegmn-heterogeneous-graph-matching-network","slug":"hegmn-heterogeneous-graph-matching-network","title":"HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity","date":"2025-03-11","arxiv_id":"2503.08739","repositories_listed":1,"syntology":null},{"url":"/paper/snoopy-effective-and-efficient-semantic-join","slug":"snoopy-effective-and-efficient-semantic-join","title":"Snoopy: Effective and Efficient Semantic Join Discovery via Proxy Columns","date":"2025-02-24","arxiv_id":"2502.16813","repositories_listed":1,"syntology":null},{"url":"/paper/visual-semantic-graph-matching-net-for-zero","slug":"visual-semantic-graph-matching-net-for-zero","title":"Visual-Semantic Graph Matching Net for Zero-Shot Learning","date":"2024-11-18","arxiv_id":"2411.11351","repositories_listed":1,"syntology":null},{"url":"/paper/tesgnn-temporal-equivariant-scene-graph","slug":"tesgnn-temporal-equivariant-scene-graph","title":"TESGNN: Temporal Equivariant Scene Graph Neural Networks for Efficient and Robust Multi-View 3D Scene Understanding","date":"2024-11-15","arxiv_id":"2411.10509","repositories_listed":1,"syntology":null},{"url":"/paper/clap-concave-linear-approximation-for","slug":"clap-concave-linear-approximation-for","title":"CLAP: Concave Linear APproximation for Quadratic Graph Matching","date":"2024-10-22","arxiv_id":"2410.17101","repositories_listed":1,"syntology":null},{"url":"/paper/glinsat-the-general-linear-satisfiability","slug":"glinsat-the-general-linear-satisfiability","title":"GLinSAT: The General Linear Satisfiability Neural Network Layer By Accelerated Gradient Descent","date":"2024-09-26","arxiv_id":"2409.17500","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glinsat-the-general-linear-satisfiability#ran","syntology_url":"https://syntology.ai/paper/2409.17500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17500"}},"official":{"repos":["huntertracer/glinsat"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dntextspotter-arbitrary-shaped-scene-text","slug":"dntextspotter-arbitrary-shaped-scene-text","title":"DNTextSpotter: Arbitrary-Shaped Scene Text Spotting via Improved Denoising Training","date":"2024-08-01","arxiv_id":"2408.00355","repositories_listed":1,"syntology":null},{"url":"/paper/linsatnet-the-positive-linear-satisfiability","slug":"linsatnet-the-positive-linear-satisfiability","title":"LinSATNet: The Positive Linear Satisfiability Neural Networks","date":"2024-07-18","arxiv_id":"2407.13917","repositories_listed":1,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/linsatnet-the-positive-linear-satisfiability#ran","syntology_url":"https://syntology.ai/paper/2407.13917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.13917"}},"official":{"repos":["thinklab-sjtu/linsatnet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/unlocking-the-potential-of-operations","slug":"unlocking-the-potential-of-operations","title":"Unlocking the Potential of Operations Research for Multi-Graph Matching","date":"2024-06-26","arxiv_id":"2406.18215","repositories_listed":1,"syntology":null},{"url":"/paper/oaei-machine-learning-dataset-for-online","slug":"oaei-machine-learning-dataset-for-online","title":"OAEI Machine Learning Dataset for Online Model Generation","date":"2024-04-29","arxiv_id":"2404.18542","repositories_listed":1,"syntology":null},{"url":"/paper/learning-latent-partial-matchings-with-gumbel","slug":"learning-latent-partial-matchings-with-gumbel","title":"Learning Latent Partial Matchings with Gumbel-IPF Networks","date":"2024-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rematch-robust-and-efficient-matching-of","slug":"rematch-robust-and-efficient-matching-of","title":"Rematch: Robust and Efficient Matching of Local Knowledge Graphs to Improve Structural and Semantic Similarity","date":"2024-04-02","arxiv_id":"2404.02126","repositories_listed":1,"syntology":null},{"url":"/paper/sg-pgm-partial-graph-matching-network-with","slug":"sg-pgm-partial-graph-matching-network-with","title":"SG-PGM: Partial Graph Matching Network with Semantic Geometric Fusion for 3D Scene Graph Alignment and Its Downstream Tasks","date":"2024-03-28","arxiv_id":"2403.19474","repositories_listed":1,"syntology":null},{"url":"/paper/cross-modal-retrieval-with-noisy","slug":"cross-modal-retrieval-with-noisy","title":"Cross-modal Retrieval with Noisy Correspondence via Consistency Refining and Mining","date":"2024-03-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dsgg-dense-relation-transformer-for-an-end-to","slug":"dsgg-dense-relation-transformer-for-an-end-to","title":"DSGG: Dense Relation Transformer for an End-to-end Scene Graph Generation","date":"2024-03-21","arxiv_id":"2403.14886","repositories_listed":1,"syntology":null},{"url":"/paper/do-vision-and-language-encoders-represent-the","slug":"do-vision-and-language-encoders-represent-the","title":"Do Vision and Language Encoders Represent the World Similarly?","date":"2024-01-10","arxiv_id":"2401.05224","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-vision-and-language-encoders-represent-the#ran","syntology_url":"https://syntology.ai/paper/2401.05224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.05224"}},"official":{"repos":["mayug/0-shot-llm-vision"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mind-artist-creating-artistic-snapshots-with","slug":"mind-artist-creating-artistic-snapshots-with","title":"Mind Artist: Creating Artistic Snapshots with Human Thought","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/xneusm-explainable-neural-subgraph-matching","slug":"xneusm-explainable-neural-subgraph-matching","title":"xNeuSM: Explainable Neural Subgraph Matching with Graph Learnable Multi-hop Attention Networks","date":"2023-12-04","arxiv_id":"2312.01612","repositories_listed":1,"syntology":null},{"url":"/paper/spotserve-serving-generative-large-language","slug":"spotserve-serving-generative-large-language","title":"SpotServe: Serving Generative Large Language Models on Preemptible Instances","date":"2023-11-27","arxiv_id":"2311.15566","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spotserve-serving-generative-large-language#ran","syntology_url":"https://syntology.ai/paper/2311.15566","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15566"}},"official":{"repos":["hsword/spotserve"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gmtr-graph-matching-transformers","slug":"gmtr-graph-matching-transformers","title":"GMTR: Graph Matching Transformers","date":"2023-11-14","arxiv_id":"2311.08141","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-and-benchmarking-predict-then","slug":"rethinking-and-benchmarking-predict-then","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","date":"2023-11-13","arxiv_id":"2311.07633","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-and-benchmarking-predict-then#ran","syntology_url":"https://syntology.ai/paper/2311.07633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07633"}},"official":{"repos":["thinklab-sjtu/predictiveco-benchmark"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-matching-via-convex-relaxation-to-the","slug":"graph-matching-via-convex-relaxation-to-the","title":"Graph Matching via convex relaxation to the simplex","date":"2023-10-31","arxiv_id":"2310.20609","repositories_listed":1,"syntology":null},{"url":"/paper/unimap-universal-smiles-graph-representation","slug":"unimap-universal-smiles-graph-representation","title":"UniMAP: Universal SMILES-Graph Representation Learning","date":"2023-10-22","arxiv_id":"2310.14216","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-domain-gap-by-clustering-based","slug":"bridging-the-domain-gap-by-clustering-based","title":"Clustering-based Image-Text Graph Matching for Domain Generalization","date":"2023-10-04","arxiv_id":"2310.02692","repositories_listed":1,"syntology":null},{"url":"/paper/cats-conditional-adversarial-trajectory","slug":"cats-conditional-adversarial-trajectory","title":"CATS: Conditional Adversarial Trajectory Synthesis for Privacy-Preserving Trajectory Data Publication Using Deep Learning Approaches","date":"2023-09-20","arxiv_id":"2309.11587","repositories_listed":1,"syntology":null},{"url":"/paper/ssig-a-visually-guided-graph-edit-distance","slug":"ssig-a-visually-guided-graph-edit-distance","title":"SSIG: A Visually-Guided Graph Edit Distance for Floor Plan Similarity","date":"2023-09-08","arxiv_id":"2309.04357","repositories_listed":1,"syntology":null},{"url":"/paper/learning-scene-pedestrian-graph-for-end-to","slug":"learning-scene-pedestrian-graph-for-end-to","title":"Learning Scene-Pedestrian Graph for End to end Person Search","date":"2023-08-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/co-attention-graph-pooling-for-efficient","slug":"co-attention-graph-pooling-for-efficient","title":"Co-attention Graph Pooling for Efficient Pairwise Graph Interaction Learning","date":"2023-07-28","arxiv_id":"2307.15377","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-deep-graph-matching-based-on","slug":"unsupervised-deep-graph-matching-based-on","title":"Unsupervised Deep Graph Matching Based on Cycle Consistency","date":"2023-07-18","arxiv_id":"2307.08930","repositories_listed":1,"syntology":null},{"url":"/paper/lvm-med-learning-large-scale-self-supervised-1","slug":"lvm-med-learning-large-scale-self-supervised-1","title":"LVM-Med: Learning Large-Scale Self-Supervised Vision Models for Medical Imaging via Second-order Graph Matching","date":"2023-06-20","arxiv_id":"2306.11925","repositories_listed":1,"syntology":{"n":13,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":13,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/lvm-med-learning-large-scale-self-supervised-1#ran","syntology_url":"https://syntology.ai/paper/2306.11925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11925"}},"official":{"repos":["duyhominhnguyen/LVM-Med"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-algorithms-for-exact-graph-matching","slug":"efficient-algorithms-for-exact-graph-matching","title":"Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation","date":"2023-05-31","arxiv_id":"2305.19666","repositories_listed":1,"syntology":null},{"url":"/paper/promptner-prompt-locating-and-typing-for","slug":"promptner-prompt-locating-and-typing-for","title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","date":"2023-05-26","arxiv_id":"2305.17104","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-aware-graph-matching-mechanism-for","slug":"semantic-aware-graph-matching-mechanism-for","title":"Semantic-Aware Graph Matching Mechanism for Multi-Label Image Recognition","date":"2023-04-21","arxiv_id":"2304.11275","repositories_listed":1,"syntology":null},{"url":"/paper/loop-closure-detection-based-on-object-level","slug":"loop-closure-detection-based-on-object-level","title":"Loop Closure Detection Based on Object-level Spatial Layout and Semantic Consistency","date":"2023-04-11","arxiv_id":"2304.05146","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-graph-matching-a-practical-paradigm","slug":"learnable-graph-matching-a-practical-paradigm","title":"Learnable Graph Matching: A Practical Paradigm for Data Association","date":"2023-03-27","arxiv_id":"2303.15414","repositories_listed":1,"syntology":null},{"url":"/paper/schema-inference-for-interpretable-image","slug":"schema-inference-for-interpretable-image","title":"Schema Inference for Interpretable Image Classification","date":"2023-03-12","arxiv_id":"2303.06635","repositories_listed":1,"syntology":null},{"url":"/paper/drawing-attention-to-detail-pose-alignment","slug":"drawing-attention-to-detail-pose-alignment","title":"Drawing Attention to Detail: Pose Alignment through Self-Attention for Fine-Grained Object Classification","date":"2023-02-09","arxiv_id":"2302.04800","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-entity-alignment-for-temporal","slug":"unsupervised-entity-alignment-for-temporal","title":"Unsupervised Entity Alignment for Temporal Knowledge Graphs","date":"2023-02-01","arxiv_id":"2302.00796","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-entity-alignment-for-temporal#ran","syntology_url":"https://syntology.ai/paper/2302.00796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00796"}},"official":{"repos":["zju-daily/dualmatch"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/population-wise-labeling-of-sulcal-graphs","slug":"population-wise-labeling-of-sulcal-graphs","title":"Population-wise Labeling of Sulcal Graphs using Multi-graph Matching","date":"2023-01-31","arxiv_id":"2301.13532","repositories_listed":1,"syntology":null},{"url":"/paper/emergence-of-the-svd-as-an-interpretable","slug":"emergence-of-the-svd-as-an-interpretable","title":"On the limits of neural network explainability via descrambling","date":"2023-01-18","arxiv_id":"2301.07820","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-inexact-graph-matching-on-top-of","slug":"model-based-inexact-graph-matching-on-top-of","title":"Model-based inexact graph matching on top of CNNs for semantic scene understanding","date":"2023-01-18","arxiv_id":"2301.07468","repositories_listed":1,"syntology":null},{"url":"/paper/learning-feature-recovery-transformer-for","slug":"learning-feature-recovery-transformer-for","title":"Learning Feature Recovery Transformer for Occluded Person Re-identification","date":"2023-01-05","arxiv_id":"2301.01879","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-of-partial-graph-matching-via","slug":"deep-learning-of-partial-graph-matching-via","title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-visible-infrared-person-re","slug":"unsupervised-visible-infrared-person-re","title":"Unsupervised Visible-Infrared Person Re-Identification via Progressive Graph Matching and Alternate Learning","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/automatic-semantic-modeling-for-structural","slug":"automatic-semantic-modeling-for-structural","title":"Automatic Semantic Modeling for Structural Data Source with the Prior Knowledge from Knowledge Base","date":"2022-12-21","arxiv_id":"2212.10915","repositories_listed":1,"syntology":null},{"url":"/paper/granngan-graph-annotation-generative","slug":"granngan-graph-annotation-generative","title":"GrannGAN: Graph annotation generative adversarial networks","date":"2022-12-01","arxiv_id":"2212.00449","repositories_listed":1,"syntology":null},{"url":"/paper/robust-point-cloud-registration-framework-1","slug":"robust-point-cloud-registration-framework-1","title":"Robust Point Cloud Registration Framework Based on Deep Graph Matching(TPAMI Version)","date":"2022-11-09","arxiv_id":"2211.04696","repositories_listed":1,"syntology":null},{"url":"/paper/towards-an-approach-based-on-knowledge-graph","slug":"towards-an-approach-based-on-knowledge-graph","title":"Towards an Approach based on Knowledge Graph Refinement for Tabular Data to Knowledge Graph Matching","date":"2022-10-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserved-neural-graph-similarity","slug":"privacy-preserved-neural-graph-similarity","title":"Privacy-Preserved Neural Graph Similarity Learning","date":"2022-10-21","arxiv_id":"2210.11730","repositories_listed":1,"syntology":null},{"url":"/paper/dynamical-softassign-and-adaptive-parameter","slug":"dynamical-softassign-and-adaptive-parameter","title":"CSGO: Constrained-Softassign Gradient Optimization For Large Graph Matching","date":"2022-08-17","arxiv_id":"2208.08233","repositories_listed":1,"syntology":null},{"url":"/paper/densely-constrained-depth-estimator-for","slug":"densely-constrained-depth-estimator-for","title":"Densely Constrained Depth Estimator for Monocular 3D Object Detection","date":"2022-07-20","arxiv_id":"2207.10047","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/densely-constrained-depth-estimator-for#ran","syntology_url":"https://syntology.ai/paper/2207.10047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10047"}},"official":{"repos":["bravegroup/dcd"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vi-fi-associating-moving-subjects-across","slug":"vi-fi-associating-moving-subjects-across","title":"Vi-Fi: Associating Moving Subjects across Vision and Wireless Sensors","date":"2022-07-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/muffliato-peer-to-peer-privacy-amplification","slug":"muffliato-peer-to-peer-privacy-amplification","title":"Muffliato: Peer-to-Peer Privacy Amplification for Decentralized Optimization and Averaging","date":"2022-06-10","arxiv_id":"2206.05091","repositories_listed":1,"syntology":null},{"url":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","repositories_listed":1,"syntology":null},{"url":"/paper/cgmn-a-contrastive-graph-matching-network-for","slug":"cgmn-a-contrastive-graph-matching-network-for","title":"CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning","date":"2022-05-30","arxiv_id":"2205.15083","repositories_listed":1,"syntology":null},{"url":"/paper/seedgnn-graph-neural-networks-for-supervised","slug":"seedgnn-graph-neural-networks-for-supervised","title":"SeedGNN: Graph Neural Networks for Supervised Seeded Graph Matching","date":"2022-05-26","arxiv_id":"2205.13679","repositories_listed":1,"syntology":null},{"url":"/paper/learning-constrained-structured-spaces-with","slug":"learning-constrained-structured-spaces-with","title":"Learning Constrained Structured Spaces with Application to Multi-Graph Matching","date":"2022-05-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectre-spectral-conditioning-helps-to","slug":"spectre-spectral-conditioning-helps-to","title":"SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators","date":"2022-04-04","arxiv_id":"2204.01613","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spectre-spectral-conditioning-helps-to#ran","syntology_url":"https://syntology.ai/paper/2204.01613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01613"}},"official":{"repos":["karolismart/spectre"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smaragd-synthesized-smatch-for-accurate-and","slug":"smaragd-synthesized-smatch-for-accurate-and","title":"SMARAGD: Learning SMatch for Accurate and Rapid Approximate Graph Distance","date":"2022-03-24","arxiv_id":"2203.13226","repositories_listed":1,"syntology":null},{"url":"/paper/sigma-semantic-complete-graph-matching-for","slug":"sigma-semantic-complete-graph-matching-for","title":"SIGMA: Semantic-complete Graph Matching for Domain Adaptive Object Detection","date":"2022-03-12","arxiv_id":"2203.06398","repositories_listed":1,"syntology":null},{"url":"/paper/neural-graph-matching-for-pre-training-graph","slug":"neural-graph-matching-for-pre-training-graph","title":"Neural Graph Matching for Pre-training Graph Neural Networks","date":"2022-03-03","arxiv_id":"2203.01597","repositories_listed":1,"syntology":null}],"syntology_records":22,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":35,"papers_where_code_ran_first_page":"/task/graph-matching/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/graph-matching/papers/2","json":"/task/graph-matching/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/graph-matching/papers/3","json":"/task/graph-matching/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/graph-matching/papers/4","json":"/task/graph-matching/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/graph-matching/papers/5","json":"/task/graph-matching/papers/5.json","rows":77},{"order":"ran","page":1,"of":1,"url":"/task/graph-matching/papers/ran/1","json":"/task/graph-matching/papers/ran/1.json","rows":35}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"7885d11f622e6bea062b089dc845f1c4be255e20ab05910d5715b99849c28b81","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}