{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/nan-to-num","entry":"nan_to_num","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, A4Bio/RDesign when it was checked","code_sha256":"79545090ec5f8fe4","code_sha256_prefix":"79545090ec5f8fe4","mcp_get_code":{"code_sha256":"79545090ec5f8fe4"}},{"arxiv_id":"2412.18275","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79545090ec5f8fe4","code_sha256_prefix":"79545090ec5f8fe4","mcp_get_code":{"code_sha256":"79545090ec5f8fe4"}},{"arxiv_id":"2309.04379","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2f0186e50e8bc32","code_sha256_prefix":"a2f0186e50e8bc32","mcp_get_code":{"code_sha256":"a2f0186e50e8bc32"}},{"arxiv_id":"2210.06831","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f218e3cb5cacde7","code_sha256_prefix":"4f218e3cb5cacde7","mcp_get_code":{"code_sha256":"4f218e3cb5cacde7"}},{"arxiv_id":"2112.09824","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95de747c95e984f5","code_sha256_prefix":"95de747c95e984f5","mcp_get_code":{"code_sha256":"95de747c95e984f5"}},{"arxiv_id":"2007.05721","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e4c4de66b03f27f1","code_sha256_prefix":"e4c4de66b03f27f1","mcp_get_code":{"code_sha256":"e4c4de66b03f27f1"}}],"record_sha256":"2e0ae72f3c2c87a498daaffe301464b9c0c787073630e28da49e0a6513c1c06a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}