{"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/save-image","entry":"save_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":18,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":18,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":18,"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":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":6,"unverified":8},"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":"2503.09641","arxiv_id_is_arxiv":true,"paper":"/paper/sana-sprint-one-step-diffusion-with","title":"SANA-Sprint: One-Step Diffusion with Continuous-Time Consistency Distillation","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"NVlabs/Sana","path":"app/app_sana_controlnet_hed.py","file_url":"https://github.com/NVlabs/Sana/blob/HEAD/app/app_sana_controlnet_hed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, NVlabs/Sana, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"3b9d90947aa40dd2","code_sha256_prefix":"3b9d90947aa40dd2","mcp_get_code":{"code_sha256":"3b9d90947aa40dd2"}},{"arxiv_id":"2407.00256","arxiv_id_is_arxiv":true,"paper":"/paper/one-prompt-is-not-enough-automated","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts","date":"2024-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruocwang/mixture-of-prompts","path":"mop/src/exp_utils.py","file_url":"https://github.com/ruocwang/mixture-of-prompts/blob/HEAD/mop/src/exp_utils.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":"25ca89c7cda28f21","code_sha256_prefix":"25ca89c7cda28f21","mcp_get_code":{"code_sha256":"25ca89c7cda28f21"}},{"arxiv_id":"2406.18925","arxiv_id_is_arxiv":true,"paper":"/paper/selective-vision-is-the-challenge-for-visual","title":"Selective Vision is the Challenge for Visual Reasoning: A Benchmark for Visual Argument Understanding","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiwanChung/VisArgs","path":"src/visarg/others/utils.py","file_url":"https://github.com/JiwanChung/VisArgs/blob/HEAD/src/visarg/others/utils.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, JiwanChung/VisArgs when it was checked","code_sha256":"d3b76c2a8931dfce","code_sha256_prefix":"d3b76c2a8931dfce","mcp_get_code":{"code_sha256":"d3b76c2a8931dfce"}},{"arxiv_id":"2406.12814","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-multimodal-agents","title":"Dissecting Adversarial Robustness of Multimodal LM Agents","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenWu98/agent-attack","path":"agent_attack/util/image_handling.py","file_url":"https://github.com/ChenWu98/agent-attack/blob/HEAD/agent_attack/util/image_handling.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":"ddec91d5abd56bb7","code_sha256_prefix":"ddec91d5abd56bb7","mcp_get_code":{"code_sha256":"ddec91d5abd56bb7"}},{"arxiv_id":"2405.17111","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-bridge-autoencoders-for","title":"Diffusion Bridge AutoEncoders for Unsupervised Representation Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ckczzj/PDAE","path":"trainer/train_representation_learning.py","file_url":"https://github.com/ckczzj/PDAE/blob/HEAD/trainer/train_representation_learning.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, ckczzj/PDAE when it was checked","code_sha256":"acd70fe09760a8b6","code_sha256_prefix":"acd70fe09760a8b6","mcp_get_code":{"code_sha256":"acd70fe09760a8b6"}},{"arxiv_id":"2405.07510","arxiv_id_is_arxiv":true,"paper":"/paper/perflow-piecewise-rectified-flow-as-universal","title":"PeRFlow: Piecewise Rectified Flow as Universal Plug-and-Play Accelerator","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magic-research/piecewise-rectified-flow","path":"app/Wonder3D/gradio_app_mv.py","file_url":"https://github.com/magic-research/piecewise-rectified-flow/blob/HEAD/app/Wonder3D/gradio_app_mv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f426c133571857ae","code_sha256_prefix":"f426c133571857ae","mcp_get_code":{"code_sha256":"f426c133571857ae"}},{"arxiv_id":"2403.04692","arxiv_id_is_arxiv":true,"paper":"/paper/pixart-s-weak-to-strong-training-of-diffusion","title":"PixArt-Σ: Weak-to-Strong Training of Diffusion Transformer for 4K Text-to-Image Generation","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PixArt-alpha/PixArt-sigma","path":"app/app_pixart_sigma.py","file_url":"https://github.com/PixArt-alpha/PixArt-sigma/blob/HEAD/app/app_pixart_sigma.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":"b5d5cc55585820d9","code_sha256_prefix":"b5d5cc55585820d9","mcp_get_code":{"code_sha256":"b5d5cc55585820d9"}},{"arxiv_id":"2402.04754","arxiv_id_is_arxiv":true,"paper":"/paper/towards-aligned-layout-generation-via","title":"Towards Aligned Layout Generation via Diffusion Model with Aesthetic Constraints","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puar-playground/lace","path":"model_diffusion.py","file_url":"https://github.com/puar-playground/lace/blob/HEAD/model_diffusion.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1795e572a421c31","code_sha256_prefix":"c1795e572a421c31","mcp_get_code":{"code_sha256":"c1795e572a421c31"}},{"arxiv_id":"2311.09939","arxiv_id_is_arxiv":true,"paper":"/paper/red-dot-multimodal-fact-checking-via-relevant","title":"RED-DOT: Multimodal Fact-checking via Relevant Evidence Detection","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevejpapad/relevant-evidence-detection","path":"src/prepare_VERITE.py","file_url":"https://github.com/stevejpapad/relevant-evidence-detection/blob/HEAD/src/prepare_VERITE.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":"7bb0da8062911a6b","code_sha256_prefix":"7bb0da8062911a6b","mcp_get_code":{"code_sha256":"7bb0da8062911a6b"}},{"arxiv_id":"2310.15008","arxiv_id_is_arxiv":true,"paper":"/paper/wonder3d-single-image-to-3d-using-cross","title":"Wonder3D: Single Image to 3D using Cross-Domain Diffusion","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xxlong0/wonder3d","path":"test_mvdiffusion_seq.py","file_url":"https://github.com/xxlong0/wonder3d/blob/HEAD/test_mvdiffusion_seq.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"996bbd8dc616afbd","code_sha256_prefix":"996bbd8dc616afbd","mcp_get_code":{"code_sha256":"996bbd8dc616afbd"}},{"arxiv_id":"2310.00158","arxiv_id_is_arxiv":true,"paper":"/paper/feedback-guided-data-synthesis-for-imbalanced","title":"Feedback-guided Data Synthesis for Imbalanced Classification","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/feedback-guided-data-synthesis","path":"utils_gen.py","file_url":"https://github.com/facebookresearch/feedback-guided-data-synthesis/blob/HEAD/utils_gen.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/feedback-guided-data-synthesis (NOASSERTION)","code_sha256":"d4290215d608d171","code_sha256_prefix":"d4290215d608d171","mcp_get_code":{"code_sha256":"d4290215d608d171"}},{"arxiv_id":"2308.01508","arxiv_id_is_arxiv":true,"paper":"/paper/circumventing-concept-erasure-methods-for","title":"Circumventing Concept Erasure Methods For Text-to-Image Generative Models","date":"2023-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-dice-lab/circumventing-concept-erasure","path":"ac/utils.py","file_url":"https://github.com/nyu-dice-lab/circumventing-concept-erasure/blob/HEAD/ac/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, nyu-dice-lab/circumventing-concept-erasure when it was checked","code_sha256":"023a563c50d5db53","code_sha256_prefix":"023a563c50d5db53","mcp_get_code":{"code_sha256":"023a563c50d5db53"}},{"arxiv_id":"2202.00512","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-distillation-for-fast-sampling-of-1","title":"Progressive Distillation for Fast Sampling of Diffusion Models","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sainzerjj/sferd","path":"diffusion/train_utils.py","file_url":"https://github.com/sainzerjj/sferd/blob/HEAD/diffusion/train_utils.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":"d9b8534277a98f88","code_sha256_prefix":"d9b8534277a98f88","mcp_get_code":{"code_sha256":"d9b8534277a98f88"}},{"arxiv_id":"2103.15726","arxiv_id_is_arxiv":true,"paper":"/paper/slimmable-compressive-autoencoders-for","title":"Slimmable Compressive Autoencoders for Practical Neural Image Compression","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FireFYF/SlimCAE","path":"SlimCAE.py","file_url":"https://github.com/FireFYF/SlimCAE/blob/HEAD/SlimCAE.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":"fd75db48e041c04e","code_sha256_prefix":"fd75db48e041c04e","mcp_get_code":{"code_sha256":"fd75db48e041c04e"}},{"arxiv_id":"2004.09484","arxiv_id_is_arxiv":true,"paper":"/paper/bringing-old-photos-back-to-life","title":"Bringing Old Photos Back to Life","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yasamin-niknam/Image-Restoration","path":"Global/detection.py","file_url":"https://github.com/yasamin-niknam/Image-Restoration/blob/HEAD/Global/detection.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, yasamin-niknam/Image-Restoration, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"8654915f0b73c3ed","code_sha256_prefix":"8654915f0b73c3ed","mcp_get_code":{"code_sha256":"8654915f0b73c3ed"}},{"arxiv_id":"1806.00035","arxiv_id_is_arxiv":true,"paper":"/paper/assessing-generative-models-via-precision-and","title":"Assessing Generative Models via Precision and Recall","date":"2018-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ok1zjf/lbae","path":"image_utils.py","file_url":"https://github.com/ok1zjf/lbae/blob/HEAD/image_utils.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":"afc8d137b43810a4","code_sha256_prefix":"afc8d137b43810a4","mcp_get_code":{"code_sha256":"afc8d137b43810a4"}},{"arxiv_id":"1506.01497","arxiv_id_is_arxiv":true,"paper":"/paper/faster-r-cnn-towards-real-time-object","title":"Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks","date":"2015-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/hrnetv2","path":"src/detecteval.py","file_url":"https://github.com/JoegameZhou/hrnetv2/blob/HEAD/src/detecteval.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":"48409da9351f9c1e","code_sha256_prefix":"48409da9351f9c1e","mcp_get_code":{"code_sha256":"48409da9351f9c1e"}},{"arxiv_id":"Liu_RIATIG_Reliable_and_Imperceptible_Adversarial_Text-to-Image_Generation_With_Natural_Prompts_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Liu_RIATIG_Reliable_and_Imperceptible_Adversarial_Text-to-Image_Generation_With_Natural_Prompts_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WUSTL-CSPL/RIATIG","path":"target_model/min_dalle/image_from_text.py","file_url":"https://github.com/WUSTL-CSPL/RIATIG/blob/HEAD/target_model/min_dalle/image_from_text.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":"de27225af45a8c3b","code_sha256_prefix":"de27225af45a8c3b","mcp_get_code":{"code_sha256":"de27225af45a8c3b"}}],"record_sha256":"6cb271a02e85cc97828e283c098bc3ae2ef4558697494a26ae472e9aacb5bc91","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}