{"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/conv4d","entry":"conv4d","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":5,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":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":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":0,"ran":1,"unverified":3},"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":"2009.07823","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, PruneTruong/GLU-Net, is not in the permissive set Syntology serves inline","code_sha256":"8407da62949de1ee","code_sha256_prefix":"8407da62949de1ee","mcp_get_code":{"code_sha256":"8407da62949de1ee"}},{"arxiv_id":"2006.08844","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b34a6df14efe752e","code_sha256_prefix":"b34a6df14efe752e","mcp_get_code":{"code_sha256":"b34a6df14efe752e"}},{"arxiv_id":"2004.10566","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bb2c78a6431d327","code_sha256_prefix":"3bb2c78a6431d327","mcp_get_code":{"code_sha256":"3bb2c78a6431d327"}},{"arxiv_id":"2003.12059","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"577b36e957ab2484","code_sha256_prefix":"577b36e957ab2484","mcp_get_code":{"code_sha256":"577b36e957ab2484"}},{"arxiv_id":"1810.10510","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from PruneTruong/GLU-Net, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"8407da62949de1ee","code_sha256_prefix":"8407da62949de1ee","mcp_get_code":{"code_sha256":"8407da62949de1ee"}}],"record_sha256":"3f79db196cb62c71f4bf4b434276235a12e3416f48acb70751acdb8f80d2275b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}