{"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/get-image-transform","entry":"get_image_transform","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":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"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":1,"ran_fixture":3,"ran":2,"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":"2605.07950","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07950","title":"Slowly Annealed Langevin Dynamics: Theory and Applications to Training-Free Guided Generation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anitan0925/sald","path":"sald_FM_SD35/rewards.py","file_url":"https://github.com/anitan0925/sald/blob/HEAD/sald_FM_SD35/rewards.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"315bbcfd462a106b","code_sha256_prefix":"315bbcfd462a106b","mcp_get_code":{"code_sha256":"315bbcfd462a106b"}},{"arxiv_id":"2603.18488","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18488","title":"TexEditor: Structure-Preserving Text-Driven Texture Editing","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"KlingAIResearch/TexEditor","path":"flow_grpo/clip_scorer.py","file_url":"https://github.com/KlingAIResearch/TexEditor/blob/HEAD/flow_grpo/clip_scorer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d0c29e5ba66b093","code_sha256_prefix":"1d0c29e5ba66b093","mcp_get_code":{"code_sha256":"1d0c29e5ba66b093"}},{"arxiv_id":"2602.22809","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22809","title":"PhotoAgent: Exploratory Visual Aesthetic Planning with Large Vision Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RE-N-Y/imscore","path":"src/imscore/utils.py","file_url":"https://github.com/RE-N-Y/imscore/blob/HEAD/src/imscore/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, RE-N-Y/imscore when it was checked","code_sha256":"eb6ffbb242517263","code_sha256_prefix":"eb6ffbb242517263","mcp_get_code":{"code_sha256":"eb6ffbb242517263"}},{"arxiv_id":"2505.05470","arxiv_id_is_arxiv":true,"paper":"/paper/flow-grpo-training-flow-matching-models-via","title":"Flow-GRPO: Training Flow Matching Models via Online RL","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan123/flow_grpo","path":"flow_grpo/clip_scorer.py","file_url":"https://github.com/yifan123/flow_grpo/blob/HEAD/flow_grpo/clip_scorer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d0c29e5ba66b093","code_sha256_prefix":"1d0c29e5ba66b093","mcp_get_code":{"code_sha256":"1d0c29e5ba66b093"}},{"arxiv_id":"2407.01812","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-diffusion-policy","title":"Equivariant Diffusion Policy","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pointW/equidiff","path":"equi_diffpo/common/cv2_util.py","file_url":"https://github.com/pointW/equidiff/blob/HEAD/equi_diffpo/common/cv2_util.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":"dde317225c508d01","code_sha256_prefix":"dde317225c508d01","mcp_get_code":{"code_sha256":"dde317225c508d01"}},{"arxiv_id":"2406.04806","arxiv_id_is_arxiv":true,"paper":"/paper/tedi-policy-temporally-entangled-diffusion","title":"Streaming Diffusion Policy: Fast Policy Synthesis with Variable Noise Diffusion Models","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Streaming-Diffusion-Policy/streaming_diffusion_policy","path":"diffusion_policy/common/cv2_util.py","file_url":"https://github.com/Streaming-Diffusion-Policy/streaming_diffusion_policy/blob/HEAD/diffusion_policy/common/cv2_util.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":"dde317225c508d01","code_sha256_prefix":"dde317225c508d01","mcp_get_code":{"code_sha256":"dde317225c508d01"}},{"arxiv_id":"2405.17403","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-time-steps-is-worthy-of","title":"A Closer Look at Time Steps is Worthy of Triple Speed-Up for Diffusion Model Training","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1zeryu/speed","path":"speed/dataset/transform.py","file_url":"https://github.com/1zeryu/speed/blob/HEAD/speed/dataset/transform.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"debdeb32aa1aa3e0","code_sha256_prefix":"debdeb32aa1aa3e0","mcp_get_code":{"code_sha256":"debdeb32aa1aa3e0"}},{"arxiv_id":"2303.04137","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-policy-visuomotor-policy-learning","title":"Diffusion Policy: Visuomotor Policy Learning via Action Diffusion","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"real-stanford/diffusion_policy","path":"diffusion_policy/common/cv2_util.py","file_url":"https://github.com/real-stanford/diffusion_policy/blob/HEAD/diffusion_policy/common/cv2_util.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":"dde317225c508d01","code_sha256_prefix":"dde317225c508d01","mcp_get_code":{"code_sha256":"dde317225c508d01"}},{"arxiv_id":"2205.14100","arxiv_id_is_arxiv":true,"paper":"/paper/git-a-generative-image-to-text-transformer","title":"GIT: A Generative Image-to-text Transformer for Vision and Language","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/GenerativeImage2Text","path":"generativeimage2text/inference.py","file_url":"https://github.com/microsoft/GenerativeImage2Text/blob/HEAD/generativeimage2text/inference.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":"2012616da59774c7","code_sha256_prefix":"2012616da59774c7","mcp_get_code":{"code_sha256":"2012616da59774c7"}}],"record_sha256":"84821c0f24276ce878e9bf32ca107bbd3f3a108e7b7b5608eb8180d3739f0c99","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}