{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/conv4d","entry":"conv4d","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":0,"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":4,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":4},"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":"2009.07823","paper":"/paper/gocor-bringing-globally-optimized","title":"GOCor: Bringing Globally Optimized Correspondence Volumes into Your Neural Network","date":"2020-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PruneTruong/GLU-Net","path":"models/our_models/GLUNet.py","file_url":"https://github.com/PruneTruong/GLU-Net/blob/HEAD/models/our_models/GLUNet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"8407da62949de1ee","mcp_get_code":{"code_sha256":"8407da62949de1ee"}},{"arxiv_id":"2006.08844","paper":"/paper/dual-resolution-correspondence-networks","title":"Dual-Resolution Correspondence Networks","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/DualRC-Net","path":"lib/model_v2.py","file_url":"https://github.com/ActiveVisionLab/DualRC-Net/blob/HEAD/lib/model_v2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"b34a6df14efe752e","mcp_get_code":{"code_sha256":"b34a6df14efe752e"}},{"arxiv_id":"2004.10566","paper":"/paper/efficient-neighbourhood-consensus-networks","title":"Efficient Neighbourhood Consensus Networks via Submanifold Sparse Convolutions","date":"2020-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignacio-rocco/sparse-ncnet","path":"lib/conv4d.py","file_url":"https://github.com/ignacio-rocco/sparse-ncnet/blob/HEAD/lib/conv4d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3bb2c78a6431d327","mcp_get_code":{"code_sha256":"3bb2c78a6431d327"}},{"arxiv_id":"2003.12059","paper":"/paper/correspondence-networks-with-adaptive","title":"Correspondence Networks with Adaptive Neighbourhood Consensus","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/ANCNet","path":"lib/conv4d.py","file_url":"https://github.com/ActiveVisionLab/ANCNet/blob/HEAD/lib/conv4d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"577b36e957ab2484","mcp_get_code":{"code_sha256":"577b36e957ab2484"}},{"arxiv_id":"1810.10510","paper":"/paper/neighbourhood-consensus-networks","title":"Neighbourhood Consensus Networks","date":"2018-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiwonCocoder/matching1","path":"lib/conv4d.py","file_url":"https://github.com/JiwonCocoder/matching1/blob/HEAD/lib/conv4d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8407da62949de1ee","mcp_get_code":{"code_sha256":"8407da62949de1ee"}}]}