{"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/apply-permutation","entry":"apply_permutation","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":2,"ran":3,"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":"2601.12922","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"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, Johannes-Kaiser/Collusion-Vuln-in-DP when it was checked","code_sha256":"46783ac8b5216877","code_sha256_prefix":"46783ac8b5216877","mcp_get_code":{"code_sha256":"46783ac8b5216877"}},{"arxiv_id":"2601.08219","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Pie115/Agentic-Deflation when it was checked","code_sha256":"e62b82bc18eaf1d9","code_sha256_prefix":"e62b82bc18eaf1d9","mcp_get_code":{"code_sha256":"e62b82bc18eaf1d9"}},{"arxiv_id":"2510.21270","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"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, xinghaow99/pbs-attn when it was checked","code_sha256":"affc3b6cf23a3c4c","code_sha256_prefix":"affc3b6cf23a3c4c","mcp_get_code":{"code_sha256":"affc3b6cf23a3c4c"}},{"arxiv_id":"2506.19997","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Cho-Geonwoo/TRACED (NOASSERTION)","code_sha256":"f9f894531a94e423","code_sha256_prefix":"f9f894531a94e423","mcp_get_code":{"code_sha256":"f9f894531a94e423"}},{"arxiv_id":"2110.05679","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Johannes-Kaiser/Collusion-Vuln-in-DP, and GitHub detected no licence in that repository when it was checked","code_sha256":"46783ac8b5216877","code_sha256_prefix":"46783ac8b5216877","mcp_get_code":{"code_sha256":"46783ac8b5216877"}},{"arxiv_id":"2005.11633","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, byin-cwi/SRNN-ICONs2020 when it was checked","code_sha256":"49dc4f03ebe9f50e","code_sha256_prefix":"49dc4f03ebe9f50e","mcp_get_code":{"code_sha256":"49dc4f03ebe9f50e"}}],"record_sha256":"8d09c1c5b9903d8a9c12391e185abf3e9b2cb575c28cb3ce5f51603583e965ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}