{"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/create-log-gaussian","entry":"create_log_gaussian","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":5,"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":0,"ran_fixture":0,"ran":1,"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":"2405.19080","arxiv_id_is_arxiv":true,"paper":"/paper/ompo-a-unified-framework-for-rl-under-policy","title":"OMPO: A Unified Framework for RL under Policy and Dynamics Shifts","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roythuly/ompo","path":"model/utils.py","file_url":"https://github.com/roythuly/ompo/blob/HEAD/model/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, roythuly/ompo when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"2401.14758","arxiv_id_is_arxiv":true,"paper":"/paper/off-policy-primal-dual-safe-reinforcement","title":"Off-Policy Primal-Dual Safe Reinforcement Learning","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZifanWu/CAL","path":"agent/utils.py","file_url":"https://github.com/ZifanWu/CAL/blob/HEAD/agent/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from roythuly/ompo, and GitHub detected no licence in that repository when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"2401.13231","arxiv_id_is_arxiv":true,"paper":"/paper/dittogym-learning-to-control-soft-shape","title":"DittoGym: Learning to Control Soft Shape-Shifting Robots","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suninghuang19/cfp","path":"utils.py","file_url":"https://github.com/suninghuang19/cfp/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suninghuang19/cfp when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"2307.12063","arxiv_id_is_arxiv":true,"paper":"/paper/balancing-exploration-and-exploitation-in","title":"Balancing Exploration and Exploitation in Hierarchical Reinforcement Learning via Latent Landmark Graphs","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"papercode2022/hill","path":"HILL/hill/algos/sac/utils.py","file_url":"https://github.com/papercode2022/hill/blob/HEAD/HILL/hill/algos/sac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, papercode2022/hill when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"2305.05760","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-the-cost-of-cycle-time-tuning-for","title":"Reducing the Cost of Cycle-Time Tuning for Real-World Policy Optimization","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"homayoonfarrahi/cycle-time-study","path":"sac/utils.py","file_url":"https://github.com/homayoonfarrahi/cycle-time-study/blob/HEAD/sac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from roythuly/ompo, and GitHub detected no licence in that repository when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"2010.09163","arxiv_id_is_arxiv":true,"paper":"/paper/d2rl-deep-dense-architectures-in-1","title":"D2RL: Deep Dense Architectures in Reinforcement Learning","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pairlab/d2rl","path":"sac/utils.py","file_url":"https://github.com/pairlab/d2rl/blob/HEAD/sac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from roythuly/ompo, and GitHub detected no licence in that repository when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"2010.08830","arxiv_id_is_arxiv":true,"paper":"/paper/mesa-boost-ensemble-imbalanced-learning-with","title":"MESA: Boost Ensemble Imbalanced Learning with MEta-SAmpler","date":"2020-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhiningLiu1998/mesa","path":"sac_src/utils.py","file_url":"https://github.com/ZhiningLiu1998/mesa/blob/HEAD/sac_src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from roythuly/ompo, and GitHub detected no licence in that repository when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}},{"arxiv_id":"1906.02771","arxiv_id_is_arxiv":true,"paper":"/paper/improving-exploration-in-soft-actor-critic","title":"Improving Exploration in Soft-Actor-Critic with Normalizing Flows Policies","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeybose/FloRL","path":"pytorch-soft-actor-critic/utils.py","file_url":"https://github.com/joeybose/FloRL/blob/HEAD/pytorch-soft-actor-critic/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from roythuly/ompo, and GitHub detected no licence in that repository when it was checked","code_sha256":"2526cfd8d5bf5d06","code_sha256_prefix":"2526cfd8d5bf5d06","mcp_get_code":{"code_sha256":"2526cfd8d5bf5d06"}}],"record_sha256":"9623d6e646e05db7d87205b46bca4fcf28e56b1234fb7956fa83bfd66a760d06","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}