{"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/gaussian-cdf","entry":"gaussian_cdf","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":5,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":8,"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":1,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"2510.21153","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-21153","title":"Uncertainty-Aware Multi-Objective Reinforcement Learning-Guided Diffusion Models for 3D De Novo Molecular Design","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Kyle4490/RL-Diffusion","path":"uncertainty/get_dist.py","file_url":"https://github.com/Kyle4490/RL-Diffusion/blob/HEAD/uncertainty/get_dist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76655e2a4abdcda7","code_sha256_prefix":"76655e2a4abdcda7","mcp_get_code":{"code_sha256":"76655e2a4abdcda7"}},{"arxiv_id":"2403.14606","arxiv_id_is_arxiv":true,"paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"control_flows/plot_soft_comparison.py","file_url":"https://github.com/diffprog/code/blob/HEAD/control_flows/plot_soft_comparison.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a10f8d6f8e878d2","code_sha256_prefix":"7a10f8d6f8e878d2","mcp_get_code":{"code_sha256":"7a10f8d6f8e878d2"}},{"arxiv_id":"2211.13837","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-stochastic-optimization-with","title":"End-to-End Stochastic Optimization with Energy-Based Model","date":"2022-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lingkai-Kong/so-ebm","path":"so-ebm.py","file_url":"https://github.com/Lingkai-Kong/so-ebm/blob/HEAD/so-ebm.py","status":"ran_draft_wrong","verification_level":2,"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, Lingkai-Kong/so-ebm when it was checked","code_sha256":"5b8430993a9532a2","code_sha256_prefix":"5b8430993a9532a2","mcp_get_code":{"code_sha256":"5b8430993a9532a2"}},{"arxiv_id":"2010.14406","arxiv_id_is_arxiv":true,"paper":"/paper/transporter-networks-rearranging-the-visual","title":"Transporter Networks: Rearranging the Visual World for Robotic Manipulation","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"nimRobotics/google-research","path":"simulation_research/tf_risk/util.py","file_url":"https://github.com/nimRobotics/google-research/blob/HEAD/simulation_research/tf_risk/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4e259e6f90e1040","code_sha256_prefix":"c4e259e6f90e1040","mcp_get_code":{"code_sha256":"c4e259e6f90e1040"}},{"arxiv_id":"1909.05829","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-foresight-self-supervised","title":"Hierarchical Foresight: Self-Supervised Learning of Long-Horizon Tasks via Visual Subgoal Generation","date":"2019-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suraj-nair-1/google-research","path":"simulation_research/tf_risk/util.py","file_url":"https://github.com/suraj-nair-1/google-research/blob/HEAD/simulation_research/tf_risk/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4e259e6f90e1040","code_sha256_prefix":"c4e259e6f90e1040","mcp_get_code":{"code_sha256":"c4e259e6f90e1040"}},{"arxiv_id":"1810.03958","arxiv_id_is_arxiv":true,"paper":"/paper/deterministic-variational-inference-for","title":"Deterministic Variational Inference for Robust Bayesian Neural Networks","date":"2018-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markovalexander/DVI","path":"core/bayesian_utils.py","file_url":"https://github.com/markovalexander/DVI/blob/HEAD/core/bayesian_utils.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":"cdfb9235c506423b","code_sha256_prefix":"cdfb9235c506423b","mcp_get_code":{"code_sha256":"cdfb9235c506423b"}},{"arxiv_id":"1810.03958","arxiv_id_is_arxiv":true,"paper":"/paper/deterministic-variational-inference-for","title":"Deterministic Variational Inference for Robust Bayesian Neural Networks","date":"2018-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omwright/cov-prop-nn","path":"run_tightness_mnist.py","file_url":"https://github.com/omwright/cov-prop-nn/blob/HEAD/run_tightness_mnist.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":"e8e6d80b1447469d","code_sha256_prefix":"e8e6d80b1447469d","mcp_get_code":{"code_sha256":"e8e6d80b1447469d"}},{"arxiv_id":"1810.03958","arxiv_id_is_arxiv":true,"paper":"/paper/deterministic-variational-inference-for","title":"Deterministic Variational Inference for Robust Bayesian Neural Networks","date":"2018-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/deterministic-variational-inference","path":"bayes_util.py","file_url":"https://github.com/Microsoft/deterministic-variational-inference/blob/HEAD/bayes_util.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":"4f0d31ec0d21de1c","code_sha256_prefix":"4f0d31ec0d21de1c","mcp_get_code":{"code_sha256":"4f0d31ec0d21de1c"}}],"record_sha256":"a7269e42ae891696530f87faf656cb77bc8ba277bf0dae07663d2b69e58ed439","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}