{"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/get-model-fn","entry":"get_model_fn","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":3,"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":3,"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":2,"unverified":2},"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":"2509.16549","paper":"/paper/arxiv-2509-16549","title":"Efficient Rectified Flow for Image Fusion","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zirui0625/RFfusion","path":"RF/sde_lib.py","file_url":"https://github.com/zirui0625/RFfusion/blob/HEAD/RF/sde_lib.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9cdc6e245d49a3d9","mcp_get_code":{"code_sha256":"9cdc6e245d49a3d9"}},{"arxiv_id":"2405.17425","paper":"/paper/from-neurons-to-neutrons-a-case-study-in","title":"From Neurons to Neutrons: A Case Study in Interpretability","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelperezdi/nuclr-icml","path":"src/model.py","file_url":"https://github.com/samuelperezdi/nuclr-icml/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f49c1ebd2b79fd2","mcp_get_code":{"code_sha256":"5f49c1ebd2b79fd2"}},{"arxiv_id":"2310.16834","paper":"/paper/discrete-diffusion-language-modeling-by","title":"Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louaaron/Score-Entropy-Discrete-Diffusion","path":"model/utils.py","file_url":"https://github.com/louaaron/Score-Entropy-Discrete-Diffusion/blob/HEAD/model/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a58edfade53c8c1","mcp_get_code":{"code_sha256":"4a58edfade53c8c1"}},{"arxiv_id":"2210.06662","paper":"/paper/action-matching-a-variational-method-for","title":"Action Matching: Learning Stochastic Dynamics from Samples","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"necludov/jam","path":"losses.py","file_url":"https://github.com/necludov/jam/blob/HEAD/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c75a777beb20eea","mcp_get_code":{"code_sha256":"4c75a777beb20eea"}},{"arxiv_id":"1802.07191","paper":"/paper/neural-architecture-search-with-bayesian","title":"Neural Architecture Search with Bayesian Optimisation and Optimal Transport","date":"2018-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kirthevasank/nasbot","path":"cg/run_tensorflow.py","file_url":"https://github.com/kirthevasank/nasbot/blob/HEAD/cg/run_tensorflow.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f76525418cf49d82","mcp_get_code":{"code_sha256":"f76525418cf49d82"}}]}