{"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/data-transforms","entry":"data_transforms","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"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":7,"unverified":2},"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":"2312.06607","arxiv_id_is_arxiv":true,"paper":"/paper/diad-a-diffusion-based-framework-for-multi","title":"DiAD: A Diffusion-based Framework for Multi-class Anomaly Detection","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lewandofskee/DiAD","path":"mvtecad_dataloader.py","file_url":"https://github.com/lewandofskee/DiAD/blob/HEAD/mvtecad_dataloader.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":"aace8d0be1f68d91","code_sha256_prefix":"aace8d0be1f68d91","mcp_get_code":{"code_sha256":"aace8d0be1f68d91"}},{"arxiv_id":"2004.09484","arxiv_id_is_arxiv":true,"paper":"/paper/bringing-old-photos-back-to-life","title":"Bringing Old Photos Back to Life","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Bringing-Old-Photos-Back-to-Life","path":"Global/detection.py","file_url":"https://github.com/microsoft/Bringing-Old-Photos-Back-to-Life/blob/HEAD/Global/detection.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":"448ee449b8b97680","code_sha256_prefix":"448ee449b8b97680","mcp_get_code":{"code_sha256":"448ee449b8b97680"}},{"arxiv_id":"2004.09484","arxiv_id_is_arxiv":true,"paper":"/paper/bringing-old-photos-back-to-life","title":"Bringing Old Photos Back to Life","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ImportPaddle/Old2Life","path":"Global/detection.py","file_url":"https://github.com/ImportPaddle/Old2Life/blob/HEAD/Global/detection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ImportPaddle/Old2Life, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ff2a8f34a4a25058","code_sha256_prefix":"ff2a8f34a4a25058","mcp_get_code":{"code_sha256":"ff2a8f34a4a25058"}},{"arxiv_id":"2004.09484","arxiv_id_is_arxiv":true,"paper":"/paper/bringing-old-photos-back-to-life","title":"Bringing Old Photos Back to Life","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nero-Disney/MICROSOFT_Bringing-Old-Photos-Back-to-Life","path":"Global/detection.py","file_url":"https://github.com/Nero-Disney/MICROSOFT_Bringing-Old-Photos-Back-to-Life/blob/HEAD/Global/detection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, Nero-Disney/MICROSOFT_Bringing-Old-Photos-Back-to-Life, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"40d3c46da7fced6c","code_sha256_prefix":"40d3c46da7fced6c","mcp_get_code":{"code_sha256":"40d3c46da7fced6c"}},{"arxiv_id":"2004.09484","arxiv_id_is_arxiv":true,"paper":"/paper/bringing-old-photos-back-to-life","title":"Bringing Old Photos Back to Life","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yasamin-niknam/Image-Restoration","path":"Global/detection.py","file_url":"https://github.com/yasamin-niknam/Image-Restoration/blob/HEAD/Global/detection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, yasamin-niknam/Image-Restoration, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a40025053b8b9874","code_sha256_prefix":"a40025053b8b9874","mcp_get_code":{"code_sha256":"a40025053b8b9874"}},{"arxiv_id":"2001.01431","arxiv_id_is_arxiv":true,"paper":"/paper/deeper-insights-into-weight-sharing-in-neural-1","title":"Deeper Insights into Weight Sharing in Neural Architecture Search","date":"2020-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ultmaster/deeper-insights-weight-sharing","path":"preproc.py","file_url":"https://github.com/ultmaster/deeper-insights-weight-sharing/blob/HEAD/preproc.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":"1d6c0c0dff1c1274","code_sha256_prefix":"1d6c0c0dff1c1274","mcp_get_code":{"code_sha256":"1d6c0c0dff1c1274"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khanrc/pt.darts","path":"preproc.py","file_url":"https://github.com/khanrc/pt.darts/blob/HEAD/preproc.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":"1d6c0c0dff1c1274","code_sha256_prefix":"1d6c0c0dff1c1274","mcp_get_code":{"code_sha256":"1d6c0c0dff1c1274"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abcp4/MyDarts","path":"preproc.py","file_url":"https://github.com/abcp4/MyDarts/blob/HEAD/preproc.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":"1110ae3cbc865a46","code_sha256_prefix":"1110ae3cbc865a46","mcp_get_code":{"code_sha256":"1110ae3cbc865a46"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grtzsohalf/pt.darts","path":"preproc.py","file_url":"https://github.com/grtzsohalf/pt.darts/blob/HEAD/preproc.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":"95b3a859cdfee2ba","code_sha256_prefix":"95b3a859cdfee2ba","mcp_get_code":{"code_sha256":"95b3a859cdfee2ba"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KnightZhang625/DARTS_NAS_TextClassification","path":"preproc.py","file_url":"https://github.com/KnightZhang625/DARTS_NAS_TextClassification/blob/HEAD/preproc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d0f2a7ef561ff07b","code_sha256_prefix":"d0f2a7ef561ff07b","mcp_get_code":{"code_sha256":"d0f2a7ef561ff07b"}},{"arxiv_id":"1805.09501","arxiv_id_is_arxiv":true,"paper":"/paper/autoaugment-learning-augmentation-policies","title":"AutoAugment: Learning Augmentation Policies from Data","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abcp4/DAPytorch","path":"preproc.py","file_url":"https://github.com/abcp4/DAPytorch/blob/HEAD/preproc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85ad5c4c61fbeaf5","code_sha256_prefix":"85ad5c4c61fbeaf5","mcp_get_code":{"code_sha256":"85ad5c4c61fbeaf5"}}],"record_sha256":"9d0f02642c6b3e6e2f39ba10d1697f556d29a380000cabb03d0666f62d8e6422","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}