{"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/adjust-lr","entry":"adjust_lr","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":11,"n_places_pointer_only_link_open":7,"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":3,"ran_violates":0,"ran_draft_wrong":0,"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":"2506.21866","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.21866","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"CSYSI/DPU-Former","path":"DPU-Former_25_IJCAI/utils/utils.py","file_url":"https://github.com/CSYSI/DPU-Former/blob/HEAD/DPU-Former_25_IJCAI/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CSYSI/DPU-Former when it was checked","code_sha256":"1a4b7ff9d3c48bd7","code_sha256_prefix":"1a4b7ff9d3c48bd7","mcp_get_code":{"code_sha256":"1a4b7ff9d3c48bd7"}},{"arxiv_id":"2403.07591","arxiv_id_is_arxiv":true,"paper":"/paper/robustifying-and-boosting-training-free","title":"Robustifying and Boosting Training-Free Neural Architecture Search","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzf1174/RoBoT","path":"darts_space/train_imagenet.py","file_url":"https://github.com/hzf1174/RoBoT/blob/HEAD/darts_space/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e127535d5e962cac","code_sha256_prefix":"e127535d5e962cac","mcp_get_code":{"code_sha256":"e127535d5e962cac"}},{"arxiv_id":"2307.07205","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-motion-conditioned-diffusion-model","title":"Multimodal Motion Conditioned Diffusion Model for Skeleton-based Video Anomaly Detection","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/MoCoDAD","path":"utils/model_utils.py","file_url":"https://github.com/aleflabo/MoCoDAD/blob/HEAD/utils/model_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":"935b328e2a4ca4dd","code_sha256_prefix":"935b328e2a4ca4dd","mcp_get_code":{"code_sha256":"935b328e2a4ca4dd"}},{"arxiv_id":"2301.09489","arxiv_id_is_arxiv":true,"paper":"/paper/contracting-skeletal-kinematic-embeddings-for","title":"Contracting Skeletal Kinematics for Human-Related Video Anomaly Detection","date":"2023-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/COSKAD","path":"utils/model_utils.py","file_url":"https://github.com/aleflabo/COSKAD/blob/HEAD/utils/model_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":"935b328e2a4ca4dd","code_sha256_prefix":"935b328e2a4ca4dd","mcp_get_code":{"code_sha256":"935b328e2a4ca4dd"}},{"arxiv_id":"2203.14291","arxiv_id_is_arxiv":true,"paper":"/paper/video-polyp-segmentation-a-deep-learning","title":"Video Polyp Segmentation: A Deep Learning Perspective","date":"2022-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GewelsJI/PNS-Net","path":"utils/utils.py","file_url":"https://github.com/GewelsJI/PNS-Net/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from CSYSI/DPU-Former, and GitHub detected no licence in that repository when it was checked","code_sha256":"1a4b7ff9d3c48bd7","code_sha256_prefix":"1a4b7ff9d3c48bd7","mcp_get_code":{"code_sha256":"1a4b7ff9d3c48bd7"}},{"arxiv_id":"2108.08165","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-and-incremental-few-shot-learning","title":"Generalized and Incremental Few-Shot Learning by Explicit Learning and Calibration without Forgetting","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"annusha/LCwoF","path":"mini_imgnet/episode_training_clean.py","file_url":"https://github.com/annusha/LCwoF/blob/HEAD/mini_imgnet/episode_training_clean.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db8232296a32d4c7","code_sha256_prefix":"db8232296a32d4c7","mcp_get_code":{"code_sha256":"db8232296a32d4c7"}},{"arxiv_id":"2105.15010","arxiv_id_is_arxiv":true,"paper":"/paper/querynet-an-efficient-attack-framework-with","title":"Query Attack by Multi-Identity Surrogates","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenchen1998/querynet","path":"PCDARTS/train_imagenet.py","file_url":"https://github.com/allenchen1998/querynet/blob/HEAD/PCDARTS/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from chenxin061/pdarts, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"2007.02713","arxiv_id_is_arxiv":true,"paper":"/paper/bbs-net-rgb-d-salient-object-detection-with-a","title":"Bifurcated backbone strategy for RGB-D salient object detection","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DengPingFan/BBS-Net","path":"utils.py","file_url":"https://github.com/DengPingFan/BBS-Net/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"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 CSYSI/DPU-Former, and GitHub detected no licence in that repository when it was checked","code_sha256":"1a4b7ff9d3c48bd7","code_sha256_prefix":"1a4b7ff9d3c48bd7","mcp_get_code":{"code_sha256":"1a4b7ff9d3c48bd7"}},{"arxiv_id":"2006.16537","arxiv_id_is_arxiv":true,"paper":"/paper/theory-inspired-path-regularized-differential","title":"Theory-Inspired Path-Regularized Differential Network Architecture Search","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/PR-DARTS","path":"PRDARTS_eval/train_imagenet.py","file_url":"https://github.com/salesforce/PR-DARTS/blob/HEAD/PRDARTS_eval/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 chenxin061/pdarts, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"1912.10952","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-darts-bridging-the-optimization","title":"Progressive DARTS: Bridging the Optimization Gap for NAS in the Wild","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenxin061/pdarts","path":"train_imagenet.py","file_url":"https://github.com/chenxin061/pdarts/blob/HEAD/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, chenxin061/pdarts (NOASSERTION)","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"1912.00195","arxiv_id_is_arxiv":true,"paper":"/paper/sgas-sequential-greedy-architecture-search","title":"SGAS: Sequential Greedy Architecture Search","date":"2019-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightaime/sgas","path":"cnn/train_imagenet.py","file_url":"https://github.com/lightaime/sgas/blob/HEAD/cnn/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 chenxin061/pdarts, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"1906.07528","arxiv_id_is_arxiv":true,"paper":"/paper/prune-and-replace-nas","title":"Prune and Replace NAS","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cogsys-tuebingen/prdarts","path":"train_imagenet.py","file_url":"https://github.com/cogsys-tuebingen/prdarts/blob/HEAD/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cogsys-tuebingen/prdarts when it was checked","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"1904.12760","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-differentiable-architecture","title":"Progressive Differentiable Architecture Search: Bridging the Depth Gap between Search and Evaluation","date":"2019-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"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":"DoctorLiQ/AutoML","path":"cnn/train_imagenet.py","file_url":"https://github.com/DoctorLiQ/AutoML/blob/HEAD/cnn/train_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from chenxin061/pdarts, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"aaai_26076","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26076","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ShunLu91/PINAT","path":"darts/retrain_imagenet.py","file_url":"https://github.com/ShunLu91/PINAT/blob/HEAD/darts/retrain_imagenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 chenxin061/pdarts, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"e7ef53e9c5847e3e","code_sha256_prefix":"e7ef53e9c5847e3e","mcp_get_code":{"code_sha256":"e7ef53e9c5847e3e"}},{"arxiv_id":"aaai_25958","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25958","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tsingqguo/bgmix","path":"manual_seed.py","file_url":"https://github.com/tsingqguo/bgmix/blob/HEAD/manual_seed.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":"4e00e769f1d037c0","code_sha256_prefix":"4e00e769f1d037c0","mcp_get_code":{"code_sha256":"4e00e769f1d037c0"}}],"record_sha256":"ad596d0521e2e90918b372f8256911482b0b281fe431dbda9f0835c3f36c4539","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}