{"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/make-scheduler","entry":"make_scheduler","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":6,"unverified":1},"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":"2606.12748","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12748","title":"Agent-based models for the evolution of morphological alternation patterns","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"SakanaAI/LanguageEvolution","path":"core/scheduler.py","file_url":"https://github.com/SakanaAI/LanguageEvolution/blob/HEAD/core/scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, SakanaAI/LanguageEvolution when it was checked","code_sha256":"65b8b3427dc7d43f","code_sha256_prefix":"65b8b3427dc7d43f","mcp_get_code":{"code_sha256":"65b8b3427dc7d43f"}},{"arxiv_id":"2405.02797","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-to-distribution-shift-by-visual","title":"Adapting to Distribution Shift by Visual Domain Prompt Generation","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guliisgreat/vdpg","path":"src/solver/lr_scheduler.py","file_url":"https://github.com/guliisgreat/vdpg/blob/HEAD/src/solver/lr_scheduler.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, guliisgreat/vdpg when it was checked","code_sha256":"608b236929e5baf7","code_sha256_prefix":"608b236929e5baf7","mcp_get_code":{"code_sha256":"608b236929e5baf7"}},{"arxiv_id":"2312.04604","arxiv_id_is_arxiv":true,"paper":"/paper/transferable-candidate-proposal-with-bounded","title":"Transferable Candidate Proposal with Bounded Uncertainty","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gokyeongryeol/TBU","path":"active/models/trainer.py","file_url":"https://github.com/gokyeongryeol/TBU/blob/HEAD/active/models/trainer.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":"28c0113be1ca01e1","code_sha256_prefix":"28c0113be1ca01e1","mcp_get_code":{"code_sha256":"28c0113be1ca01e1"}},{"arxiv_id":"2106.04732","arxiv_id_is_arxiv":true,"paper":"/paper/adamatch-a-unified-approach-to-semi","title":"AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smkim7-kr/AdaMatch-pytorch","path":"src/scheduler.py","file_url":"https://github.com/smkim7-kr/AdaMatch-pytorch/blob/HEAD/src/scheduler.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":"69813457472b3348","code_sha256_prefix":"69813457472b3348","mcp_get_code":{"code_sha256":"69813457472b3348"}},{"arxiv_id":"1907.10244","arxiv_id_is_arxiv":true,"paper":"/paper/learning-spatial-transform-for-video-frame","title":"AdaCoF: Adaptive Collaboration of Flows for Video Frame Interpolation","date":"2019-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HyeongminLEE/AdaCoF-pytorch","path":"utility.py","file_url":"https://github.com/HyeongminLEE/AdaCoF-pytorch/blob/HEAD/utility.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":"79544811771ac207","code_sha256_prefix":"79544811771ac207","mcp_get_code":{"code_sha256":"79544811771ac207"}},{"arxiv_id":"1804.01438","arxiv_id_is_arxiv":true,"paper":"/paper/learning-discriminative-features-with","title":"Learning Discriminative Features with Multiple Granularities for Person Re-Identification","date":"2018-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangTaoAs/MGN_ReID","path":"processor/make_optimizer.py","file_url":"https://github.com/WangTaoAs/MGN_ReID/blob/HEAD/processor/make_optimizer.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":"348c97f2f7dfc317","code_sha256_prefix":"348c97f2f7dfc317","mcp_get_code":{"code_sha256":"348c97f2f7dfc317"}},{"arxiv_id":"1803.08471","arxiv_id_is_arxiv":true,"paper":"/paper/locally-private-bayesian-inference-for-count","title":"Locally Private Bayesian Inference for Count Models","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xandaschofield/locally_private_bpf_icml19","path":"code/bppmf_experiment.py","file_url":"https://github.com/xandaschofield/locally_private_bpf_icml19/blob/HEAD/code/bppmf_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad80e73ccaf5d50f","code_sha256_prefix":"ad80e73ccaf5d50f","mcp_get_code":{"code_sha256":"ad80e73ccaf5d50f"}},{"arxiv_id":"Deng_LAU-Net_Latitude_Adaptive_Upscaling_Network_for_Omnidirectional_Image_Super-Resolution_CVPR_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Deng_LAU-Net_Latitude_Adaptive_Upscaling_Network_for_Omnidirectional_Image_Super-Resolution_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wangh-allen/LAU-Net","path":"utility.py","file_url":"https://github.com/wangh-allen/LAU-Net/blob/HEAD/utility.py","status":"unverified","verification_level":0,"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":"ae43f6c45eb8630f","code_sha256_prefix":"ae43f6c45eb8630f","mcp_get_code":{"code_sha256":"ae43f6c45eb8630f"}},{"arxiv_id":"Danier_ST-MFNet_A_Spatio-Temporal_Multi-Flow_Network_for_Frame_Interpolation_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Danier_ST-MFNet_A_Spatio-Temporal_Multi-Flow_Network_for_Frame_Interpolation_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"danielism97/ST-MFNet","path":"utility.py","file_url":"https://github.com/danielism97/ST-MFNet/blob/HEAD/utility.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":"d26a21de4c4404f0","code_sha256_prefix":"d26a21de4c4404f0","mcp_get_code":{"code_sha256":"d26a21de4c4404f0"}}],"record_sha256":"1b939fbcb5169932f18c2566ceb3d3cff9b6a76376121d03318e9f419040665a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}