{"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/featurel2norm","entry":"featureL2Norm","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":7,"n_papers_ran":7,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2203.04279","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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"code_sha256_prefix":"8aa4dc35337276eb","mcp_get_code":{"code_sha256":"8aa4dc35337276eb"}},{"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"cf9656ffec66503c","mcp_get_code":{"code_sha256":"cf9656ffec66503c"}},{"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/model.py","file_url":"https://github.com/ignacio-rocco/sparse-ncnet/blob/HEAD/lib/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf9656ffec66503c","mcp_get_code":{"code_sha256":"cf9656ffec66503c"}},{"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/model.py","file_url":"https://github.com/ActiveVisionLab/ANCNet/blob/HEAD/lib/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"cf9656ffec66503c","mcp_get_code":{"code_sha256":"cf9656ffec66503c"}},{"arxiv_id":"1909.11895","paper":"/paper/joint-task-self-supervised-learning-for","title":"Joint-task Self-supervised Learning for Temporal Correspondence","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liusifei/UVC","path":"libs/net_utils.py","file_url":"https://github.com/Liusifei/UVC/blob/HEAD/libs/net_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf9656ffec66503c","mcp_get_code":{"code_sha256":"cf9656ffec66503c"}},{"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/-Joint-Learning-of-Feature-Extraction-and-Cost-Aggregation-for-Semantic-Matching","path":"trash/train_pixelCT_mask_comb_FB_check_and_score1.py","file_url":"https://github.com/JiwonCocoder/-Joint-Learning-of-Feature-Extraction-and-Cost-Aggregation-for-Semantic-Matching/blob/HEAD/trash/train_pixelCT_mask_comb_FB_check_and_score1.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf9656ffec66503c","mcp_get_code":{"code_sha256":"cf9656ffec66503c"}},{"arxiv_id":"1703.05593","paper":"/paper/convolutional-neural-network-architecture-for","title":"Convolutional neural network architecture for geometric matching","date":"2017-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignacio-rocco/cnngeometric_pytorch","path":"model/cnn_geometric_model.py","file_url":"https://github.com/ignacio-rocco/cnngeometric_pytorch/blob/HEAD/model/cnn_geometric_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf9656ffec66503c","mcp_get_code":{"code_sha256":"cf9656ffec66503c"}}]}