{"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/get-generator","entry":"get_generator","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":11,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":4,"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":3,"ran_fixture":0,"ran":2,"unverified":4},"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":"2605.22644","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22644","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"brain-lab-research/SGDiffusion","path":"src/datamodelopt/core/seed.py","file_url":"https://github.com/brain-lab-research/SGDiffusion/blob/HEAD/src/datamodelopt/core/seed.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, brain-lab-research/SGDiffusion when it was checked","code_sha256":"cbc497fd8c503d83","code_sha256_prefix":"cbc497fd8c503d83","mcp_get_code":{"code_sha256":"cbc497fd8c503d83"}},{"arxiv_id":"2411.08378","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-distillation-for-diffusion","title":"Physics Informed Distillation for Diffusion Models","date":"2024-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pantheon5100/pid_diffusion","path":"cm/random_util.py","file_url":"https://github.com/pantheon5100/pid_diffusion/blob/HEAD/cm/random_util.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":"84423ecf52775c17","code_sha256_prefix":"84423ecf52775c17","mcp_get_code":{"code_sha256":"84423ecf52775c17"}},{"arxiv_id":"2407.20784","arxiv_id_is_arxiv":true,"paper":"/paper/inverse-problems-with-diffusion-models-a-map","title":"Inverse Problems with Diffusion Models: A MAP Estimation Perspective","date":"2024-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guthasaibharathchandra/MAP-GA","path":"cm/random_util.py","file_url":"https://github.com/guthasaibharathchandra/MAP-GA/blob/HEAD/cm/random_util.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, guthasaibharathchandra/MAP-GA when it was checked","code_sha256":"84423ecf52775c17","code_sha256_prefix":"84423ecf52775c17","mcp_get_code":{"code_sha256":"84423ecf52775c17"}},{"arxiv_id":"2405.13722","arxiv_id_is_arxiv":true,"paper":"/paper/instadrag-lightning-fast-and-accurate-drag","title":"LightningDrag: Lightning Fast and Accurate Drag-based Image Editing Emerging from Videos","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magic-research/lightningdrag","path":"utils/utils.py","file_url":"https://github.com/magic-research/lightningdrag/blob/HEAD/utils/utils.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":"58fbb0ecf11e3cd5","code_sha256_prefix":"58fbb0ecf11e3cd5","mcp_get_code":{"code_sha256":"58fbb0ecf11e3cd5"}},{"arxiv_id":"2403.04808","arxiv_id_is_arxiv":true,"paper":"/paper/watermax-breaking-the-llm-watermark","title":"WaterMax: breaking the LLM watermark detectability-robustness-quality trade-off","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eva-giboulot/watermax","path":"test_sentence_wm.py","file_url":"https://github.com/eva-giboulot/watermax/blob/HEAD/test_sentence_wm.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, eva-giboulot/watermax when it was checked","code_sha256":"f59da376d411ca93","code_sha256_prefix":"f59da376d411ca93","mcp_get_code":{"code_sha256":"f59da376d411ca93"}},{"arxiv_id":"2309.17164","arxiv_id_is_arxiv":true,"paper":"/paper/retail-786k-a-large-scale-dataset-for-visual","title":"Retail-786k: a Large-Scale Dataset for Visual Entity Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"retail786k/retail786k-dataset","path":"code/classification/train_models.py","file_url":"https://github.com/retail786k/retail786k-dataset/blob/HEAD/code/classification/train_models.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, retail786k/retail786k-dataset when it was checked","code_sha256":"2fa60559f83df4bc","code_sha256_prefix":"2fa60559f83df4bc","mcp_get_code":{"code_sha256":"2fa60559f83df4bc"}},{"arxiv_id":"2308.02223","arxiv_id_is_arxiv":true,"paper":"/paper/esrl-efficient-sampling-based-reinforcement","title":"ESRL: Efficient Sampling-based Reinforcement Learning for Sequence Generation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangclnlp/DeepSpeed-Chat-Extension","path":"rlhf_llama/deepspeed_chat/inference/chatbot.py","file_url":"https://github.com/wangclnlp/DeepSpeed-Chat-Extension/blob/HEAD/rlhf_llama/deepspeed_chat/inference/chatbot.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":"01cbaddf368c1af0","code_sha256_prefix":"01cbaddf368c1af0","mcp_get_code":{"code_sha256":"01cbaddf368c1af0"}},{"arxiv_id":"2303.01469","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-models","title":"Consistency Models","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/consistency_models","path":"cm/random_util.py","file_url":"https://github.com/openai/consistency_models/blob/HEAD/cm/random_util.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":"84423ecf52775c17","code_sha256_prefix":"84423ecf52775c17","mcp_get_code":{"code_sha256":"84423ecf52775c17"}},{"arxiv_id":"2105.13648","arxiv_id_is_arxiv":true,"paper":"/paper/cross-lingual-abstractive-summarization-with","title":"Cross-Lingual Abstractive Summarization with Limited Parallel Resources","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WoodenWhite/MCLAS","path":"src/models/model_builder.py","file_url":"https://github.com/WoodenWhite/MCLAS/blob/HEAD/src/models/model_builder.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":"f274f2d7a3671ced","code_sha256_prefix":"f274f2d7a3671ced","mcp_get_code":{"code_sha256":"f274f2d7a3671ced"}},{"arxiv_id":"1905.13164","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-transformers-for-multi-document","title":"Hierarchical Transformers for Multi-Document Summarization","date":"2019-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpyang/hiersumm","path":"src/abstractive/model_builder.py","file_url":"https://github.com/nlpyang/hiersumm/blob/HEAD/src/abstractive/model_builder.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":"929755107afe4d70","code_sha256_prefix":"929755107afe4d70","mcp_get_code":{"code_sha256":"929755107afe4d70"}},{"arxiv_id":"1703.10593","arxiv_id_is_arxiv":true,"paper":"/paper/unpaired-image-to-image-translation-using","title":"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks","date":"2017-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yex666/cyclegan-in-mindspore","path":"src/models/cycle_gan.py","file_url":"https://github.com/yex666/cyclegan-in-mindspore/blob/HEAD/src/models/cycle_gan.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":"9ba994b8bf7dcc37","code_sha256_prefix":"9ba994b8bf7dcc37","mcp_get_code":{"code_sha256":"9ba994b8bf7dcc37"}}],"record_sha256":"4f914d2754e84bcb6a0f470dda53486fe24866166b6b0dedf44b8b934922ee70","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}