{"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/tocuda","entry":"tocuda","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":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":3,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"1911.03809","paper":"/paper/meta-label-correction-for-learning-with-weak-1","title":"Meta Label Correction for Noisy Label Learning","date":"2019-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/mlc","path":"mlc_utils.py","file_url":"https://github.com/microsoft/mlc/blob/HEAD/mlc_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7fb2de38378a382","mcp_get_code":{"code_sha256":"d7fb2de38378a382"}},{"arxiv_id":"1606.00704","paper":"/paper/adversarially-learned-inference","title":"Adversarially Learned Inference","date":"2016-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"9310gaurav/ali-pytorch","path":"test_semisup.py","file_url":"https://github.com/9310gaurav/ali-pytorch/blob/HEAD/test_semisup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c59ce90932b89fbe","mcp_get_code":{"code_sha256":"c59ce90932b89fbe"}},{"arxiv_id":"aaai_25456","paper":null,"title":"arXiv:aaai_25456","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SuhZhang/ConvMatch","path":"core/utils.py","file_url":"https://github.com/SuhZhang/ConvMatch/blob/HEAD/core/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2873f59cb385a87d","mcp_get_code":{"code_sha256":"2873f59cb385a87d"}},{"arxiv_id":"Zhong_T-Net_Effective_Permutation-Equivariant_Network_for_Two-View_Correspondence_Learning_ICCV_2021_paper","paper":null,"title":"arXiv:Zhong_T-Net_Effective_Permutation-Equivariant_Network_for_Two-View_Correspondence_Learning_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"x-gb/T-Net","path":"utils.py","file_url":"https://github.com/x-gb/T-Net/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2873f59cb385a87d","mcp_get_code":{"code_sha256":"2873f59cb385a87d"}},{"arxiv_id":"Zhang_DeMatch_Deep_Decomposition_of_Motion_Field_for_Two-View_Correspondence_Learning_CVPR_2024_paper","paper":null,"title":"arXiv:Zhang_DeMatch_Deep_Decomposition_of_Motion_Field_for_Two-View_Correspondence_Learning_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SuhZhang/DeMatch","path":"core/utils.py","file_url":"https://github.com/SuhZhang/DeMatch/blob/HEAD/core/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2873f59cb385a87d","mcp_get_code":{"code_sha256":"2873f59cb385a87d"}},{"arxiv_id":"2022.naacl-main.64","paper":null,"title":"arXiv:2022.naacl-main.64","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/MLC","path":"mlc_utils.py","file_url":"https://github.com/microsoft/MLC/blob/HEAD/mlc_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7fb2de38378a382","mcp_get_code":{"code_sha256":"d7fb2de38378a382"}}]}