{"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/reverse-unroll","entry":"reverse_unroll","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":4,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":1},"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":"2106.04692","paper":"/paper/provably-faster-algorithms-for-bilevel","title":"Provably Faster Algorithms for Bilevel Optimization","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjieyang97/mrvrbo","path":"hypergrad/hypergradients.py","file_url":"https://github.com/junjieyang97/mrvrbo/blob/HEAD/hypergrad/hypergradients.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":"677c8518ad1a22c9","mcp_get_code":{"code_sha256":"677c8518ad1a22c9"}},{"arxiv_id":"2010.07962","paper":"/paper/provably-faster-algorithms-for-bilevel-1","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjieyang97/stocbio_hp","path":"Hyperparameter-optimization/hypergrad/hypergradients.py","file_url":"https://github.com/junjieyang97/stocbio_hp/blob/HEAD/Hyperparameter-optimization/hypergrad/hypergradients.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":"677c8518ad1a22c9","mcp_get_code":{"code_sha256":"677c8518ad1a22c9"}},{"arxiv_id":"2006.16218","paper":"/paper/on-the-iteration-complexity-of-hypergradient","title":"On the Iteration Complexity of Hypergradient Computation","date":"2020-06-29","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":"729450e798657a96","mcp_get_code":{"code_sha256":"729450e798657a96"}},{"arxiv_id":"2006.14606","paper":"/paper/global-convergence-and-induced-kernels-of","title":"Global Convergence and Generalization Bound of Gradient-Based Meta-Learning with Deep Neural Nets","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-secure/Meta-Neural-Kernel","path":"hypergrad/hypergradients.py","file_url":"https://github.com/AI-secure/Meta-Neural-Kernel/blob/HEAD/hypergrad/hypergradients.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"47110587d7bc352b","mcp_get_code":{"code_sha256":"47110587d7bc352b"}},{"arxiv_id":"1909.04630","paper":"/paper/meta-learning-with-implicit-gradients","title":"Meta-Learning with Implicit Gradients","date":"2019-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prolearner/hypertorch","path":"hypergrad/hypergradients.py","file_url":"https://github.com/prolearner/hypertorch/blob/HEAD/hypergrad/hypergradients.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":"729450e798657a96","mcp_get_code":{"code_sha256":"729450e798657a96"}}]}