{"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/dict-product","entry":"dict_product","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":3,"n_papers_ran_instrument_only":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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":1,"ran_fixture":0,"ran":3,"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":"2406.07777","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-interpretability-and-explainability","title":"Unifying Interpretability and Explainability for Alzheimer's Disease Progression Prediction","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rfali/xrlad","path":"configs/gen_train_configs.py","file_url":"https://github.com/rfali/xrlad/blob/HEAD/configs/gen_train_configs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35b6f17122388f57","code_sha256_prefix":"35b6f17122388f57","mcp_get_code":{"code_sha256":"35b6f17122388f57"}},{"arxiv_id":"2406.04724","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-perspectives-on-error","title":"Probabilistic Perspectives on Error Minimization in Adversarial Reinforcement Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/WocaR-RL","path":"WocaR-PPO/src/utils.py","file_url":"https://github.com/umd-huang-lab/WocaR-RL/blob/HEAD/WocaR-PPO/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35b6f17122388f57","code_sha256_prefix":"35b6f17122388f57","mcp_get_code":{"code_sha256":"35b6f17122388f57"}},{"arxiv_id":"2302.06912","arxiv_id_is_arxiv":true,"paper":"/paper/robust-deep-reinforcement-learning-through-2","title":"Regret-Based Defense in Adversarial Reinforcement Learning","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"romanbelaire/robust-ccer","path":"code_mujoco/ccer/utils.py","file_url":"https://github.com/romanbelaire/robust-ccer/blob/HEAD/code_mujoco/ccer/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35b6f17122388f57","code_sha256_prefix":"35b6f17122388f57","mcp_get_code":{"code_sha256":"35b6f17122388f57"}},{"arxiv_id":"2208.05963","arxiv_id_is_arxiv":true,"paper":"/paper/relpose-predicting-probabilistic-relative","title":"RelPose: Predicting Probabilistic Relative Rotation for Single Objects in the Wild","date":"2022-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonyzhang/relpose","path":"relpose/eval/eval_driver.py","file_url":"https://github.com/jasonyzhang/relpose/blob/HEAD/relpose/eval/eval_driver.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":"6b680714c1a0ebc8","code_sha256_prefix":"6b680714c1a0ebc8","mcp_get_code":{"code_sha256":"6b680714c1a0ebc8"}},{"arxiv_id":"2009.10897","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-design-choices-in-proximal-policy","title":"Revisiting Design Choices in Proximal Policy Optimization","date":"2020-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chloechsu/revisiting-ppo","path":"src/utils.py","file_url":"https://github.com/chloechsu/revisiting-ppo/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35b6f17122388f57","code_sha256_prefix":"35b6f17122388f57","mcp_get_code":{"code_sha256":"35b6f17122388f57"}},{"arxiv_id":"2005.12729","arxiv_id_is_arxiv":true,"paper":"/paper/implementation-matters-in-deep-policy","title":"Implementation Matters in Deep Policy Gradients: A Case Study on PPO and TRPO","date":"2020-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MadryLab/implementation-matters","path":"src/utils.py","file_url":"https://github.com/MadryLab/implementation-matters/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35b6f17122388f57","code_sha256_prefix":"35b6f17122388f57","mcp_get_code":{"code_sha256":"35b6f17122388f57"}},{"arxiv_id":"1607.00133","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-with-differential-privacy","title":"Deep Learning with Differential Privacy","date":"2016-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunblaze-ucb/dpml-benchmark","path":"gridsearch.py","file_url":"https://github.com/sunblaze-ucb/dpml-benchmark/blob/HEAD/gridsearch.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":"03cc2bf621d7826a","code_sha256_prefix":"03cc2bf621d7826a","mcp_get_code":{"code_sha256":"03cc2bf621d7826a"}},{"arxiv_id":"1602.00229","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-gaussianization-from-ica-to-random","title":"Iterative Gaussianization: from ICA to Random Rotations","date":"2016-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IPL-UV/gauss4eo","path":"src/experiments/utils.py","file_url":"https://github.com/IPL-UV/gauss4eo/blob/HEAD/src/experiments/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":"fa25ecaf94021cac","code_sha256_prefix":"fa25ecaf94021cac","mcp_get_code":{"code_sha256":"fa25ecaf94021cac"}}],"record_sha256":"c4198207be31664aa67e2cae19d3f1aa2c428d9049e874f93193bef7f68b3c74","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}