{"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","name":"SPair-71k","full_name":null,"description_markdown":"SPair-71k contains 70,958 image pairs with diverse variations in viewpoint and scale. Compared to previous datasets, it is significantly larger in number and contains more accurate and richer annotations. \r\n\r\nSource: [SPair-71k: A Large-scale Benchmark for Semantic Correspondence](/paper/spair-71k-a-large-scale-benchmark-for)\r\nImage Source: [http://cvlab.postech.ac.kr/research/SPair-71k/](http://cvlab.postech.ac.kr/research/SPair-71k/)","description_withheld":null,"homepage":"http://cvlab.postech.ac.kr/research/SPair-71k/","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":"/paper/spair-71k-a-large-scale-benchmark-for","title":"SPair-71k: A Large-scale Benchmark for Semantic Correspondence","first_author":"Juhong Min","url":null},"license":null,"modalities":[{"name":"Images","url":"/datasets/modality/images"}],"tasks":[{"name":"Object Detection","url":"/task/object-detection","datasets_with_task":"/datasets/task/object-detection"},{"name":"Semantic correspondence","url":"/task/semantic-correspondence","datasets_with_task":"/datasets/task/semantic-correspondence"},{"name":"Graph Matching","url":"/task/graph-matching","datasets_with_task":"/datasets/task/graph-matching"},{"name":"Colorization","url":"/task/colorization","datasets_with_task":"/datasets/task/colorization"}],"languages":[],"variants":["SPair-71k"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/0jl/SPair-71k","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":71,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/semantic-correspondence-on-spair-71k","task":"Semantic correspondence","dataset_variant":"SPair-71k","rows":22,"metrics":["PCK"],"first_row_in_archive_order":{"model":"GeoAware-SC (Supervised, AP-10K P.T.)","paper":"/paper/telling-left-from-right-identifying-geometry","metrics":{"PCK":"85.6"},"code_links":[{"title":"Junyi42/geoaware-sc","url":"https://github.com/Junyi42/geoaware-sc"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-matching-on-spair-71k","task":"Graph Matching","dataset_variant":"SPair-71k","rows":8,"metrics":["matching accuracy"],"first_row_in_archive_order":{"model":"CREAM","paper":"/paper/cross-modal-retrieval-with-noisy","metrics":{"matching accuracy":"0.851"},"code_links":[{"title":"XLearning-SCU/2024-TIP-CREAM","url":"https://github.com/XLearning-SCU/2024-TIP-CREAM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","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,"shown":23,"of":23,"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"},"items":[{"paper":"/paper/semantic-correspondence-unified-benchmarking","slug":"semantic-correspondence-unified-benchmarking","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","date":"2025-05-23","arxiv_id":"2505.18060","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"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":3,"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/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,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"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":8,"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/gmtr-graph-matching-transformers","slug":"gmtr-graph-matching-transformers","title":"GMTR: Graph Matching Transformers","date":"2023-11-14","arxiv_id":"2311.08141","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-tale-of-two-features-stable-diffusion","slug":"a-tale-of-two-features-stable-diffusion","title":"A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence","date":"2023-05-24","arxiv_id":"2305.15347","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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-10-05T00:36:11+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/integrative-feature-and-cost-aggregation-with","slug":"integrative-feature-and-cost-aggregation-with","title":"Integrative Feature and Cost Aggregation with Transformers for Dense Correspondence","date":"2022-09-19","arxiv_id":"2209.08742","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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-10-05T00:36:11+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/transformatcher-match-to-match-attention-for","slug":"transformatcher-match-to-match-attention-for","title":"TransforMatcher: Match-to-Match Attention for Semantic Correspondence","date":"2022-05-23","arxiv_id":"2205.11634","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cats-boosting-cost-aggregation-with","slug":"cats-boosting-cost-aggregation-with","title":"CATs++: Boosting Cost Aggregation with Convolutions and Transformers","date":"2022-02-14","arxiv_id":"2202.06817","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cost-aggregation-is-all-you-need-for-few-shot","slug":"cost-aggregation-is-all-you-need-for-few-shot","title":"Cost Aggregation Is All You Need for Few-Shot Segmentation","date":"2021-12-22","arxiv_id":"2112.11685","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/multi-scale-matching-networks-for-semantic","slug":"multi-scale-matching-networks-for-semantic","title":"Multi-scale Matching Networks for Semantic Correspondence","date":"2021-07-31","arxiv_id":"2108.00211","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/semantic-correspondence-with-transformers","slug":"semantic-correspondence-with-transformers","title":"CATs: Cost Aggregation Transformers for Visual Correspondence","date":"2021-06-04","arxiv_id":"2106.02520","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/convolutional-hough-matching-networks","slug":"convolutional-hough-matching-networks","title":"Convolutional Hough Matching Networks","date":"2021-03-31","arxiv_id":"2103.16831","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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/semantic-correspondence-as-an-optimal","slug":"semantic-correspondence-as-an-optimal","title":"Semantic Correspondence as an Optimal Transport Problem","date":"2020-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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-10-05T00:36:11+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/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","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/semantic-correspondence-unified-benchmarking","slug":"semantic-correspondence-unified-benchmarking","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","date":"2025-05-23","arxiv_id":"2505.18060","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"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":3,"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/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,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"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":8,"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/gmtr-graph-matching-transformers","slug":"gmtr-graph-matching-transformers","title":"GMTR: Graph Matching Transformers","date":"2023-11-14","arxiv_id":"2311.08141","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-tale-of-two-features-stable-diffusion","slug":"a-tale-of-two-features-stable-diffusion","title":"A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence","date":"2023-05-24","arxiv_id":"2305.15347","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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-10-05T00:36:11+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/integrative-feature-and-cost-aggregation-with","slug":"integrative-feature-and-cost-aggregation-with","title":"Integrative Feature and Cost Aggregation with Transformers for Dense Correspondence","date":"2022-09-19","arxiv_id":"2209.08742","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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-10-05T00:36:11+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/transformatcher-match-to-match-attention-for","slug":"transformatcher-match-to-match-attention-for","title":"TransforMatcher: Match-to-Match Attention for Semantic Correspondence","date":"2022-05-23","arxiv_id":"2205.11634","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cats-boosting-cost-aggregation-with","slug":"cats-boosting-cost-aggregation-with","title":"CATs++: Boosting Cost Aggregation with Convolutions and Transformers","date":"2022-02-14","arxiv_id":"2202.06817","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cost-aggregation-is-all-you-need-for-few-shot","slug":"cost-aggregation-is-all-you-need-for-few-shot","title":"Cost Aggregation Is All You Need for Few-Shot Segmentation","date":"2021-12-22","arxiv_id":"2112.11685","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/multi-scale-matching-networks-for-semantic","slug":"multi-scale-matching-networks-for-semantic","title":"Multi-scale Matching Networks for Semantic Correspondence","date":"2021-07-31","arxiv_id":"2108.00211","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/semantic-correspondence-with-transformers","slug":"semantic-correspondence-with-transformers","title":"CATs: Cost Aggregation Transformers for Visual Correspondence","date":"2021-06-04","arxiv_id":"2106.02520","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/convolutional-hough-matching-networks","slug":"convolutional-hough-matching-networks","title":"Convolutional Hough Matching Networks","date":"2021-03-31","arxiv_id":"2103.16831","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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/semantic-correspondence-as-an-optimal","slug":"semantic-correspondence-as-an-optimal","title":"Semantic Correspondence as an Optimal Transport Problem","date":"2020-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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-10-05T00:36:11+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/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","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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-10-05T00:36:11+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"}}}}],"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/dataset/spair-71k/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/spair-71k/papers/ran/1","json":"/dataset/spair-71k/papers/ran/1.json","rows":9}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":9,"samples_harvested":100,"samples_ran":79,"samples_constructed":7,"samples_ran_checked":57,"samples_ran_instrument_failed":22,"samples_unverified":21,"pointer_only_for_licence":36,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":9,"papers_with_a_run_with_no_instrument_failure":9,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"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)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/semantic-correspondence-on-spair-71k","since_archive":"/sota/semantic-correspondence-on-spair-71k#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"f7b4eb4767051f6fd3a3b873a814684550d81ef6b778bdd6e8eb042145b8ba9a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}