{"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/loadmodel","entry":"LoadModel","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":5,"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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":4},"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":"2206.11104","paper":"/paper/openxai-towards-a-transparent-evaluation-of","title":"OpenXAI: Towards a Transparent Evaluation of Model Explanations","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4life-group/openxai","path":"openxai/model.py","file_url":"https://github.com/ai4life-group/openxai/blob/HEAD/openxai/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f7b5e5371682e42","mcp_get_code":{"code_sha256":"6f7b5e5371682e42"}},{"arxiv_id":"2110.02999","paper":"/paper/generative-modeling-with-optimal-transport","title":"Generative Modeling with Optimal Transport Maps","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LituRout/OptimalTransportModeling","path":"source/otm_celeba_64x64.py","file_url":"https://github.com/LituRout/OptimalTransportModeling/blob/HEAD/source/otm_celeba_64x64.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d05ce3ed69518646","mcp_get_code":{"code_sha256":"d05ce3ed69518646"}},{"arxiv_id":"2106.00456","paper":"/paper/federated-estimation-of-causal-effects-from","title":"Federated Estimation of Causal Effects from Observational Data","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GAMES-UChile/mogptk","path":"mogptk/model.py","file_url":"https://github.com/GAMES-UChile/mogptk/blob/HEAD/mogptk/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be41f5a4c4dab0a1","mcp_get_code":{"code_sha256":"be41f5a4c4dab0a1"}},{"arxiv_id":"1809.01361","paper":"/paper/a-unified-feature-disentangler-for-multi","title":"A Unified Feature Disentangler for Multi-Domain Image Translation and Manipulation","date":"2018-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alexander-H-Liu/UFDN","path":"src/ufdn.py","file_url":"https://github.com/Alexander-H-Liu/UFDN/blob/HEAD/src/ufdn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c9d9e942128d3d5","mcp_get_code":{"code_sha256":"5c9d9e942128d3d5"}},{"arxiv_id":"1804.07998","paper":"/paper/generating-natural-language-adversarial","title":"Generating Natural Language Adversarial Examples","date":"2018-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nesl/nlp_adversarial_examples","path":"lm_utils.py","file_url":"https://github.com/nesl/nlp_adversarial_examples/blob/HEAD/lm_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78ff89613e73a14f","mcp_get_code":{"code_sha256":"78ff89613e73a14f"}}]}