{"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/remove-nans","entry":"remove_nans","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":6,"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":1,"n_places":6,"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":"2308.08231","paper":null,"title":"arXiv:2308.08231","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":null,"repo":"ZhangCYG/DDFHO","path":"datasets/ddf_img.py","file_url":"https://github.com/ZhangCYG/DDFHO/blob/HEAD/datasets/ddf_img.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"64cfe9fb339c659b","mcp_get_code":{"code_sha256":"64cfe9fb339c659b"}},{"arxiv_id":"2303.14668","paper":"/paper/ceflow-a-robust-and-efficient-counterfactual","title":"CeFlow: A Robust and Efficient Counterfactual Explanation Framework for Tabular Data using Normalizing Flows","date":"2023-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tridungduong16/fairce","path":"src/carla/evaluation/process_nans.py","file_url":"https://github.com/tridungduong16/fairce/blob/HEAD/src/carla/evaluation/process_nans.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9514a2f24fa740e8","mcp_get_code":{"code_sha256":"9514a2f24fa740e8"}},{"arxiv_id":"2212.10847","paper":"/paper/vcnet-a-self-explaining-model-for-realistic","title":"VCNet: A self-explaining model for realistic counterfactual generation","date":"2022-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Orange-OpenSource/carla_croco_vcnet","path":"carla/evaluation/process_nans.py","file_url":"https://github.com/Orange-OpenSource/carla_croco_vcnet/blob/HEAD/carla/evaluation/process_nans.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94cef7815945f3ca","mcp_get_code":{"code_sha256":"94cef7815945f3ca"}},{"arxiv_id":"2203.06768","paper":"/paper/algorithmic-recourse-in-the-face-of-noisy","title":"Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse","date":"2022-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MartinPawel/ProbabilisticallyRobustRecourse","path":"carla/evaluation/process_nans.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/process_nans.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9514a2f24fa740e8","mcp_get_code":{"code_sha256":"9514a2f24fa740e8"}},{"arxiv_id":"2108.00783","paper":"/paper/carla-a-python-library-to-benchmark","title":"CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithms","date":"2021-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"indyfree/CARLA","path":"carla/evaluation/process_nans.py","file_url":"https://github.com/indyfree/CARLA/blob/HEAD/carla/evaluation/process_nans.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94cef7815945f3ca","mcp_get_code":{"code_sha256":"94cef7815945f3ca"}},{"arxiv_id":"2004.00614","paper":"/paper/articulation-aware-canonical-surface-mapping","title":"Articulation-aware Canonical Surface Mapping","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nileshkulkarni/acsm","path":"acsm/benchmark/pck_eval.py","file_url":"https://github.com/nileshkulkarni/acsm/blob/HEAD/acsm/benchmark/pck_eval.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":"63d8b60083ae8c04","mcp_get_code":{"code_sha256":"63d8b60083ae8c04"}}]}