{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/rearrange","entry":"rearrange","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":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":6,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"unverified":2},"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":"2309.03350","paper":"/paper/relay-diffusion-unifying-diffusion-process-1","title":"Relay Diffusion: Unifying diffusion process across resolutions for image synthesis","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/RelayDiffusion","path":"blurring.py","file_url":"https://github.com/THUDM/RelayDiffusion/blob/HEAD/blurring.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a229189b8d4631c3","mcp_get_code":{"code_sha256":"a229189b8d4631c3"}},{"arxiv_id":"2307.15324","paper":"/paper/taskexpert-dynamically-assembling-multi-task","title":"TaskExpert: Dynamically Assembling Multi-Task Representations with Memorial Mixture-of-Experts","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prismformore/multi-task-transformer","path":"TaskPrompter/models/transformers/taskprompter.py","file_url":"https://github.com/prismformore/multi-task-transformer/blob/HEAD/TaskPrompter/models/transformers/taskprompter.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e10210303b061a9","mcp_get_code":{"code_sha256":"2e10210303b061a9"}},{"arxiv_id":"2111.09883","paper":"/paper/swin-transformer-v2-scaling-up-capacity-and","title":"Swin Transformer V2: Scaling Up Capacity and Resolution","date":"2021-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunnYu/x-transformers-paddle","path":"einops/einops.py","file_url":"https://github.com/JunnYu/x-transformers-paddle/blob/HEAD/einops/einops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"942acecd8aa049a5","mcp_get_code":{"code_sha256":"942acecd8aa049a5"}},{"arxiv_id":"2006.11239","paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvyufeng/denoising-diffusion-mindspore","path":"ddm/ops.py","file_url":"https://github.com/lvyufeng/denoising-diffusion-mindspore/blob/HEAD/ddm/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"907096338f4aeb9d","mcp_get_code":{"code_sha256":"907096338f4aeb9d"}},{"arxiv_id":"2001.09522","paper":"/paper/taxoexpan-self-supervised-taxonomy-expansion","title":"TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Network","date":"2020-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mickeysjm/taxoexpan","path":"test_fast.py","file_url":"https://github.com/mickeysjm/taxoexpan/blob/HEAD/test_fast.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c298f48760d30d1c","mcp_get_code":{"code_sha256":"c298f48760d30d1c"}},{"arxiv_id":"1206.6474","paper":"/paper/estimation-of-simultaneously-sparse-and-low","title":"Estimation of Simultaneously Sparse and Low Rank Matrices","date":"2012-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmantoux/sparse-low-rank-decomposition","path":"example_airline.py","file_url":"https://github.com/cmantoux/sparse-low-rank-decomposition/blob/HEAD/example_airline.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cc8d27da20d098a8","mcp_get_code":{"code_sha256":"cc8d27da20d098a8"}}]}