{"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/is-json-serializable","entry":"is_json_serializable","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":3,"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":4,"ran_draft_wrong":0,"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":"2605.11975","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11975","title":"Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"milanganai/milanganai.github.io","path":"NeurIPS2023/code/utils/serialization_utils.py","file_url":"https://github.com/milanganai/milanganai.github.io/blob/HEAD/NeurIPS2023/code/utils/serialization_utils.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, milanganai/milanganai.github.io when it was checked","code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"2604.19737","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-19737","title":"Safe Continual Reinforcement Learning in Non-stationary Environments","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"MACS-Research-Lab/safe-crl","path":"code/Safe-Policy-Optimization/safepo/common/logger.py","file_url":"https://github.com/MACS-Research-Lab/safe-crl/blob/HEAD/code/Safe-Policy-Optimization/safepo/common/logger.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, MACS-Research-Lab/safe-crl when it was checked","code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"2405.19660","arxiv_id_is_arxiv":true,"paper":"/paper/patient-ps-using-large-language-models-to","title":"PATIENT-Ψ: Using Large Language Models to Simulate Patients for Training Mental Health Professionals","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruiyiw/patient-psi","path":"python/generation/generate.py","file_url":"https://github.com/ruiyiw/patient-psi/blob/HEAD/python/generation/generate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2cc751a257c6787","code_sha256_prefix":"b2cc751a257c6787","mcp_get_code":{"code_sha256":"b2cc751a257c6787"}},{"arxiv_id":"2402.11137","arxiv_id_is_arxiv":true,"paper":"/paper/tunetables-context-optimization-for-scalable","title":"TuneTables: Context Optimization for Scalable Prior-Data Fitted Networks","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"penfever/tunetables","path":"tunetables/batch/run_tt_job.py","file_url":"https://github.com/penfever/tunetables/blob/HEAD/tunetables/batch/run_tt_job.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a5c44847d0bc55c2","code_sha256_prefix":"a5c44847d0bc55c2","mcp_get_code":{"code_sha256":"a5c44847d0bc55c2"}},{"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":"AlgTUDelft/WCSAC","path":"wc_sac/utils/serialization_utils.py","file_url":"https://github.com/AlgTUDelft/WCSAC/blob/HEAD/wc_sac/utils/serialization_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"2210.05150","arxiv_id_is_arxiv":true,"paper":"/paper/dhrl-a-graph-based-approach-for-long-horizon","title":"DHRL: A Graph-Based Approach for Long-Horizon and Sparse Hierarchical Reinforcement Learning","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaylee0301/dhrl_official","path":"DHRL/rl/algo/dhrl.py","file_url":"https://github.com/jaylee0301/dhrl_official/blob/HEAD/DHRL/rl/algo/dhrl.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"2208.01893","arxiv_id_is_arxiv":true,"paper":"/paper/flow-annealed-importance-sampling-bootstrap","title":"Flow Annealed Importance Sampling Bootstrap","date":"2022-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vislearn/trade","path":"trade/trainables.py","file_url":"https://github.com/vislearn/trade/blob/HEAD/trade/trainables.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9bc73838eb0f1444","code_sha256_prefix":"9bc73838eb0f1444","mcp_get_code":{"code_sha256":"9bc73838eb0f1444"}},{"arxiv_id":"2205.14691","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-robustness-of-safe-reinforcement","title":"On the Robustness of Safe Reinforcement Learning under Observational Perturbations","date":"2022-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuzuxin/safe-rl-robustness","path":"rsrl/util/logger.py","file_url":"https://github.com/liuzuxin/safe-rl-robustness/blob/HEAD/rsrl/util/logger.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"2106.09110","arxiv_id_is_arxiv":true,"paper":"/paper/safe-reinforcement-learning-using-advantage","title":"Safe Reinforcement Learning Using Advantage-Based Intervention","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nolanwagener/safe_rl","path":"safe_rl/utils/serialization_utils.py","file_url":"https://github.com/nolanwagener/safe_rl/blob/HEAD/safe_rl/utils/serialization_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"2006.07442","arxiv_id_is_arxiv":true,"paper":"/paper/self-imitation-learning-via-generalized-lower","title":"Self-Imitation Learning via Generalized Lower Bound Q-learning","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/spinningup","path":"spinup/utils/serialization_utils.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/serialization_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"1802.09477","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robintyh1/icml2021-pengqlambda","path":"spinup/utils/serialization_utils.py","file_url":"https://github.com/robintyh1/icml2021-pengqlambda/blob/HEAD/spinup/utils/serialization_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, robintyh1/icml2021-pengqlambda, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdally/fault-tolerant-flight-control-drl","path":"fault_tolerant_flight_control_drl/agent/sac.py","file_url":"https://github.com/kdally/fault-tolerant-flight-control-drl/blob/HEAD/fault_tolerant_flight_control_drl/agent/sac.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c70b5621a0ca8047","code_sha256_prefix":"c70b5621a0ca8047","mcp_get_code":{"code_sha256":"c70b5621a0ca8047"}},{"arxiv_id":"ijcai2023_0417","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2023_0417","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"gxywy/rl-plotter","path":"rl_plotter/log_utils.py","file_url":"https://github.com/gxywy/rl-plotter/blob/HEAD/rl_plotter/log_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"aaai_35251","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_35251","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Teddy298/continualworld-ppo","path":"continualworld/ppo/utils/serialization_utils.py","file_url":"https://github.com/Teddy298/continualworld-ppo/blob/HEAD/continualworld/ppo/utils/serialization_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"arxiv_id":"aaai_35251","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_35251","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Teddy298/continualworld-ppo","path":"continualworld/utils_ppo/serialization_utils.py","file_url":"https://github.com/Teddy298/continualworld-ppo/blob/HEAD/continualworld/utils_ppo/serialization_utils.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":"fa3450e31c44ab7b","code_sha256_prefix":"fa3450e31c44ab7b","mcp_get_code":{"code_sha256":"fa3450e31c44ab7b"}}],"record_sha256":"903aa414db2149c448582fe0fa41b039c68fcd6cc939ebc96d30dcc721f91ebc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}