{"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/ran/1","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,35],"of":35,"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/papers/ran/1","prev":null,"next":null,"papers":[{"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/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/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/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":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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) · 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":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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/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":8,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 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":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 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":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/q-fw-a-hybrid-classical-quantum-frank-wolfe","slug":"q-fw-a-hybrid-classical-quantum-frank-wolfe","title":"Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization","date":"2022-03-23","arxiv_id":"2203.12633","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/q-fw-a-hybrid-classical-quantum-frank-wolfe#ran","syntology_url":"https://syntology.ai/paper/2203.12633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12633"}},"official":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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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}}],"record_sha256":"afebc4f624a98ab237a866179bb99120d6a880a4e11b1f9a84d948be307bfce7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}