{"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/mask-image","entry":"mask_image","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":6,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":9,"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":2,"ran_fixture":2,"ran":2,"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":"2602.12393","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-12393","title":"Reproducing DragDiffusion: Interactive Point-Based Editing with Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AliSubhan5341/DragDiffusion-TMLR-Reproducibility-Challenge","path":"drag_bench_evaluation/labeling_tool.py","file_url":"https://github.com/AliSubhan5341/DragDiffusion-TMLR-Reproducibility-Challenge/blob/HEAD/drag_bench_evaluation/labeling_tool.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce0fe39e4583a703","code_sha256_prefix":"ce0fe39e4583a703","mcp_get_code":{"code_sha256":"ce0fe39e4583a703"}},{"arxiv_id":"2407.17843","arxiv_id_is_arxiv":true,"paper":"/paper/dragtext-rethinking-text-embedding-in-point","title":"DragText: Rethinking Text Embedding in Point-based Image Editing","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MICV-yonsei/DragText","path":"DragDiffusion/drag_bench_evaluation/labeling_tool.py","file_url":"https://github.com/MICV-yonsei/DragText/blob/HEAD/DragDiffusion/drag_bench_evaluation/labeling_tool.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce0fe39e4583a703","code_sha256_prefix":"ce0fe39e4583a703","mcp_get_code":{"code_sha256":"ce0fe39e4583a703"}},{"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":"drag_bench_evaluation/labeling_tool.py","file_url":"https://github.com/haofengl/dragnoise/blob/HEAD/drag_bench_evaluation/labeling_tool.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, haofengl/dragnoise when it was checked","code_sha256":"ce0fe39e4583a703","code_sha256_prefix":"ce0fe39e4583a703","mcp_get_code":{"code_sha256":"ce0fe39e4583a703"}},{"arxiv_id":"2401.13371","arxiv_id_is_arxiv":true,"paper":"/paper/svarm-iq-efficient-approximation-of-any-order","title":"SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions through Stratification","date":null,"month_inferred_from_arxiv_id":"2024-01","title_source":"archive","repo":"kolpaczki/svarm-iq","path":"precompute_cnn.py","file_url":"https://github.com/kolpaczki/svarm-iq/blob/HEAD/precompute_cnn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, kolpaczki/svarm-iq when it was checked","code_sha256":"449d15c2c93d244c","code_sha256_prefix":"449d15c2c93d244c","mcp_get_code":{"code_sha256":"449d15c2c93d244c"}},{"arxiv_id":"2401.06442","arxiv_id_is_arxiv":true,"paper":"/paper/rotationdrag-point-based-image-editing-with","title":"RotationDrag: Point-based Image Editing with Rotated Diffusion Features","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tony-lowe/rotationdrag","path":"utils/ui_utils.py","file_url":"https://github.com/tony-lowe/rotationdrag/blob/HEAD/utils/ui_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65d6e08df667d6d6","code_sha256_prefix":"65d6e08df667d6d6","mcp_get_code":{"code_sha256":"65d6e08df667d6d6"}},{"arxiv_id":"2312.17172","arxiv_id_is_arxiv":true,"paper":"/paper/unified-io-2-scaling-autoregressive","title":"Unified-IO 2: Scaling Autoregressive Multimodal Models with Vision, Language, Audio, and Action","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/unified-io-2","path":"t5x/examples/unified_io/scripts/dataset_visualize.py","file_url":"https://github.com/allenai/unified-io-2/blob/HEAD/t5x/examples/unified_io/scripts/dataset_visualize.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8c97e690db5c9c8d","code_sha256_prefix":"8c97e690db5c9c8d","mcp_get_code":{"code_sha256":"8c97e690db5c9c8d"}},{"arxiv_id":"2312.02216","arxiv_id_is_arxiv":true,"paper":"/paper/dragvideo-interactive-drag-style-video","title":"DragVideo: Interactive Drag-style Video Editing","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyskywalker/dragvideo-official","path":"DragVideo/utils/ui_utils.py","file_url":"https://github.com/rickyskywalker/dragvideo-official/blob/HEAD/DragVideo/utils/ui_utils.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, rickyskywalker/dragvideo-official when it was checked","code_sha256":"c868d3bf65ca0b82","code_sha256_prefix":"c868d3bf65ca0b82","mcp_get_code":{"code_sha256":"c868d3bf65ca0b82"}},{"arxiv_id":"2102.07364","arxiv_id_is_arxiv":true,"paper":"/paper/intermediate-layer-optimization-for-inverse","title":"Intermediate Layer Optimization for Inverse Problems using Deep Generative Models","date":"2021-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giannisdaras/ilo","path":"prepare_image.py","file_url":"https://github.com/giannisdaras/ilo/blob/HEAD/prepare_image.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, giannisdaras/ilo when it was checked","code_sha256":"25f86ca57a4e9f9c","code_sha256_prefix":"25f86ca57a4e9f9c","mcp_get_code":{"code_sha256":"25f86ca57a4e9f9c"}},{"arxiv_id":"1512.00567","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KyleYoung1997/DNNorDermatologist","path":"Shap_GradCAM_Notebooks/utils.py","file_url":"https://github.com/KyleYoung1997/DNNorDermatologist/blob/HEAD/Shap_GradCAM_Notebooks/utils.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":"c9008a85f4e8d475","code_sha256_prefix":"c9008a85f4e8d475","mcp_get_code":{"code_sha256":"c9008a85f4e8d475"}}],"record_sha256":"e67f34e44a94d59c0dfb868b75b0bd6b99e70b17573c333bad6ffe2b15c257fe","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}