{"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/cosine-schedule","entry":"cosine_schedule","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":10,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":9,"n_places":14,"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":4,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"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":"2607.20057","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-20057","title":"Antigen-specific Antibody Multi-modal Foundation Model for Functional Antibody Design","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"XL-S224/AAMFM","path":"src/cpt/training/masking.py","file_url":"https://github.com/XL-S224/AAMFM/blob/HEAD/src/cpt/training/masking.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"02878829f365fc01","code_sha256_prefix":"02878829f365fc01","mcp_get_code":{"code_sha256":"02878829f365fc01"}},{"arxiv_id":"2605.07100","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07100","title":"TRACE: Transport Alignment Conformal Prediction via Diffusion and Flow Matching Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ZFangUI/TRACE","path":"models/diffusion.py","file_url":"https://github.com/ZFangUI/TRACE/blob/HEAD/models/diffusion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZFangUI/TRACE when it was checked","code_sha256":"aacf60494b8fedb7","code_sha256_prefix":"aacf60494b8fedb7","mcp_get_code":{"code_sha256":"aacf60494b8fedb7"}},{"arxiv_id":"2605.00800","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00800","title":"Generating Statistical Charts with Validation-Driven LLM Workflows","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pavlin-policar/llm-chart-generation","path":"generation_pipeline/model_scripts/0_train_vit.py","file_url":"https://github.com/pavlin-policar/llm-chart-generation/blob/HEAD/generation_pipeline/model_scripts/0_train_vit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"58c569e50e886778","code_sha256_prefix":"58c569e50e886778","mcp_get_code":{"code_sha256":"58c569e50e886778"}},{"arxiv_id":"2602.20528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-20528","title":"Stop-Think-AutoRegress: Language Modeling with Latent Diffusion Planning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"justinlovelace/STAR-LDM","path":"star_ldm/diffusion/noise_schedule.py","file_url":"https://github.com/justinlovelace/STAR-LDM/blob/HEAD/star_ldm/diffusion/noise_schedule.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":"76904d8438fcca95","code_sha256_prefix":"76904d8438fcca95","mcp_get_code":{"code_sha256":"76904d8438fcca95"}},{"arxiv_id":"2410.14488","arxiv_id_is_arxiv":true,"paper":"/paper/ant-adaptive-noise-schedule-for-time-series","title":"ANT: Adaptive Noise Schedule for Time Series Diffusion Models","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seunghan96/ant","path":"src/ANT/model/diffusion/_base_cosine2.py","file_url":"https://github.com/seunghan96/ant/blob/HEAD/src/ANT/model/diffusion/_base_cosine2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seunghan96/ant when it was checked","code_sha256":"6d962e3bdfa7a509","code_sha256_prefix":"6d962e3bdfa7a509","mcp_get_code":{"code_sha256":"6d962e3bdfa7a509"}},{"arxiv_id":"2410.05601","arxiv_id_is_arxiv":true,"paper":"/paper/refir-grounding-large-restoration-models-with","title":"ReFIR: Grounding Large Restoration Models with Retrieval Augmentation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csguoh/refir","path":"seesr/seesr_register.py","file_url":"https://github.com/csguoh/refir/blob/HEAD/seesr/seesr_register.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, csguoh/refir when it was checked","code_sha256":"775f3bb32c99d24d","code_sha256_prefix":"775f3bb32c99d24d","mcp_get_code":{"code_sha256":"775f3bb32c99d24d"}},{"arxiv_id":"2408.04220","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-guided-language-modeling","title":"Diffusion Guided Language Modeling","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justinlovelace/diffusion-guided-lm","path":"diffusion/noise_schedule.py","file_url":"https://github.com/justinlovelace/diffusion-guided-lm/blob/HEAD/diffusion/noise_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d0ae3a51abe89ef","code_sha256_prefix":"1d0ae3a51abe89ef","mcp_get_code":{"code_sha256":"1d0ae3a51abe89ef"}},{"arxiv_id":"2402.15391","arxiv_id_is_arxiv":true,"paper":"/paper/genie-generative-interactive-environments","title":"Genie: Generative Interactive Environments","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1x-technologies/1xgpt","path":"genie/st_mask_git.py","file_url":"https://github.com/1x-technologies/1xgpt/blob/HEAD/genie/st_mask_git.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23668633d768fb0e","code_sha256_prefix":"23668633d768fb0e","mcp_get_code":{"code_sha256":"23668633d768fb0e"}},{"arxiv_id":"2303.08888","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-segmentation-with-conditional","title":"Stochastic Segmentation with Conditional Categorical Diffusion Models","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"larsdoorenbos/ccdm-stochastic-segmentation","path":"ddpm/models/diffusion_denoising.py","file_url":"https://github.com/larsdoorenbos/ccdm-stochastic-segmentation/blob/HEAD/ddpm/models/diffusion_denoising.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8fe4b00f6864101e","code_sha256_prefix":"8fe4b00f6864101e","mcp_get_code":{"code_sha256":"8fe4b00f6864101e"}},{"arxiv_id":"2212.09462","arxiv_id_is_arxiv":true,"paper":"/paper/latent-diffusion-for-language-generation-1","title":"Latent Diffusion for Language Generation","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justinlovelace/latent-diffusion-for-language","path":"diffusion/text_denoising_diffusion.py","file_url":"https://github.com/justinlovelace/latent-diffusion-for-language/blob/HEAD/diffusion/text_denoising_diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"59dbcc3beaee75d7","code_sha256_prefix":"59dbcc3beaee75d7","mcp_get_code":{"code_sha256":"59dbcc3beaee75d7"}},{"arxiv_id":"2210.10318","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-bernoulli-rbms-without-tears","title":"Gaussian-Bernoulli RBMs Without Tears","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrjconan/grbm","path":"utils.py","file_url":"https://github.com/lrjconan/grbm/blob/HEAD/utils.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":"e21c52d11c1a6771","code_sha256_prefix":"e21c52d11c1a6771","mcp_get_code":{"code_sha256":"e21c52d11c1a6771"}},{"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":"yizhe-ang/AdaMatch-PyTorch","path":"trainers/utils.py","file_url":"https://github.com/yizhe-ang/AdaMatch-PyTorch/blob/HEAD/trainers/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90da0a5322508429","code_sha256_prefix":"90da0a5322508429","mcp_get_code":{"code_sha256":"90da0a5322508429"}},{"arxiv_id":"2005.05719","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-state-dependent-exploration-for","title":"Smooth Exploration for Robotic Reinforcement Learning","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markub3327/rl-toolkit","path":"rl_toolkit/networks/callbacks/lr.py","file_url":"https://github.com/markub3327/rl-toolkit/blob/HEAD/rl_toolkit/networks/callbacks/lr.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":"38aa9c2f06df49b7","code_sha256_prefix":"38aa9c2f06df49b7","mcp_get_code":{"code_sha256":"38aa9c2f06df49b7"}},{"arxiv_id":"1802.09477","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markub3327/rl-agent","path":"rl_toolkit/networks/callbacks/lr.py","file_url":"https://github.com/markub3327/rl-agent/blob/HEAD/rl_toolkit/networks/callbacks/lr.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":"38aa9c2f06df49b7","code_sha256_prefix":"38aa9c2f06df49b7","mcp_get_code":{"code_sha256":"38aa9c2f06df49b7"}}],"record_sha256":"00fe089071271f85ee93fb4a8bdb32f936fd0626f61b87aed9dcba6b02343f77","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}