{"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/isinstance-str","entry":"isinstance_str","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":12,"n_papers_ran_no_instrument_failure":12,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":6,"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":4,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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.09753","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-09753","title":"Unified Backbone Refinement for Diffusion Models via Internal-Latent Analysis","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ChenyangSi/FreeU","path":"demo/free_lunch_utils.py","file_url":"https://github.com/ChenyangSi/FreeU/blob/HEAD/demo/free_lunch_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2509.10918","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-10918","title":"ToMA: Token Merge with Attention for Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"WenboLuu/ToMA","path":"toma/patch.py","file_url":"https://github.com/WenboLuu/ToMA/blob/HEAD/toma/patch.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, WenboLuu/ToMA when it was checked","code_sha256":"4d43c39d84b84472","code_sha256_prefix":"4d43c39d84b84472","mcp_get_code":{"code_sha256":"4d43c39d84b84472"}},{"arxiv_id":"2504.02451","arxiv_id_is_arxiv":true,"paper":"/paper/conmo-controllable-motion-disentanglement-and","title":"ConMo: Controllable Motion Disentanglement and Recomposition for Zero-Shot Motion Transfer","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andyplus1/ConMo","path":"utilities/guidance_utils_multimasks_interfere_reposition.py","file_url":"https://github.com/Andyplus1/ConMo/blob/HEAD/utilities/guidance_utils_multimasks_interfere_reposition.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Andyplus1/ConMo when it was checked","code_sha256":"f9cf6a55046087bb","code_sha256_prefix":"f9cf6a55046087bb","mcp_get_code":{"code_sha256":"f9cf6a55046087bb"}},{"arxiv_id":"2501.00946","arxiv_id_is_arxiv":true,"paper":"/paper/cached-adaptive-token-merging-dynamic-token","title":"Cached Adaptive Token Merging: Dynamic Token Reduction and Redundant Computation Elimination in Diffusion Model","date":"2025-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"fadc1f6d2d7dd9fa","code_sha256_prefix":"fadc1f6d2d7dd9fa","mcp_get_code":{"code_sha256":"fadc1f6d2d7dd9fa"}},{"arxiv_id":"2412.12974","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-eraser-unleashing-diffusion-model-s","title":"Attentive Eraser: Unleashing Diffusion Model's Object Removal Potential via Self-Attention Redirection Guidance","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonym0u3/attentiveeraser","path":"utils.py","file_url":"https://github.com/anonym0u3/attentiveeraser/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2410.02369","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-the-diffusion","title":"Unleashing the Potential of the Diffusion Model in Few-shot Semantic Segmentation","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-uofa/diffews","path":"diffews/models/unet_2d_condition.py","file_url":"https://github.com/aim-uofa/diffews/blob/HEAD/diffews/models/unet_2d_condition.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aim-uofa/diffews when it was checked","code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2410.02369","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-the-diffusion","title":"Unleashing the Potential of the Diffusion Model in Few-shot Semantic Segmentation","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-uofa/diffews","path":"diffews/models/unet_2d_condition_attn.py","file_url":"https://github.com/aim-uofa/diffews/blob/HEAD/diffews/models/unet_2d_condition_attn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aim-uofa/diffews when it was checked","code_sha256":"4d43c39d84b84472","code_sha256_prefix":"4d43c39d84b84472","mcp_get_code":{"code_sha256":"4d43c39d84b84472"}},{"arxiv_id":"2405.12211","arxiv_id_is_arxiv":true,"paper":"/paper/slicedit-zero-shot-video-editing-with-text-to","title":"Slicedit: Zero-Shot Video Editing With Text-to-Image Diffusion Models Using Spatio-Temporal Slices","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fallenshock/Slicedit","path":"Slicedit/inversion_utils.py","file_url":"https://github.com/fallenshock/Slicedit/blob/HEAD/Slicedit/inversion_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2404.01050","arxiv_id_is_arxiv":true,"paper":"/paper/drag-your-noise-interactive-point-based","title":"Drag Your Noise: Interactive Point-based Editing via Diffusion Semantic Propagation","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haofengl/dragnoise","path":"utils/freeu_utils.py","file_url":"https://github.com/haofengl/dragnoise/blob/HEAD/utils/freeu_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, haofengl/dragnoise when it was checked","code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2312.10656","arxiv_id_is_arxiv":true,"paper":"/paper/vidtome-video-token-merging-for-zero-shot","title":"VidToMe: Video Token Merging for Zero-Shot Video Editing","date":"2023-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixirui142/VidToMe","path":"vidtome/utils.py","file_url":"https://github.com/lixirui142/VidToMe/blob/HEAD/vidtome/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2312.02212","arxiv_id_is_arxiv":true,"paper":"/paper/portrait-diffusion-training-free-face","title":"Portrait Diffusion: Training-free Face Stylization with Chain-of-Painting","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liujin112/portraitdiffusion","path":"utils/free_lunch_utils.py","file_url":"https://github.com/liujin112/portraitdiffusion/blob/HEAD/utils/free_lunch_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2307.10373","arxiv_id_is_arxiv":true,"paper":"/paper/tokenflow-consistent-diffusion-features-for","title":"TokenFlow: Consistent Diffusion Features for Consistent Video Editing","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omerbt/tokenflow","path":"util.py","file_url":"https://github.com/omerbt/tokenflow/blob/HEAD/util.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd5d5067de871c97","code_sha256_prefix":"cd5d5067de871c97","mcp_get_code":{"code_sha256":"cd5d5067de871c97"}},{"arxiv_id":"2303.17604","arxiv_id_is_arxiv":true,"paper":"/paper/token-merging-for-fast-stable-diffusion","title":"Token Merging for Fast Stable Diffusion","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omidiu/ca_tome","path":"src/ca_tome/utils.py","file_url":"https://github.com/omidiu/ca_tome/blob/HEAD/src/ca_tome/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fadc1f6d2d7dd9fa","code_sha256_prefix":"fadc1f6d2d7dd9fa","mcp_get_code":{"code_sha256":"fadc1f6d2d7dd9fa"}}],"record_sha256":"4434712a00d03bc903f679bc4851fd0c5f15ad61ecd72081738721ec14fcf333","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}