{"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/log-validation","entry":"log_validation","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":7,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":7},"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":"2510.04668","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-04668","title":"ConceptSplit: Decoupled Multi-Concept Personalization of Diffusion Models via Token-wise Adaptation and Attention Disentanglement","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"KU-VGI/ConceptSplit","path":"training_scripts/train_dreambooth_lora_sd3.py","file_url":"https://github.com/KU-VGI/ConceptSplit/blob/HEAD/training_scripts/train_dreambooth_lora_sd3.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":"5d92a0a218f30ecd","code_sha256_prefix":"5d92a0a218f30ecd","mcp_get_code":{"code_sha256":"5d92a0a218f30ecd"}},{"arxiv_id":"2502.07225","arxiv_id_is_arxiv":true,"paper":"/paper/cat-contrastive-adversarial-training-for","title":"CAT: Contrastive Adversarial Training for Evaluating the Robustness of Protective Perturbations in Latent Diffusion Models","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"senp98/cat","path":"code/finetune_cat_adapter/train_cat_adapter.py","file_url":"https://github.com/senp98/cat/blob/HEAD/code/finetune_cat_adapter/train_cat_adapter.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":"016374a7e217bff3","code_sha256_prefix":"016374a7e217bff3","mcp_get_code":{"code_sha256":"016374a7e217bff3"}},{"arxiv_id":"2502.07225","arxiv_id_is_arxiv":true,"paper":"/paper/cat-contrastive-adversarial-training-for","title":"CAT: Contrastive Adversarial Training for Evaluating the Robustness of Protective Perturbations in Latent Diffusion Models","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"senp98/cat","path":"code/finetune_lora_cat/train_lora_cat.py","file_url":"https://github.com/senp98/cat/blob/HEAD/code/finetune_lora_cat/train_lora_cat.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":"1f1d2b9b8c5b51f3","code_sha256_prefix":"1f1d2b9b8c5b51f3","mcp_get_code":{"code_sha256":"1f1d2b9b8c5b51f3"}},{"arxiv_id":"2412.16112","arxiv_id_is_arxiv":true,"paper":"/paper/clear-conv-like-linearization-revs-pre","title":"CLEAR: Conv-Like Linearization Revs Pre-Trained Diffusion Transformers Up","date":"2024-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huage001/clear","path":"distill.py","file_url":"https://github.com/huage001/clear/blob/HEAD/distill.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":"8affca81b78ce6f7","code_sha256_prefix":"8affca81b78ce6f7","mcp_get_code":{"code_sha256":"8affca81b78ce6f7"}},{"arxiv_id":"2411.17945","arxiv_id_is_arxiv":true,"paper":"/paper/marvel-40m-multi-level-visual-elaboration-for","title":"MARVEL-40M+: Multi-Level Visual Elaboration for High-Fidelity Text-to-3D Content Creation","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SadilKhan/MARVEL-FX3D","path":"src/fine_tuning/lora_sd3.py","file_url":"https://github.com/SadilKhan/MARVEL-FX3D/blob/HEAD/src/fine_tuning/lora_sd3.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":"5d92a0a218f30ecd","code_sha256_prefix":"5d92a0a218f30ecd","mcp_get_code":{"code_sha256":"5d92a0a218f30ecd"}},{"arxiv_id":"2409.01437","arxiv_id_is_arxiv":true,"paper":"/paper/kvasir-vqa-a-text-image-pair-gi-tract-dataset","title":"Kvasir-VQA: A Text-Image Pair GI Tract Dataset","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simula/Kvasir-VQA","path":"imagen/fine_tune_dreambooth_lora_sd3.py","file_url":"https://github.com/simula/Kvasir-VQA/blob/HEAD/imagen/fine_tune_dreambooth_lora_sd3.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, simula/Kvasir-VQA when it was checked","code_sha256":"5d92a0a218f30ecd","code_sha256_prefix":"5d92a0a218f30ecd","mcp_get_code":{"code_sha256":"5d92a0a218f30ecd"}},{"arxiv_id":"2409.01347","arxiv_id_is_arxiv":true,"paper":"/paper/target-driven-distillation-consistency","title":"Target-Driven Distillation: Consistency Distillation with Target Timestep Selection and Decoupled Guidance","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RedAIGC/Target-Driven-Distillation","path":"train/FLUX/train_tdd.py","file_url":"https://github.com/RedAIGC/Target-Driven-Distillation/blob/HEAD/train/FLUX/train_tdd.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, RedAIGC/Target-Driven-Distillation when it was checked","code_sha256":"b9f150262f5c69ea","code_sha256_prefix":"b9f150262f5c69ea","mcp_get_code":{"code_sha256":"b9f150262f5c69ea"}},{"arxiv_id":"2409.01347","arxiv_id_is_arxiv":true,"paper":"/paper/target-driven-distillation-consistency","title":"Target-Driven Distillation: Consistency Distillation with Target Timestep Selection and Decoupled Guidance","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RedAIGC/Target-Driven-Distillation","path":"train/FLUX/train_tdd_adv.py","file_url":"https://github.com/RedAIGC/Target-Driven-Distillation/blob/HEAD/train/FLUX/train_tdd_adv.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, RedAIGC/Target-Driven-Distillation when it was checked","code_sha256":"64cf7be3b1068e77","code_sha256_prefix":"64cf7be3b1068e77","mcp_get_code":{"code_sha256":"64cf7be3b1068e77"}},{"arxiv_id":"Huang_ArtEditor_Learning_Customized_Instructional_Image_Editor_from_Few-Shot_Examples_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_ArtEditor_Learning_Customized_Instructional_Image_Editor_from_Few-Shot_Examples_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"showlab/PhotoDoodle","path":"train_lora_flux_pe.py","file_url":"https://github.com/showlab/PhotoDoodle/blob/HEAD/train_lora_flux_pe.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":"dafff6b8776a9e27","code_sha256_prefix":"dafff6b8776a9e27","mcp_get_code":{"code_sha256":"dafff6b8776a9e27"}}],"record_sha256":"bfa0ed640a39035fc2abf8052ef81dd1303da0c2e6d47cec51ccf94fd5363d75","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}