{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/tokenize-captions","entry":"tokenize_captions","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2409.08258","paper":"/paper/improving-virtual-try-on-with-garment-focused","title":"Improving Virtual Try-On with Garment-focused Diffusion Models","date":"2024-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siqi0905/gardiff","path":"src/inf.py","file_url":"https://github.com/siqi0905/gardiff/blob/HEAD/src/inf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c29a833ec398ebd7","mcp_get_code":{"code_sha256":"c29a833ec398ebd7"}},{"arxiv_id":"2408.14176","paper":"/paper/swiftbrush-v2-make-your-one-step-diffusion","title":"SwiftBrush v2: Make Your One-step Diffusion Model Better Than Its Teacher","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinairesearch/swiftbrushv2","path":"infer_by_prompt.py","file_url":"https://github.com/vinairesearch/swiftbrushv2/blob/HEAD/infer_by_prompt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"b979e8faa64c0d12","mcp_get_code":{"code_sha256":"b979e8faa64c0d12"}},{"arxiv_id":"2407.04842","paper":"/paper/mj-bench-is-your-multimodal-reward-model","title":"MJ-Bench: Is Your Multimodal Reward Model Really a Good Judge for Text-to-Image Generation?","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MJ-Bench/MJ-Bench","path":"experimental/dpo_finetune.py","file_url":"https://github.com/MJ-Bench/MJ-Bench/blob/HEAD/experimental/dpo_finetune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb28e9ec2502d447","mcp_get_code":{"code_sha256":"eb28e9ec2502d447"}},{"arxiv_id":"2406.01561","paper":"/paper/long-and-short-guidance-in-score-identity","title":"Long and Short Guidance in Score identity Distillation for One-Step Text-to-Image Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuanzhou/SiD-LSG","path":"training/sid_sd_util.py","file_url":"https://github.com/mingyuanzhou/SiD-LSG/blob/HEAD/training/sid_sd_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a7ee9e9cfc473967","mcp_get_code":{"code_sha256":"a7ee9e9cfc473967"}},{"arxiv_id":"2404.04465","paper":"/paper/aligning-diffusion-models-by-optimizing-human","title":"Aligning Diffusion Models by Optimizing Human Utility","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"28cae3111ef3900a","mcp_get_code":{"code_sha256":"28cae3111ef3900a"}},{"arxiv_id":"2402.01306","paper":"/paper/kto-model-alignment-as-prospect-theoretic","title":"KTO: Model Alignment as Prospect Theoretic Optimization","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacklishufan/diffusion-kto","path":"train_kto_sd_v1.5.py","file_url":"https://github.com/jacklishufan/diffusion-kto/blob/HEAD/train_kto_sd_v1.5.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"28cae3111ef3900a","mcp_get_code":{"code_sha256":"28cae3111ef3900a"}}]}