{"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/apply-permutation","entry":"apply_permutation","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":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":0,"unverified":3},"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":"2601.12922","paper":"/paper/arxiv-2601-12922","title":"Your Privacy Depends on Others: Collusion Vulnerabilities in Individual Differential Privacy","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Johannes-Kaiser/Collusion-Vuln-in-DP","path":"opacus_new/layers/dp_rnn.py","file_url":"https://github.com/Johannes-Kaiser/Collusion-Vuln-in-DP/blob/HEAD/opacus_new/layers/dp_rnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"46783ac8b5216877","mcp_get_code":{"code_sha256":"46783ac8b5216877"}},{"arxiv_id":"2601.08219","paper":"/paper/arxiv-2601-08219","title":"A Preliminary Agentic Framework for Matrix Deflation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Pie115/Agentic-Deflation","path":"Deflation/prompt_gemini.py","file_url":"https://github.com/Pie115/Agentic-Deflation/blob/HEAD/Deflation/prompt_gemini.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e62b82bc18eaf1d9","mcp_get_code":{"code_sha256":"e62b82bc18eaf1d9"}},{"arxiv_id":"2510.21270","paper":"/paper/arxiv-2510-21270","title":"Sparser Block-Sparse Attention via Token Permutation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"xinghaow99/pbs-attn","path":"pbs_attn/src/permute_states.py","file_url":"https://github.com/xinghaow99/pbs-attn/blob/HEAD/pbs_attn/src/permute_states.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"affc3b6cf23a3c4c","mcp_get_code":{"code_sha256":"affc3b6cf23a3c4c"}},{"arxiv_id":"2506.19997","paper":"/paper/traced-transition-aware-regret-approximation","title":"TRACED: Transition-aware Regret Approximation with Co-learnability for Environment Design","date":"2025-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cho-Geonwoo/TRACED","path":"models/rnn.py","file_url":"https://github.com/Cho-Geonwoo/TRACED/blob/HEAD/models/rnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f9f894531a94e423","mcp_get_code":{"code_sha256":"f9f894531a94e423"}},{"arxiv_id":"2110.05679","paper":"/paper/large-language-models-can-be-strong-1","title":"Large Language Models Can Be Strong Differentially Private Learners","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/opacus","path":"opacus/layers/dp_rnn.py","file_url":"https://github.com/pytorch/opacus/blob/HEAD/opacus/layers/dp_rnn.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":"46783ac8b5216877","mcp_get_code":{"code_sha256":"46783ac8b5216877"}},{"arxiv_id":"2005.11633","paper":"/paper/effective-and-efficient-computation-with","title":"Effective and Efficient Computation with Multiple-timescale Spiking Recurrent Neural Networks","date":"2020-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byin-cwi/SRNN-ICONs2020","path":"generate_ps_dataset.py","file_url":"https://github.com/byin-cwi/SRNN-ICONs2020/blob/HEAD/generate_ps_dataset.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"49dc4f03ebe9f50e","mcp_get_code":{"code_sha256":"49dc4f03ebe9f50e"}}]}