{"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/nan-to-num","entry":"nan_to_num","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":4,"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":3,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"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":"2601.19232","paper":"/paper/arxiv-2601-19232","title":"Structure-based RNA Design by Step-wise Optimization of Latent Diffusion Model","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"A4Bio/RDesign","path":"model/feature.py","file_url":"https://github.com/A4Bio/RDesign/blob/HEAD/model/feature.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79545090ec5f8fe4","mcp_get_code":{"code_sha256":"79545090ec5f8fe4"}},{"arxiv_id":"2412.18275","paper":"/paper/learning-to-engineer-protein-flexibility","title":"Learning to engineer protein flexibility","date":"2024-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KoubaPetr/Flexpert","path":"Flexpert-Design/src/models/pifold_model.py","file_url":"https://github.com/KoubaPetr/Flexpert/blob/HEAD/Flexpert-Design/src/models/pifold_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79545090ec5f8fe4","mcp_get_code":{"code_sha256":"79545090ec5f8fe4"}},{"arxiv_id":"2309.04379","paper":"/paper/language-prompt-for-autonomous-driving","title":"Language Prompt for Autonomous Driving","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wudongming97/prompt4driving","path":"projects/tracking_plugin/models/dense_heads/detr3d_tracking_head.py","file_url":"https://github.com/wudongming97/prompt4driving/blob/HEAD/projects/tracking_plugin/models/dense_heads/detr3d_tracking_head.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a2f0186e50e8bc32","mcp_get_code":{"code_sha256":"a2f0186e50e8bc32"}},{"arxiv_id":"2210.06831","paper":"/paper/multi-target-xgboostlss-regression","title":"Multi-Target XGBoostLSS Regression","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StatMixedML/XGBoostLSS","path":"xgboostlss/utils.py","file_url":"https://github.com/StatMixedML/XGBoostLSS/blob/HEAD/xgboostlss/utils.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":"4f218e3cb5cacde7","mcp_get_code":{"code_sha256":"4f218e3cb5cacde7"}},{"arxiv_id":"2112.09824","paper":"/paper/federated-dynamic-sparse-training-computing","title":"Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Better","date":"2021-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bibikar/feddst","path":"dst.py","file_url":"https://github.com/bibikar/feddst/blob/HEAD/dst.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"95de747c95e984f5","mcp_get_code":{"code_sha256":"95de747c95e984f5"}},{"arxiv_id":"2007.05721","paper":"/paper/towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlCorreia/GeFs","path":"gefs/cluster.py","file_url":"https://github.com/AlCorreia/GeFs/blob/HEAD/gefs/cluster.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4c4de66b03f27f1","mcp_get_code":{"code_sha256":"e4c4de66b03f27f1"}}]}