{"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":"/dataset/spair-71k/papers/ran/1","list_of":"/dataset/spair-71k","dataset":"SPair-71k","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_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'","samples_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)"},"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 dataset or check it against this dataset'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.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,9],"of":9,"counts":{"papers_with_a_benchmark_row":23,"with_a_code_link":22,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":23,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":0,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/spair-71k/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/cleandift-diffusion-features-without-noise","slug":"cleandift-diffusion-features-without-noise","title":"CleanDIFT: Diffusion Features without Noise","date":"2024-12-04","arxiv_id":"2412.03439","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["CompVis/cleandift"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cleandift-diffusion-features-without-noise#ran","syntology_url":"https://syntology.ai/paper/2412.03439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03439"}}}},{"paper":"/paper/telling-left-from-right-identifying-geometry","slug":"telling-left-from-right-identifying-geometry","title":"Telling Left from Right: Identifying Geometry-Aware Semantic Correspondence","date":"2023-11-28","arxiv_id":"2311.17034","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":15,"official":{"repos":["Junyi42/geoaware-sc"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/telling-left-from-right-identifying-geometry#ran","syntology_url":"https://syntology.ai/paper/2311.17034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17034"}}}},{"paper":"/paper/unsupervised-semantic-correspondence-using","slug":"unsupervised-semantic-correspondence-using","title":"Unsupervised Semantic Correspondence Using Stable Diffusion","date":"2023-05-24","arxiv_id":"2305.15581","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["ubc-vision/LDM_correspondences"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-semantic-correspondence-using#ran","syntology_url":"https://syntology.ai/paper/2305.15581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15581"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":6,"samples_unverified":0,"pointer_only_for_licence":7,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/cost-aggregation-with-4d-convolutional-swin","slug":"cost-aggregation-with-4d-convolutional-swin","title":"Cost Aggregation with 4D Convolutional Swin Transformer for Few-Shot Segmentation","date":"2022-07-22","arxiv_id":"2207.10866","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":20,"samples_ran":12,"samples_constructed":7,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":8,"pointer_only_for_licence":2,"official":{"repos":["Seokju-Cho/Volumetric-Aggregation-Transformer"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":7,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cost-aggregation-with-4d-convolutional-swin#ran","syntology_url":"https://syntology.ai/paper/2207.10866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10866"}}}},{"paper":"/paper/learning-to-compose-hypercolumns-for-visual","slug":"learning-to-compose-hypercolumns-for-visual","title":"Learning to Compose Hypercolumns for Visual Correspondence","date":"2020-07-21","arxiv_id":"2007.10587","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["juhongm999/dhpf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-compose-hypercolumns-for-visual#ran","syntology_url":"https://syntology.ai/paper/2007.10587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10587"}}}},{"paper":"/paper/correspondence-networks-with-adaptive","slug":"correspondence-networks-with-adaptive","title":"Correspondence Networks with Adaptive Neighbourhood Consensus","date":"2020-03-26","arxiv_id":"2003.12059","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["ActiveVisionLab/ANCNet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/correspondence-networks-with-adaptive#ran","syntology_url":"https://syntology.ai/paper/2003.12059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12059"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":5,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/hyperpixel-flow-semantic-correspondence-with","slug":"hyperpixel-flow-semantic-correspondence-with","title":"Hyperpixel Flow: Semantic Correspondence with Multi-layer Neural Features","date":"2019-08-18","arxiv_id":"1908.06537","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["juhongm999/hpf"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperpixel-flow-semantic-correspondence-with#ran","syntology_url":"https://syntology.ai/paper/1908.06537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06537"}}}}],"record_sha256":"ac589f49db297dba5796485f162f6ef17ad657037421679e032474db95c1c917","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}