{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/l2-projection","entry":"l2_projection","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":5,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":0},"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":"2404.13736","paper":"/paper/interval-abstractions-for-robust","title":"Interval Abstractions for Robust Counterfactual Explanations","date":"2024-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junqi-jiang/interval-abstractions","path":"rbr/rbr_loss.py","file_url":"https://github.com/junqi-jiang/interval-abstractions/blob/HEAD/rbr/rbr_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f82f506abe66066","mcp_get_code":{"code_sha256":"1f82f506abe66066"}},{"arxiv_id":"2309.12545","paper":"/paper/provably-robust-and-plausible-counterfactual","title":"Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisation","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junqi-jiang/proplace","path":"rbr/rbr_loss.py","file_url":"https://github.com/junqi-jiang/proplace/blob/HEAD/rbr/rbr_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f82f506abe66066","mcp_get_code":{"code_sha256":"1f82f506abe66066"}},{"arxiv_id":"2301.12714","paper":"/paper/importance-weighted-actor-critic-for-optimal-1","title":"Importance Weighted Actor-Critic for Optimal Conservative Offline Reinforcement Learning","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuhl98/acrab","path":"ACrab/acrab.py","file_url":"https://github.com/zhuhl98/acrab/blob/HEAD/ACrab/acrab.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"36c97c87a5d855c4","mcp_get_code":{"code_sha256":"36c97c87a5d855c4"}},{"arxiv_id":"2212.00124","paper":"/paper/one-risk-to-rule-them-all-a-risk-sensitive-1","title":"One Risk to Rule Them All: A Risk-Sensitive Perspective on Model-Based Offline Reinforcement Learning","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"36c97c87a5d855c4","mcp_get_code":{"code_sha256":"36c97c87a5d855c4"}},{"arxiv_id":"2202.02446","paper":"/paper/adversarially-trained-actor-critic-for","title":"Adversarially Trained Actor Critic for Offline Reinforcement Learning","date":"2022-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chinganc/lightatac","path":"lightATAC/atac.py","file_url":"https://github.com/chinganc/lightatac/blob/HEAD/lightATAC/atac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36c97c87a5d855c4","mcp_get_code":{"code_sha256":"36c97c87a5d855c4"}}]}