{"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/save-grad","entry":"save_grad","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":6,"n_papers_ran":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":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":2},"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":"2205.03346","paper":"/paper/multitask-aet-with-orthogonal-tangent-1","title":"Multitask AET with Orthogonal Tangent Regularity for Dark Object Detection","date":"2022-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuiziteng/MAET","path":"mmdet/models/detectors/MAET_YOLO/MAET_YOLO.py","file_url":"https://github.com/cuiziteng/MAET/blob/HEAD/mmdet/models/detectors/MAET_YOLO/MAET_YOLO.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"149d779c3ce51b5d","mcp_get_code":{"code_sha256":"149d779c3ce51b5d"}},{"arxiv_id":"2007.16041","paper":"/paper/whole-milc-generalizing-learned-dynamics","title":"Whole MILC: generalizing learned dynamics across tasks, datasets, and populations","date":"2020-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UsmanMahmood27/MILC","path":"src/CNN_LSTM_Att_RealData.py","file_url":"https://github.com/UsmanMahmood27/MILC/blob/HEAD/src/CNN_LSTM_Att_RealData.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":"4d6893e38a989635","mcp_get_code":{"code_sha256":"4d6893e38a989635"}},{"arxiv_id":"2001.06826","paper":"/paper/zero-reference-deep-curve-estimation-for-low","title":"Zero-Reference Deep Curve Estimation for Low-Light Image Enhancement","date":"2020-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuiziteng/iccv_maet","path":"mmdet/models/detectors/MAET_YOLO/MAET_YOLO.py","file_url":"https://github.com/cuiziteng/iccv_maet/blob/HEAD/mmdet/models/detectors/MAET_YOLO/MAET_YOLO.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"149d779c3ce51b5d","mcp_get_code":{"code_sha256":"149d779c3ce51b5d"}},{"arxiv_id":"1912.05783","paper":"/paper/closure-assessing-systematic-generalization","title":"CLOSURE: Assessing Systematic Generalization of CLEVR Models","date":"2019-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rizar/CLOSURE","path":"scripts/run_model.py","file_url":"https://github.com/rizar/CLOSURE/blob/HEAD/scripts/run_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"4d6893e38a989635","mcp_get_code":{"code_sha256":"4d6893e38a989635"}},{"arxiv_id":"1811.12889","paper":"/paper/systematic-generalization-what-is-required","title":"Systematic Generalization: What Is Required and Can It Be Learned?","date":"2018-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":"4d6893e38a989635","mcp_get_code":{"code_sha256":"4d6893e38a989635"}},{"arxiv_id":"1805.08095","paper":"/paper/small-steps-and-giant-leaps-minimal-newton","title":"Small steps and giant leaps: Minimal Newton solvers for Deep Learning","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Healbadbad/curveball-pytorch","path":"optimizer-tests-FA.py","file_url":"https://github.com/Healbadbad/curveball-pytorch/blob/HEAD/optimizer-tests-FA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b34e085d3f7d28af","mcp_get_code":{"code_sha256":"b34e085d3f7d28af"}}]}