{"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/papers/2","list_of":"/task/graph-matching","task":"Graph Matching","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":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"},"first_page":"/task/graph-matching","prev":"/task/graph-matching","next":"/task/graph-matching/papers/3","papers":[{"url":"/paper/training-free-graph-neural-networks-for-graph","slug":"training-free-graph-neural-networks-for-graph","title":"Training Free Graph Neural Networks for Graph Matching","date":"2022-01-14","arxiv_id":"2201.05349","repositories_listed":1,"syntology":null},{"url":"/paper/appearance-and-structure-aware-robust-deep","slug":"appearance-and-structure-aware-robust-deep","title":"Appearance and Structure Aware Robust Deep Visual Graph Matching: Attack, Defense and Beyond","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-context-attention-networks-for-size","slug":"graph-context-attention-networks-for-size","title":"Graph-Context Attention Networks for Size-Varied Deep Graph Matching","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bilateral-cross-modality-graph-matching","slug":"bilateral-cross-modality-graph-matching","title":"Bilateral Cross-Modality Graph Matching Attention for Feature Fusion in Visual Question Answering","date":"2021-12-14","arxiv_id":"2112.07270","repositories_listed":1,"syntology":null},{"url":"/paper/robust-partial-to-partial-point-cloud","slug":"robust-partial-to-partial-point-cloud","title":"Robust Partial-to-Partial Point Cloud Registration in a Full Range","date":"2021-11-30","arxiv_id":"2111.15606","repositories_listed":1,"syntology":null},{"url":"/paper/independent-se-3-equivariant-models-for-end-1","slug":"independent-se-3-equivariant-models-for-end-1","title":"Independent SE(3)-Equivariant Models for End-to-End Rigid Protein Docking","date":"2021-11-15","arxiv_id":"2111.07786","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/independent-se-3-equivariant-models-for-end-1#ran","syntology_url":"https://syntology.ai/paper/2111.07786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07786"}},"official":{"repos":["octavian-ganea/equidock_public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-matching-via-optimal-transport","slug":"graph-matching-via-optimal-transport","title":"Graph Matching via Optimal Transport","date":"2021-11-09","arxiv_id":"2111.05366","repositories_listed":1,"syntology":null},{"url":"/paper/jentab-meets-semtab-2021-s-new-challenges","slug":"jentab-meets-semtab-2021-s-new-challenges","title":"JenTab Meets SemTab 2021's New Challenges","date":"2021-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/magic-mining-an-augmented-graph-using-ink","slug":"magic-mining-an-augmented-graph-using-ink","title":"MAGIC: Mining an Augmented Graph using INK, starting from a CSV","date":"2021-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-analysis-of-euclidean-vs-graph-based","slug":"an-analysis-of-euclidean-vs-graph-based","title":"An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces","date":"2021-09-26","arxiv_id":"2109.12640","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-match-features-with-seeded-graph","slug":"learning-to-match-features-with-seeded-graph","title":"Learning to Match Features with Seeded Graph Matching Network","date":"2021-08-19","arxiv_id":"2108.08771","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-local-and-global-scene-graph-matching","slug":"a-deep-local-and-global-scene-graph-matching","title":"A Deep Local and Global Scene-Graph Matching for Image-Text Retrieval","date":"2021-06-04","arxiv_id":"2106.02400","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-iterative-graph-matching","slug":"stochastic-iterative-graph-matching","title":"Stochastic Iterative Graph Matching","date":"2021-06-04","arxiv_id":"2106.02206","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-iterative-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2106.02206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02206"}},"official":null}},{"url":"/paper/neural-graph-matching-based-collaborative","slug":"neural-graph-matching-based-collaborative","title":"Neural Graph Matching based Collaborative Filtering","date":"2021-05-10","arxiv_id":"2105.04067","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-invariant-variational-autoencoder","slug":"permutation-invariant-variational-autoencoder","title":"Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learning","date":"2021-04-20","arxiv_id":"2104.09856","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-invariant-subgraph-discovery","slug":"permutation-invariant-subgraph-discovery","title":"Permutation-Invariant Subgraph Discovery","date":"2021-04-02","arxiv_id":"2104.01063","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-graph-matching-incorporating-graph","slug":"learnable-graph-matching-incorporating-graph","title":"Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking","date":"2021-03-30","arxiv_id":"2103.16178","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":1,"n_ran_checked":3,"n_instrument":7,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":12,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learnable-graph-matching-incorporating-graph#ran","syntology_url":"https://syntology.ai/paper/2103.16178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16178"}},"official":{"repos":["jiaweihe1996/GMTracker"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/sequential-end-to-end-network-for-efficient","slug":"sequential-end-to-end-network-for-efficient","title":"Sequential End-to-end Network for Efficient Person Search","date":"2021-03-18","arxiv_id":"2103.10148","repositories_listed":1,"syntology":null},{"url":"/paper/deep-graph-matching-under-quadratic","slug":"deep-graph-matching-under-quadratic","title":"Deep Graph Matching under Quadratic Constraint","date":"2021-03-11","arxiv_id":"2103.06643","repositories_listed":1,"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/deep-graph-matching-under-quadratic#ran","syntology_url":"https://syntology.ai/paper/2103.06643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06643"}},"official":{"repos":["Zerg-Overmind/QC-DGM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bbw-matching-csv-to-wikidata-via-meta-lookup","slug":"bbw-matching-csv-to-wikidata-via-meta-lookup","title":"bbw: Matching CSV to Wikidata via Meta-lookup","date":"2021-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-generation-variational-bayes-on","slug":"knowledge-generation-variational-bayes-on","title":"Knowledge Generation -- Variational Bayes on Knowledge Graphs","date":"2021-01-21","arxiv_id":"2101.08857","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-neural-networks-for-hypergraph","slug":"hypergraph-neural-networks-for-hypergraph","title":"Hypergraph Neural Networks for Hypergraph Matching","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/layoutgmn-neural-graph-matching-for","slug":"layoutgmn-neural-graph-matching-for","title":"LayoutGMN: Neural Graph Matching for Structural Layout Similarity","date":"2020-12-11","arxiv_id":"2012.06547","repositories_listed":1,"syntology":null},{"url":"/paper/cross-modal-registration-using-point-clouds","slug":"cross-modal-registration-using-point-clouds","title":"Cross-modal registration using point clouds and graph-matching in the context of correlative microscopies","date":"2020-12-01","arxiv_id":"2012.00656","repositories_listed":1,"syntology":null},{"url":"/paper/graduated-assignment-for-joint-multi-graph","slug":"graduated-assignment-for-joint-multi-graph","title":"Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/vlg-net-video-language-graph-matching-network","slug":"vlg-net-video-language-graph-matching-network","title":"VLG-Net: Video-Language Graph Matching Network for Video Grounding","date":"2020-11-19","arxiv_id":"2011.10132","repositories_listed":1,"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":0,"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/vlg-net-video-language-graph-matching-network#ran","syntology_url":"https://syntology.ai/paper/2011.10132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.10132"}},"official":null}},{"url":"/paper/dslib-an-open-source-library-for-the-dominant","slug":"dslib-an-open-source-library-for-the-dominant","title":"DSLib: An open source library for the dominant set clustering method","date":"2020-10-15","arxiv_id":"2010.07906","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-graph-based-place-recognition-for-3d","slug":"semantic-graph-based-place-recognition-for-3d","title":"Semantic Graph Based Place Recognition for 3D Point Clouds","date":"2020-08-26","arxiv_id":"2008.11459","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semantic-graph-based-place-recognition-for-3d#ran","syntology_url":"https://syntology.ai/paper/2008.11459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.11459"}},"official":{"repos":["kxhit/SG_PR"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-graph-matching-via-blackbox-1","slug":"deep-graph-matching-via-blackbox-1","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/layered-neighborhood-expansion-for","slug":"layered-neighborhood-expansion-for","title":"Layered Neighborhood Expansion for Incremental Multiple Graph Matching","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/flot-scene-flow-on-point-clouds-guided-by","slug":"flot-scene-flow-on-point-clouds-guided-by","title":"FLOT: Scene Flow on Point Clouds Guided by Optimal Transport","date":"2020-07-22","arxiv_id":"2007.11142","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/flot-scene-flow-on-point-clouds-guided-by#ran","syntology_url":"https://syntology.ai/paper/2007.11142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11142"}},"official":{"repos":["valeoai/FLOT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/hierarchical-graph-matching-networks-for-deep-1","slug":"hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","arxiv_id":"2007.04395","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/hierarchical-graph-matching-networks-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2007.04395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04395"}},"official":{"repos":["kleincup/MGMN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-learning-of-robust-deep-graph","slug":"combinatorial-learning-of-robust-deep-graph","title":"Combinatorial Learning of Robust Deep Graph Matching: an Embedding based Approach.","date":"2020-06-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-optimal-transport-for-cross-domain","slug":"graph-optimal-transport-for-cross-domain","title":"Graph Optimal Transport for Cross-Domain Alignment","date":"2020-06-26","arxiv_id":"2006.14744","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":6,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-optimal-transport-for-cross-domain#ran","syntology_url":"https://syntology.ai/paper/2006.14744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14744"}},"official":{"repos":["LiqunChen0606/Graph-Optimal-Transport"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-matching-with-partially-correct-seeds","slug":"graph-matching-with-partially-correct-seeds","title":"Graph Matching with Partially-Correct Seeds","date":"2020-04-08","arxiv_id":"2004.03816","repositories_listed":1,"syntology":null},{"url":"/paper/pose-guided-visible-part-matching-for","slug":"pose-guided-visible-part-matching-for","title":"Pose-guided Visible Part Matching for Occluded Person ReID","date":"2020-04-01","arxiv_id":"2004.00230","repositories_listed":1,"syntology":null},{"url":"/paper/zero-assignment-constraint-for-graph-matching","slug":"zero-assignment-constraint-for-graph-matching","title":"Zero-Assignment Constraint for Graph Matching with Outliers","date":"2020-03-26","arxiv_id":"2003.11928","repositories_listed":1,"syntology":null},{"url":"/paper/learning-cross-modal-context-graph-for-visual","slug":"learning-cross-modal-context-graph-for-visual","title":"Learning Cross-modal Context Graph for Visual Grounding","date":"2020-02-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-robust-comparison-of-probability","slug":"fast-and-robust-comparison-of-probability","title":"Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces","date":"2020-02-05","arxiv_id":"2002.01615","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-robust-comparison-of-probability#ran","syntology_url":"https://syntology.ai/paper/2002.01615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01615"}},"official":{"repos":["joisino/anchor-energy"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-matching-between-bipartite-and","slug":"graph-matching-between-bipartite-and","title":"Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question","date":"2020-02-05","arxiv_id":"2002.01648","repositories_listed":1,"syntology":null},{"url":"/paper/neural-graph-matching-network-learning","slug":"neural-graph-matching-network-learning","title":"Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching","date":"2019-11-26","arxiv_id":"1911.11308","repositories_listed":1,"syntology":null},{"url":"/paper/kergm-kernelized-graph-matching-1","slug":"kergm-kernelized-graph-matching-1","title":"KerGM: Kernelized Graph Matching","date":"2019-11-25","arxiv_id":"1911.11120","repositories_listed":1,"syntology":null},{"url":"/paper/unlabeled-sensing-with-local-permutations","slug":"unlabeled-sensing-with-local-permutations","title":"R-local unlabeled sensing: A novel graph matching approach for multiview unlabeled sensing under local permutations","date":"2019-11-14","arxiv_id":"1911.06382","repositories_listed":1,"syntology":null},{"url":"/paper/cross-modal-scene-graph-matching-for","slug":"cross-modal-scene-graph-matching-for","title":"Cross-modal Scene Graph Matching for Relationship-aware Image-Text Retrieval","date":"2019-10-11","arxiv_id":"1910.05134","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cross-modal-scene-graph-matching-for#ran","syntology_url":"https://syntology.ai/paper/1910.05134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05134"}},"official":null}},{"url":"/paper/190909901","slug":"190909901","title":"Learning a Fixed-Length Fingerprint Representation","date":"2019-09-21","arxiv_id":"1909.09901","repositories_listed":1,"syntology":null},{"url":"/paper/sdrsac-semidefinite-based-randomized-approach-1","slug":"sdrsac-semidefinite-based-randomized-approach-1","title":"SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration Without Correspondences","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cross-lingual-knowledge-graph-alignment-via-1","slug":"cross-lingual-knowledge-graph-alignment-via-1","title":"Cross-lingual Knowledge Graph Alignment via Graph Matching Neural Network","date":"2019-05-28","arxiv_id":"1905.11605","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-gromov-wasserstein-learning-for","slug":"scalable-gromov-wasserstein-learning-for","title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","date":"2019-05-18","arxiv_id":"1905.07645","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-gromov-wasserstein-learning-for#ran","syntology_url":"https://syntology.ai/paper/1905.07645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07645"}},"official":{"repos":["HongtengXu/s-gwl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sdrsac-semidefinite-based-randomized-approach","slug":"sdrsac-semidefinite-based-randomized-approach","title":"SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration without Correspondences","date":"2019-04-06","arxiv_id":"1904.03483","repositories_listed":1,"syntology":null},{"url":"/paper/learning-combinatorial-embedding-networks-for","slug":"learning-combinatorial-embedding-networks-for","title":"Learning Combinatorial Embedding Networks for Deep Graph Matching","date":"2019-04-01","arxiv_id":"1904.00597","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-on-attributed-graphs-a-journey","slug":"deep-learning-on-attributed-graphs-a-journey","title":"Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back","date":"2019-01-24","arxiv_id":"1901.08296","repositories_listed":1,"syntology":null},{"url":"/paper/a-functional-representation-for-graph","slug":"a-functional-representation-for-graph","title":"A Functional Representation for Graph Matching","date":"2019-01-16","arxiv_id":"1901.05179","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-random-graph-matching-via-degree","slug":"efficient-random-graph-matching-via-degree","title":"Efficient random graph matching via degree profiles","date":"2018-11-19","arxiv_id":"1811.07821","repositories_listed":1,"syntology":null},{"url":"/paper/3d-path-planning-from-a-single-2d","slug":"3d-path-planning-from-a-single-2d","title":"3D Path Planning from a Single 2D Fluoroscopic Image for Robot Assisted Fenestrated Endovascular Aortic Repair","date":"2018-09-16","arxiv_id":"1809.05955","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-fast","slug":"convolutional-neural-networks-for-fast","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","date":"2018-09-10","arxiv_id":"1809.04440","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-hierarchical-graph-based","slug":"efficient-hierarchical-graph-based","title":"Efficient Hierarchical Graph-Based Segmentation of RGBD Videos","date":"2018-01-26","arxiv_id":"1801.08981","repositories_listed":1,"syntology":null},{"url":"/paper/neural-network-based-graph-embedding-for","slug":"neural-network-based-graph-embedding-for","title":"Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection","date":"2017-08-22","arxiv_id":"1708.06525","repositories_listed":1,"syntology":null},{"url":"/paper/a-dual-ascent-framework-for-lagrangean","slug":"a-dual-ascent-framework-for-lagrangean","title":"A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems","date":"2016-12-16","arxiv_id":"1612.05460","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-of-lagrangean-decompositions-and-dual","slug":"a-study-of-lagrangean-decompositions-and-dual","title":"A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching","date":"2016-12-16","arxiv_id":"1612.05476","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-clustering-for-divide-and-conquer","slug":"spectral-clustering-for-divide-and-conquer","title":"Spectral Clustering for Divide-and-Conquer Graph Matching","date":"2013-10-04","arxiv_id":"1310.1297","repositories_listed":1,"syntology":null},{"url":"/paper/smatch-an-evaluation-metric-for-semantic","slug":"smatch-an-evaluation-metric-for-semantic","title":"Smatch: an Evaluation Metric for Semantic Feature Structures","date":"2013-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-projected-fixed-point-algorithm-for","slug":"a-fast-projected-fixed-point-algorithm-for","title":"A Fast Projected Fixed-Point Algorithm for Large Graph Matching","date":"2012-07-03","arxiv_id":"1207.1114","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-fast-projected-fixed-point-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/1207.1114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1207.1114"}},"official":null}},{"url":null,"slug":"improving-chemical-understanding-of-llms-via","title":"Improving Chemical Understanding of LLMs via SMILES Parsing","date":"2025-05-22","arxiv_id":"2505.16340","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-modal-knowledge-transfer-learning-as","title":"Cross-modal Knowledge Transfer Learning as Graph Matching Based on Optimal Transport for ASR","date":"2025-05-19","arxiv_id":"2505.13079","repositories_listed":0,"syntology":null},{"url":null,"slug":"tempo-application-aware-llm-serving-with","title":"Tempo: Application-aware LLM Serving with Mixed SLO Requirements","date":"2025-04-24","arxiv_id":"2504.20068","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-network-modeling-techniques-for","title":"Graph Network Modeling Techniques for Visualizing Human Mobility Patterns","date":"2025-04-04","arxiv_id":"2504.03119","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridge-the-gap-between-visual-and-linguistic","title":"Bridge the Gap Between Visual and Linguistic Comprehension for Generalized Zero-shot Semantic Segmentation","date":"2025-03-31","arxiv_id":"2503.23806","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffged-computing-graph-edit-distance-via","title":"DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching","date":"2025-03-24","arxiv_id":"2503.18245","repositories_listed":0,"syntology":null},{"url":null,"slug":"unigoal-towards-universal-zero-shot-goal","title":"UniGoal: Towards Universal Zero-shot Goal-oriented Navigation","date":"2025-03-13","arxiv_id":"2503.10630","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-unsupervised-annotation-of-c-elegans","title":"Fully Unsupervised Annotation of C. Elegans","date":"2025-03-10","arxiv_id":"2503.07348","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-detection-of-overlapping-bioacoustic","title":"Robust detection of overlapping bioacoustic sound events","date":"2025-03-04","arxiv_id":"2503.02389","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-graph-matching-improves-retrieval","title":"Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning","date":"2025-02-25","arxiv_id":"2502.17874","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-ontology-matching-with-large-language","title":"Complex Ontology Matching with Large Language Model Embeddings","date":"2025-02-19","arxiv_id":"2502.13619","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-matching-in-correlated-networks-with","title":"Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery","date":"2025-01-06","arxiv_id":"2501.02851","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-optimizing-large-scale-multi-graph","title":"Towards Optimizing Large-Scale Multi-Graph Matching in Bioimaging","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-random-graph-matching-in-dense-graphs","title":"Robust random graph matching in Gaussian models via vector approximate message passing","date":"2024-12-21","arxiv_id":"2412.16457","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-communities-to-interpretable-network-and","title":"From communities to interpretable network and word embedding: an unified approach","date":"2024-12-11","arxiv_id":"2412.08187","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-graph-matching-for-correlated","title":"Efficient Graph Matching for Correlated Stochastic Block Models","date":"2024-12-03","arxiv_id":"2412.02661","repositories_listed":0,"syntology":null},{"url":null,"slug":"harnessing-multiple-correlated-networks-for","title":"Harnessing Multiple Correlated Networks for Exact Community Recovery","date":"2024-12-03","arxiv_id":"2412.02796","repositories_listed":0,"syntology":null},{"url":null,"slug":"segmn-a-structure-enhanced-graph-matching","title":"SEGMN: A Structure-Enhanced Graph Matching Network for Graph Similarity Learning","date":"2024-11-06","arxiv_id":"2411.03624","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-partial-graph-matching","title":"Learning Partial Graph Matching via Optimal Partial Transport","date":"2024-10-22","arxiv_id":"2410.16718","repositories_listed":0,"syntology":null},{"url":null,"slug":"clip-clique-graph-based-correspondence","title":"CLIP-Clique: Graph-based Correspondence Matching Augmented by Vision Language Models for Object-based Global Localization","date":"2024-10-04","arxiv_id":"2410.03054","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-alignment-of-histopathological","title":"Multimodal Alignment of Histopathological Images Using Cell Segmentation and Point Set Matching for Integrative Cancer Analysis","date":"2024-09-30","arxiv_id":"2410.00152","repositories_listed":0,"syntology":null},{"url":null,"slug":"open-set-semantic-uncertainty-aware-metric","title":"Open-Set Semantic Uncertainty Aware Metric-Semantic Graph Matching","date":"2024-09-17","arxiv_id":"2409.11555","repositories_listed":0,"syntology":null},{"url":null,"slug":"contactless-fingerprint-recognition-using-3d","title":"Contactless Fingerprint Recognition Using 3D Graph Matching","date":"2024-09-13","arxiv_id":"2409.08782","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-structural-and-featural","title":"Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation","date":"2024-08-22","arxiv_id":"2408.12659","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-00981","title":"Cross-domain Named Entity Recognition via Graph Matching","date":"2024-08-02","arxiv_id":"2408.00981","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-graph-matching-for-video-retrieval-in","title":"Neural Graph Matching for Video Retrieval in Large-Scale Video-driven E-commerce","date":"2024-08-01","arxiv_id":"2408.00346","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-research-of-group-re-identification-from","title":"The Research of Group Re-identification from Multiple Cameras","date":"2024-07-19","arxiv_id":"2407.14620","repositories_listed":0,"syntology":null},{"url":null,"slug":"funcevalgmn-evaluating-functional-correctness","title":"FuncEvalGMN: Evaluating Functional Correctness of SQL via Graph Matching Network","date":"2024-07-09","arxiv_id":"2407.14530","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-general-graph-matching-with","title":"Contrastive General Graph Matching with Adaptive Augmentation Sampling","date":"2024-06-25","arxiv_id":"2406.17199","repositories_listed":0,"syntology":null},{"url":null,"slug":"geodesic-distance-between-graphs-a-spectral","title":"Geodesic Distance Between Graphs: A Spectral Metric for Assessing the Stability of Graph Neural Networks","date":"2024-06-15","arxiv_id":"2406.10500","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-integer-programming","title":"A Unified Framework for Integer Programming Formulation of Graph Matching Problems","date":"2024-06-11","arxiv_id":"2406.07666","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-two-sample-test-for-block-models","title":"Network two-sample test for block models","date":"2024-06-10","arxiv_id":"2406.06014","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-similarity-score-for-measuring","title":"Semantic Similarity Score for Measuring Visual Similarity at Semantic Level","date":"2024-06-06","arxiv_id":"2406.03865","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastalign-toward-robust-bev-feature","title":"ContrastAlign: Toward Robust BEV Feature Alignment via Contrastive Learning for Multi-Modal 3D Object Detection","date":"2024-05-27","arxiv_id":"2405.16873","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-proximal-graph-matching","title":"Differentiable Proximal Graph Matching","date":"2024-05-26","arxiv_id":"2405.16479","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-interdiction-goes-neural","title":"Network Interdiction Goes Neural","date":"2024-05-26","arxiv_id":"2405.16409","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-player-tracking-in-ice-hockey-with","title":"Multi Player Tracking in Ice Hockey with Homographic Projections","date":"2024-05-22","arxiv_id":"2405.13397","repositories_listed":0,"syntology":null}],"record_sha256":"322194bfc0f7eaa1cb829ac586a77c035a5661b3101fdfcef887e96d164ce723","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}