{"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/conjugate-gradients","entry":"conjugate_gradients","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":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":3,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":3},"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.10228","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10228","title":"SHAPO: Sharpness-Aware Policy Optimization for Safe Exploration","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"montrealrobotics/shapo","path":"safepo/single_agent/shapo.py","file_url":"https://github.com/montrealrobotics/shapo/blob/HEAD/safepo/single_agent/shapo.py","status":"unverified","verification_level":0,"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":"66ed7b1d9ea7acbc","code_sha256_prefix":"66ed7b1d9ea7acbc","mcp_get_code":{"code_sha256":"66ed7b1d9ea7acbc"}},{"arxiv_id":"2103.05910","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-imperfect-demonstrations-from","title":"Learning from Imperfect Demonstrations from Agents with Varying Dynamics","date":"2021-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stanford-ILIAD/Learn-Imperfect-Varying-Dynamics","path":"trpo.py","file_url":"https://github.com/Stanford-ILIAD/Learn-Imperfect-Varying-Dynamics/blob/HEAD/trpo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"918891131c62a121","code_sha256_prefix":"918891131c62a121","mcp_get_code":{"code_sha256":"918891131c62a121"}},{"arxiv_id":"2003.04108","arxiv_id_is_arxiv":true,"paper":"/paper/stable-policy-optimization-via-off-policy","title":"Stable Policy Optimization via Off-Policy Divergence Regularization","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/ppo-dice","path":"trpo/opt.py","file_url":"https://github.com/facebookresearch/ppo-dice/blob/HEAD/trpo/opt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"918891131c62a121","code_sha256_prefix":"918891131c62a121","mcp_get_code":{"code_sha256":"918891131c62a121"}},{"arxiv_id":"1705.10528","arxiv_id_is_arxiv":true,"paper":"/paper/constrained-policy-optimization","title":"Constrained Policy Optimization","date":"2017-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sapanachaudhary/pytorch-cpo","path":"algos/cpo.py","file_url":"https://github.com/sapanachaudhary/pytorch-cpo/blob/HEAD/algos/cpo.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":"aad2ffc14dc1c396","code_sha256_prefix":"aad2ffc14dc1c396","mcp_get_code":{"code_sha256":"aad2ffc14dc1c396"}},{"arxiv_id":"1609.04802","arxiv_id_is_arxiv":true,"paper":"/paper/photo-realistic-single-image-super-resolution","title":"Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network","date":"2016-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shirsenduhalder/SRResGAN-Improved-Perceptual","path":"basic_utils.py","file_url":"https://github.com/shirsenduhalder/SRResGAN-Improved-Perceptual/blob/HEAD/basic_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":"2d594866e7355287","code_sha256_prefix":"2d594866e7355287","mcp_get_code":{"code_sha256":"2d594866e7355287"}},{"arxiv_id":"1502.05477","arxiv_id_is_arxiv":true,"paper":"/paper/trust-region-policy-optimization","title":"Trust Region Policy Optimization","date":"2015-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"918891131c62a121","code_sha256_prefix":"918891131c62a121","mcp_get_code":{"code_sha256":"918891131c62a121"}},{"arxiv_id":"1502.05477","arxiv_id_is_arxiv":true,"paper":"/paper/trust-region-policy-optimization","title":"Trust Region Policy Optimization","date":"2015-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Khrylx/PyTorch-RL","path":"core/trpo.py","file_url":"https://github.com/Khrylx/PyTorch-RL/blob/HEAD/core/trpo.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":"8946170b041be61b","code_sha256_prefix":"8946170b041be61b","mcp_get_code":{"code_sha256":"8946170b041be61b"}},{"arxiv_id":"aaai_16817","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16817","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Akella17/Deep-Bayesian-Quadrature-Policy-Optimization","path":"optimization.py","file_url":"https://github.com/Akella17/Deep-Bayesian-Quadrature-Policy-Optimization/blob/HEAD/optimization.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":"ac81cfb2bd5616e5","code_sha256_prefix":"ac81cfb2bd5616e5","mcp_get_code":{"code_sha256":"ac81cfb2bd5616e5"}}],"record_sha256":"c22df4e0434788d60e02afb17644b76bae327b97ccfd6a2ae584c276d28f92cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}