{"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/get-monitor-files","entry":"get_monitor_files","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2605.18591","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18591","title":"Randomized Advantage Transformation (RAT): Computing Natural Policy Gradients via Direct Backpropagation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"agent-lab/ICML2026-RAT","path":"utils/monitor.py","file_url":"https://github.com/agent-lab/ICML2026-RAT/blob/HEAD/utils/monitor.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6dabfbf42f09101c","code_sha256_prefix":"6dabfbf42f09101c","mcp_get_code":{"code_sha256":"6dabfbf42f09101c"}},{"arxiv_id":"2111.03941","arxiv_id_is_arxiv":true,"paper":"/paper/time-discretization-invariant-safe-action","title":"Time Discretization-Invariant Safe Action Repetition for Policy Gradient Methods","date":"2021-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"artberryx/SAR","path":"sb/stable_baselines/bench/monitor.py","file_url":"https://github.com/artberryx/SAR/blob/HEAD/sb/stable_baselines/bench/monitor.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":"0d0ddaf36545261e","code_sha256_prefix":"0d0ddaf36545261e","mcp_get_code":{"code_sha256":"0d0ddaf36545261e"}},{"arxiv_id":"2010.09170","arxiv_id_is_arxiv":true,"paper":"/paper/belief-grounded-networks-for-acceleratedrobot","title":"Belief-Grounded Networks for Accelerated Robot Learning under Partial Observability","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hai-h-nguyen/belief-grounded-network","path":"modifications/monitor.py","file_url":"https://github.com/hai-h-nguyen/belief-grounded-network/blob/HEAD/modifications/monitor.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":"dc7cbce302df4a1e","code_sha256_prefix":"dc7cbce302df4a1e","mcp_get_code":{"code_sha256":"dc7cbce302df4a1e"}},{"arxiv_id":"2006.04061","arxiv_id_is_arxiv":true,"paper":"/paper/dual-policy-distillation","title":"Dual Policy Distillation","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiminh/dual-policy-distillation","path":"baselines/bench/monitor.py","file_url":"https://github.com/kiminh/dual-policy-distillation/blob/HEAD/baselines/bench/monitor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, kiminh/dual-policy-distillation, 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":"c6cb2f61f176b29b","code_sha256_prefix":"c6cb2f61f176b29b","mcp_get_code":{"code_sha256":"c6cb2f61f176b29b"}},{"arxiv_id":"1905.02363","arxiv_id_is_arxiv":true,"paper":"/paper/dimension-wise-importance-sampling-weight","title":"Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning","date":"2019-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seungyulhan/disc","path":"baselines/bench/monitor.py","file_url":"https://github.com/seungyulhan/disc/blob/HEAD/baselines/bench/monitor.py","status":"ran","verification_level":1,"contract_check":null,"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, seungyulhan/disc, 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":"fa39f243af244088","code_sha256_prefix":"fa39f243af244088","mcp_get_code":{"code_sha256":"fa39f243af244088"}},{"arxiv_id":"1811.02073","arxiv_id_is_arxiv":true,"paper":"/paper/quota-the-quantile-option-architecture-for","title":"QUOTA: The Quantile Option Architecture for Reinforcement Learning","date":"2018-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kchu/DeepRL_CK","path":"Distributional_RL/monitor.py","file_url":"https://github.com/Kchu/DeepRL_CK/blob/HEAD/Distributional_RL/monitor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 seungyulhan/disc, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"fa39f243af244088","code_sha256_prefix":"fa39f243af244088","mcp_get_code":{"code_sha256":"fa39f243af244088"}},{"arxiv_id":"1606.03476","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-imitation-learning","title":"Generative Adversarial Imitation Learning","date":"2016-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Techget/gail-tf-sc2","path":"gailtf/baselines/bench/monitor.py","file_url":"https://github.com/Techget/gail-tf-sc2/blob/HEAD/gailtf/baselines/bench/monitor.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":"af3d493bdc17ad51","code_sha256_prefix":"af3d493bdc17ad51","mcp_get_code":{"code_sha256":"af3d493bdc17ad51"}}],"record_sha256":"15e8b888a1fcfff062b5df2355f46b904a88c413fb1447988183f72be09d2e82","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}