{"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/check-nan","entry":"check_nan","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":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":1},"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":"2606.10528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10528","title":"Representation-Aware Advantage Estimation: Your Reward Model Provides More Than A Scalar Output","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"fanqiwan/FuseAI","path":"FuseChat/train/filter_nan.py","file_url":"https://github.com/fanqiwan/FuseAI/blob/HEAD/FuseChat/train/filter_nan.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fanqiwan/FuseAI when it was checked","code_sha256":"524b27f03377a248","code_sha256_prefix":"524b27f03377a248","mcp_get_code":{"code_sha256":"524b27f03377a248"}},{"arxiv_id":"2605.00855","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00855","title":"An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"PaulsonLab/PALM-Mean","path":"src/PWL_Custom_LB.py","file_url":"https://github.com/PaulsonLab/PALM-Mean/blob/HEAD/src/PWL_Custom_LB.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc9970371496cccd","code_sha256_prefix":"dc9970371496cccd","mcp_get_code":{"code_sha256":"dc9970371496cccd"}},{"arxiv_id":"2412.03187","arxiv_id_is_arxiv":true,"paper":"/paper/weighted-reward-preference-optimization-for","title":"Weighted-Reward Preference Optimization for Implicit Model Fusion","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/fuseai","path":"FuseChat/train/filter_nan.py","file_url":"https://github.com/fanqiwan/fuseai/blob/HEAD/FuseChat/train/filter_nan.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fanqiwan/fuseai when it was checked","code_sha256":"524b27f03377a248","code_sha256_prefix":"524b27f03377a248","mcp_get_code":{"code_sha256":"524b27f03377a248"}},{"arxiv_id":"2403.07815","arxiv_id_is_arxiv":true,"paper":"/paper/chronos-learning-the-language-of-time-series","title":"Chronos: Learning the Language of Time Series","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChernovAndrey/chronos-forecasting-wasserstein","path":"scripts/preprocessing_training_data/zero_shot_datasets.py","file_url":"https://github.com/ChernovAndrey/chronos-forecasting-wasserstein/blob/HEAD/scripts/preprocessing_training_data/zero_shot_datasets.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3963a392d702ebd5","code_sha256_prefix":"3963a392d702ebd5","mcp_get_code":{"code_sha256":"3963a392d702ebd5"}},{"arxiv_id":"2104.01148","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-3d-scenes-into-objects-via","title":"Decomposing 3D Scenes into Objects via Unsupervised Volume Segmentation","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stelzner/obsurf","path":"obsurf/common.py","file_url":"https://github.com/stelzner/obsurf/blob/HEAD/obsurf/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2929fe2070f69fee","code_sha256_prefix":"2929fe2070f69fee","mcp_get_code":{"code_sha256":"2929fe2070f69fee"}},{"arxiv_id":"2006.06485","arxiv_id_is_arxiv":true,"paper":"/paper/deep-structural-causal-models-for-tractable","title":"Deep Structural Causal Models for Tractable Counterfactual Inference","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/causal-gen","path":"src/pgm/dscm.py","file_url":"https://github.com/biomedia-mira/causal-gen/blob/HEAD/src/pgm/dscm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"72901075b1db0ad0","code_sha256_prefix":"72901075b1db0ad0","mcp_get_code":{"code_sha256":"72901075b1db0ad0"}}],"record_sha256":"e2961af693beeb1cfa286df060173a67109cb4721e0e2c7b899e362305a4259b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}