{"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":"/code/correlation-2","entry":"Correlation","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":5,"n_samples_constructed":2,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":4,"unverified":1},"key_notes":{"n_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'","n_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2406.00123","arxiv_id_is_arxiv":true,"paper":"/paper/correlation-aware-coarse-to-fine-mlps-for","title":"Correlation-aware Coarse-to-fine MLPs for Deformable Medical Image Registration","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MungoMeng/Registration-CorrMLP","path":"CorrMLP/networks.py","file_url":"https://github.com/MungoMeng/Registration-CorrMLP/blob/HEAD/CorrMLP/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, MungoMeng/Registration-CorrMLP, is not in the permissive set Syntology serves inline","code_sha256":"644f45655c36ca6c","code_sha256_prefix":"644f45655c36ca6c","mcp_get_code":{"code_sha256":"644f45655c36ca6c"}},{"arxiv_id":"2308.06954","arxiv_id_is_arxiv":true,"paper":"/paper/global-features-are-all-you-need-for-image","title":"Global Features are All You Need for Image Retrieval and Reranking","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shihaoshao-gh/superglobal","path":"model/CVNet_Rerank_model.py","file_url":"https://github.com/shihaoshao-gh/superglobal/blob/HEAD/model/CVNet_Rerank_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6348d625e9ec5a11","code_sha256_prefix":"6348d625e9ec5a11","mcp_get_code":{"code_sha256":"6348d625e9ec5a11"}},{"arxiv_id":"2207.10866","arxiv_id_is_arxiv":true,"paper":"/paper/cost-aggregation-with-4d-convolutional-swin","title":"Cost Aggregation with 4D Convolutional Swin Transformer for Few-Shot Segmentation","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Seokju-Cho/Volumetric-Aggregation-Transformer","path":"model/vat.py","file_url":"https://github.com/Seokju-Cho/Volumetric-Aggregation-Transformer/blob/HEAD/model/vat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d957466bd907d3e2","code_sha256_prefix":"d957466bd907d3e2","mcp_get_code":{"code_sha256":"d957466bd907d3e2"}},{"arxiv_id":"2203.04279","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-warp-consistency-for-weakly","title":"Probabilistic Warp Consistency for Weakly-Supervised Semantic Correspondences","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PruneTruong/DenseMatching","path":"training/losses/probabilistic_warp_consistency_losses.py","file_url":"https://github.com/PruneTruong/DenseMatching/blob/HEAD/training/losses/probabilistic_warp_consistency_losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-2.1, as GitHub detects it on this paper's repository, PruneTruong/DenseMatching, is not in the permissive set Syntology serves inline","code_sha256":"2beec2454ea2317c","code_sha256_prefix":"2beec2454ea2317c","mcp_get_code":{"code_sha256":"2beec2454ea2317c"}},{"arxiv_id":"2108.00622","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-mask-refinement-for-few-shot","title":"Recurrent Mask Refinement for Few-Shot Medical Image Segmentation","date":"2021-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uci-cbcl/RP-Net","path":"net/rp_net.py","file_url":"https://github.com/uci-cbcl/RP-Net/blob/HEAD/net/rp_net.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, uci-cbcl/RP-Net when it was checked","code_sha256":"c85584d983655915","code_sha256_prefix":"c85584d983655915","mcp_get_code":{"code_sha256":"c85584d983655915"}},{"arxiv_id":"2003.12039","arxiv_id_is_arxiv":true,"paper":"/paper/raft-recurrent-all-pairs-field-transforms-for","title":"RAFT: Recurrent All-Pairs Field Transforms for Optical Flow","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"duke-vision/optical-flow-active-learning-release","path":"models/correlation_native.py","file_url":"https://github.com/duke-vision/optical-flow-active-learning-release/blob/HEAD/models/correlation_native.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1603237c32f607ff","code_sha256_prefix":"1603237c32f607ff","mcp_get_code":{"code_sha256":"1603237c32f607ff"}}],"record_sha256":"cdd7fb3966df4968a976b6b173263361e744ca2907f53a6c99329ce48bbee4d6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}