{"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/scheduler","entry":"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":12,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":12,"n_samples_ran":7,"n_samples_constructed":6,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":5,"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":0,"ran_fixture":0,"ran":7,"unverified":5},"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":"2603.10281","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-10281","title":"Taming Score-Based Denoisers in ADMM: A Convergent Plug-and-Play Framework","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"rajeshshrestha/ACDC","path":"sampler/admm.py","file_url":"https://github.com/rajeshshrestha/ACDC/blob/HEAD/sampler/admm.py","status":"unverified","verification_level":0,"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, rajeshshrestha/ACDC when it was checked","code_sha256":"be56cab396cc98f4","code_sha256_prefix":"be56cab396cc98f4","mcp_get_code":{"code_sha256":"be56cab396cc98f4"}},{"arxiv_id":"2512.15657","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-15657","title":"SoFlow: Solution Flow Models for One-Step Generative Modeling","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"zlab-princeton/SoFlow","path":"models.py","file_url":"https://github.com/zlab-princeton/SoFlow/blob/HEAD/models.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":"b4d97812ee2cd239","code_sha256_prefix":"b4d97812ee2cd239","mcp_get_code":{"code_sha256":"b4d97812ee2cd239"}},{"arxiv_id":"2510.07343","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07343","title":"Local MAP Sampling for Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"szhan311/lmaps","path":"algo/lmaps.py","file_url":"https://github.com/szhan311/lmaps/blob/HEAD/algo/lmaps.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":"f7be343c247d4d21","code_sha256_prefix":"f7be343c247d4d21","mcp_get_code":{"code_sha256":"f7be343c247d4d21"}},{"arxiv_id":"2410.23996","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-criterion-for-controlled","title":"An Information Criterion for Controlled Disentanglement of Multimodal Data","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlerlab/disentangledssl","path":"synthetic_task/algorithms.py","file_url":"https://github.com/uhlerlab/disentangledssl/blob/HEAD/synthetic_task/algorithms.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, uhlerlab/disentangledssl when it was checked","code_sha256":"3d40078d21ff70f7","code_sha256_prefix":"3d40078d21ff70f7","mcp_get_code":{"code_sha256":"3d40078d21ff70f7"}},{"arxiv_id":"2311.14900","arxiv_id_is_arxiv":true,"paper":"/paper/resfusion-prior-residual-noise-embedded","title":"Resfusion: Denoising Diffusion Probabilistic Models for Image Restoration Based on Prior Residual Noise","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkicsl/resfusion","path":"model/resfusion_restore.py","file_url":"https://github.com/nkicsl/resfusion/blob/HEAD/model/resfusion_restore.py","status":"unverified","verification_level":0,"contract_check":null,"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, nkicsl/resfusion (NOASSERTION)","code_sha256":"1cad0fc7e63f7014","code_sha256_prefix":"1cad0fc7e63f7014","mcp_get_code":{"code_sha256":"1cad0fc7e63f7014"}},{"arxiv_id":"2307.15337","arxiv_id_is_arxiv":true,"paper":"/paper/skeleton-of-thought-large-language-models-can","title":"Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imagination-research/sot","path":"sot/schedulers/outline_scheduler.py","file_url":"https://github.com/imagination-research/sot/blob/HEAD/sot/schedulers/outline_scheduler.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":"4b11415e0b05cbc2","code_sha256_prefix":"4b11415e0b05cbc2","mcp_get_code":{"code_sha256":"4b11415e0b05cbc2"}},{"arxiv_id":"2112.07380","arxiv_id_is_arxiv":true,"paper":"/paper/tracer-extreme-attention-guided-salient","title":"TRACER: Extreme Attention Guided Salient Object Tracing Network","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Karel911/TRACER","path":"util/losses.py","file_url":"https://github.com/Karel911/TRACER/blob/HEAD/util/losses.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":"f79eb9487bb69976","code_sha256_prefix":"f79eb9487bb69976","mcp_get_code":{"code_sha256":"f79eb9487bb69976"}},{"arxiv_id":"2110.14057","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-with-an-adaptive-task-scheduler","title":"Meta-learning with an Adaptive Task Scheduler","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huaxiuyao/ATS","path":"Miniimagenet/scheduler.py","file_url":"https://github.com/huaxiuyao/ATS/blob/HEAD/Miniimagenet/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, huaxiuyao/ATS when it was checked","code_sha256":"0625767e2b30966a","code_sha256_prefix":"0625767e2b30966a","mcp_get_code":{"code_sha256":"0625767e2b30966a"}},{"arxiv_id":"2009.09761","arxiv_id_is_arxiv":true,"paper":"/paper/diffwave-a-versatile-diffusion-model-for","title":"DiffWave: A Versatile Diffusion Model for Audio Synthesis","date":"2020-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"revsic/torch-diffusion-wavegan","path":"dwg/scheduler.py","file_url":"https://github.com/revsic/torch-diffusion-wavegan/blob/HEAD/dwg/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c7cc424d9517d3f","code_sha256_prefix":"1c7cc424d9517d3f","mcp_get_code":{"code_sha256":"1c7cc424d9517d3f"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Michedev/DDPM-Pytorch","path":"model/ddpm.py","file_url":"https://github.com/Michedev/DDPM-Pytorch/blob/HEAD/model/ddpm.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":"c558dcc00ec8acbc","code_sha256_prefix":"c558dcc00ec8acbc","mcp_get_code":{"code_sha256":"c558dcc00ec8acbc"}},{"arxiv_id":"2004.01339","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-reinforcement-learning-for-2","title":"Multi-agent Reinforcement Learning for Networked System Control","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cts198859/deeprl_network","path":"agents/models.py","file_url":"https://github.com/cts198859/deeprl_network/blob/HEAD/agents/models.py","status":"unverified","verification_level":0,"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, cts198859/deeprl_network when it was checked","code_sha256":"c6875fcebddc4cb5","code_sha256_prefix":"c6875fcebddc4cb5","mcp_get_code":{"code_sha256":"c6875fcebddc4cb5"}},{"arxiv_id":"2001.03415","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-interactions-modeling-with-1","title":"Multi-Agent Interactions Modeling with Correlated Policies","date":"2020-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apexrl/CoDAIL","path":"multi-agent-irl/irl/mack/kfac_discriminator_codail.py","file_url":"https://github.com/apexrl/CoDAIL/blob/HEAD/multi-agent-irl/irl/mack/kfac_discriminator_codail.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":"dee1879477183342","code_sha256_prefix":"dee1879477183342","mcp_get_code":{"code_sha256":"dee1879477183342"}}],"record_sha256":"ae11214db11c0b7b7b08cb1b0fc7708120613963b38772628f84e8dcd0d4a74f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}