{"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/memoryefficientcrossattention","entry":"MemoryEfficientCrossAttention","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":4,"n_papers_ran_no_instrument_failure":4,"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":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"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":4,"unverified":3},"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":"2410.09400","arxiv_id_is_arxiv":true,"paper":"/paper/ctrlora-an-extensible-and-efficient-framework","title":"CtrLoRA: An Extensible and Efficient Framework for Controllable Image Generation","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyfjason/ctrlora","path":"cldm/cldm_ctrlora_inference.py","file_url":"https://github.com/xyfjason/ctrlora/blob/HEAD/cldm/cldm_ctrlora_inference.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":"f60e775a28631190","code_sha256_prefix":"f60e775a28631190","mcp_get_code":{"code_sha256":"f60e775a28631190"}},{"arxiv_id":"2405.17398","arxiv_id_is_arxiv":true,"paper":"/paper/vista-a-generalizable-driving-world-model","title":"Vista: A Generalizable Driving World Model with High Fidelity and Versatile Controllability","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/vista","path":"vwm/models/diffusion.py","file_url":"https://github.com/opendrivelab/vista/blob/HEAD/vwm/models/diffusion.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":"9a1320c38ff3a00b","code_sha256_prefix":"9a1320c38ff3a00b","mcp_get_code":{"code_sha256":"9a1320c38ff3a00b"}},{"arxiv_id":"2404.11474","arxiv_id_is_arxiv":true,"paper":"/paper/towards-highly-realistic-artistic-style","title":"Towards Highly Realistic Artistic Style Transfer via Stable Diffusion with Step-aware and Layer-aware Prompt","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jamie-Cheung/LSAST","path":"cldm/cldm.py","file_url":"https://github.com/Jamie-Cheung/LSAST/blob/HEAD/cldm/cldm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"713884729e861c62","code_sha256_prefix":"713884729e861c62","mcp_get_code":{"code_sha256":"713884729e861c62"}},{"arxiv_id":"2403.06951","arxiv_id_is_arxiv":true,"paper":"/paper/deadiff-an-efficient-stylization-diffusion","title":"DEADiff: An Efficient Stylization Diffusion Model with Disentangled Representations","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tianhao-Qi/DEADiff_code","path":"ldm/modules/new_attention.py","file_url":"https://github.com/Tianhao-Qi/DEADiff_code/blob/HEAD/ldm/modules/new_attention.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":"3cd09e0c0901addb","code_sha256_prefix":"3cd09e0c0901addb","mcp_get_code":{"code_sha256":"3cd09e0c0901addb"}},{"arxiv_id":"2307.01952","arxiv_id_is_arxiv":true,"paper":"/paper/sdxl-improving-latent-diffusion-models-for","title":"SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stability-ai/generative-models","path":"sgm/modules/diffusionmodules/openaimodel.py","file_url":"https://github.com/stability-ai/generative-models/blob/HEAD/sgm/modules/diffusionmodules/openaimodel.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":"5cbc6286835eafa2","code_sha256_prefix":"5cbc6286835eafa2","mcp_get_code":{"code_sha256":"5cbc6286835eafa2"}},{"arxiv_id":"2305.18259","arxiv_id_is_arxiv":true,"paper":"/paper/glyphcontrol-glyph-conditional-control-for-1","title":"GlyphControl: Glyph Conditional Control for Visual Text Generation","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aigtext/glyphcontrol-release","path":"cldm/cldm.py","file_url":"https://github.com/aigtext/glyphcontrol-release/blob/HEAD/cldm/cldm.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":"2c8910dba7592809","code_sha256_prefix":"2c8910dba7592809","mcp_get_code":{"code_sha256":"2c8910dba7592809"}},{"arxiv_id":"2301.05225","arxiv_id_is_arxiv":true,"paper":"/paper/domain-expansion-of-image-generators","title":"Domain Expansion of Image Generators","date":"2023-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lllyasviel/controlnet","path":"cldm/cldm.py","file_url":"https://github.com/lllyasviel/controlnet/blob/HEAD/cldm/cldm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"77ce242242a53898","code_sha256_prefix":"77ce242242a53898","mcp_get_code":{"code_sha256":"77ce242242a53898"}}],"record_sha256":"4c2dc23931c3e075042caa553316950cadf09febfbcaf9716aebd8bfcb87c297","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}