{"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/normalize-axis","entry":"normalize_axis","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":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":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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":"2605.08455","paper":"/paper/arxiv-2605-08455","title":"CUDABeaver: Benchmarking LLM-Based Automated CUDA Debugging","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HaoyangChen23/CUDABeaver","path":"analysis/axis_normalize.py","file_url":"https://github.com/HaoyangChen23/CUDABeaver/blob/HEAD/analysis/axis_normalize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f265eefafc9c09e8","mcp_get_code":{"code_sha256":"f265eefafc9c09e8"}},{"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/point_tnf.py","file_url":"https://github.com/ignacio-rocco/sparse-ncnet/blob/HEAD/lib/point_tnf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2fa12cb30a255583","mcp_get_code":{"code_sha256":"2fa12cb30a255583"}},{"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/point_tnf.py","file_url":"https://github.com/ActiveVisionLab/ANCNet/blob/HEAD/lib/point_tnf.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":"2fa12cb30a255583","mcp_get_code":{"code_sha256":"2fa12cb30a255583"}},{"arxiv_id":"1910.06379","paper":"/paper/dual-path-rnn-efficient-long-sequence","title":"Dual-path RNN: efficient long sequence modeling for time-domain single-channel speech separation","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fgnt/padertorch","path":"padertorch/utils.py","file_url":"https://github.com/fgnt/padertorch/blob/HEAD/padertorch/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f947a5b97bfeeae2","mcp_get_code":{"code_sha256":"f947a5b97bfeeae2"}},{"arxiv_id":"1905.00562","paper":"/paper/disciplined-quasiconvex-programming","title":"Disciplined Quasiconvex Programming","date":null,"month_inferred_from_arxiv_id":"2019-05","title_source":"archive","repo":"cvxgrp/cvxpy","path":"cvxpy/atoms/axis_atom.py","file_url":"https://github.com/cvxgrp/cvxpy/blob/HEAD/cvxpy/atoms/axis_atom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7ad6d8a61eb6d817","mcp_get_code":{"code_sha256":"7ad6d8a61eb6d817"}},{"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/point_tnf.py","file_url":"https://github.com/JiwonCocoder/matching1/blob/HEAD/lib/point_tnf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2fa12cb30a255583","mcp_get_code":{"code_sha256":"2fa12cb30a255583"}},{"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":"geotnf/point_tnf.py","file_url":"https://github.com/ignacio-rocco/cnngeometric_pytorch/blob/HEAD/geotnf/point_tnf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2fa12cb30a255583","mcp_get_code":{"code_sha256":"2fa12cb30a255583"}}]}