{"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/save-grad","entry":"save_grad","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":2,"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":"2205.03346","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"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":"149d779c3ce51b5d","code_sha256_prefix":"149d779c3ce51b5d","mcp_get_code":{"code_sha256":"149d779c3ce51b5d"}},{"arxiv_id":"2007.16041","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from rizar/CLOSURE, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"4d6893e38a989635","code_sha256_prefix":"4d6893e38a989635","mcp_get_code":{"code_sha256":"4d6893e38a989635"}},{"arxiv_id":"2001.06826","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"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":"149d779c3ce51b5d","code_sha256_prefix":"149d779c3ce51b5d","mcp_get_code":{"code_sha256":"149d779c3ce51b5d"}},{"arxiv_id":"1912.05783","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rizar/CLOSURE (NOASSERTION)","code_sha256":"4d6893e38a989635","code_sha256_prefix":"4d6893e38a989635","mcp_get_code":{"code_sha256":"4d6893e38a989635"}},{"arxiv_id":"1811.12889","arxiv_id_is_arxiv":true,"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,"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":"4d6893e38a989635","code_sha256_prefix":"4d6893e38a989635","mcp_get_code":{"code_sha256":"4d6893e38a989635"}},{"arxiv_id":"1805.08095","arxiv_id_is_arxiv":true,"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":"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":"b34e085d3f7d28af","code_sha256_prefix":"b34e085d3f7d28af","mcp_get_code":{"code_sha256":"b34e085d3f7d28af"}}],"record_sha256":"bedb569a0292a3ce509f8ee1bee35eb7fc59e551d4a0b7692cc2643a9cb0c7eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}