{"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/attn-forward","entry":"attn_forward","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":0,"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":4,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":0,"ran":0,"unverified":2},"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":"2609.15120","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-15120","title":"DNF-SR: Dual-Input and Negative-Aware Feature Fine-Tuning for Real-World Image Super-Resolution","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"SHH-Han/DNF-SR","path":"infer/vaehook.py","file_url":"https://github.com/SHH-Han/DNF-SR/blob/HEAD/infer/vaehook.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, SHH-Han/DNF-SR when it was checked","code_sha256":"bc23635609cf5e46","code_sha256_prefix":"bc23635609cf5e46","mcp_get_code":{"code_sha256":"bc23635609cf5e46"}},{"arxiv_id":"2506.21416","arxiv_id_is_arxiv":true,"paper":"/paper/xverse-consistent-multi-subject-control-of","title":"XVerse: Consistent Multi-Subject Control of Identity and Semantic Attributes via DiT Modulation","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/xverse","path":"src/flux/block.py","file_url":"https://github.com/bytedance/xverse/blob/HEAD/src/flux/block.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":"6d89dc3ce9ef7ba2","code_sha256_prefix":"6d89dc3ce9ef7ba2","mcp_get_code":{"code_sha256":"6d89dc3ce9ef7ba2"}},{"arxiv_id":"2505.18600","arxiv_id_is_arxiv":true,"paper":"/paper/chain-of-zoom-extreme-super-resolution-via","title":"Chain-of-Zoom: Extreme Super-Resolution via Scale Autoregression and Preference Alignment","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cswry/OSEDiff","path":"my_utils/vaehook.py","file_url":"https://github.com/cswry/OSEDiff/blob/HEAD/my_utils/vaehook.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":"bc23635609cf5e46","code_sha256_prefix":"bc23635609cf5e46","mcp_get_code":{"code_sha256":"bc23635609cf5e46"}},{"arxiv_id":"2503.09277","arxiv_id_is_arxiv":true,"paper":"/paper/unicombine-unified-multi-conditional","title":"UniCombine: Unified Multi-Conditional Combination with Diffusion Transformer","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xuan-World/UniCombine","path":"src/UniCombineTransformerBlock.py","file_url":"https://github.com/Xuan-World/UniCombine/blob/HEAD/src/UniCombineTransformerBlock.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Xuan-World/UniCombine, is not in the permissive set Syntology serves inline","code_sha256":"d090e80ac487d286","code_sha256_prefix":"d090e80ac487d286","mcp_get_code":{"code_sha256":"d090e80ac487d286"}},{"arxiv_id":"2412.03017","arxiv_id_is_arxiv":true,"paper":"/paper/pixel-level-and-semantic-level-adjustable","title":"Pixel-level and Semantic-level Adjustable Super-resolution: A Dual-LoRA Approach","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cswry/osediff","path":"my_utils/vaehook.py","file_url":"https://github.com/cswry/osediff/blob/HEAD/my_utils/vaehook.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":"174fab602409ffc2","code_sha256_prefix":"174fab602409ffc2","mcp_get_code":{"code_sha256":"174fab602409ffc2"}},{"arxiv_id":"2411.17163","arxiv_id_is_arxiv":true,"paper":"/paper/osdface-one-step-diffusion-model-for-face","title":"OSDFace: One-Step Diffusion Model for Face Restoration","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkwang28/osdface","path":"utils/vaehook.py","file_url":"https://github.com/jkwang28/osdface/blob/HEAD/utils/vaehook.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, jkwang28/osdface when it was checked","code_sha256":"174fab602409ffc2","code_sha256_prefix":"174fab602409ffc2","mcp_get_code":{"code_sha256":"174fab602409ffc2"}}],"record_sha256":"a00f0216277d3b21895c0cfe0776e0da79cd8c49f7facb8a1762b40f6b8bffc1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}