{"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/sweep","entry":"sweep","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":4,"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":1,"ran_fixture":1,"ran":2,"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.03716","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-03716","title":"Artificial Intelligence for Energy Optimization in Data Centers","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Kimalice/AI-for-Energy-Optimization-in-Data-Centers-Closing-the-Optimizer-Load-Loop","path":"cleardc/netbenefit.py","file_url":"https://github.com/Kimalice/AI-for-Energy-Optimization-in-Data-Centers-Closing-the-Optimizer-Load-Loop/blob/HEAD/cleardc/netbenefit.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, Kimalice/AI-for-Energy-Optimization-in-Data-Centers-Closing-the-Optimizer-Load-Loop (NOASSERTION)","code_sha256":"e6218c6eadc658c8","code_sha256_prefix":"e6218c6eadc658c8","mcp_get_code":{"code_sha256":"e6218c6eadc658c8"}},{"arxiv_id":"2407.01919","arxiv_id_is_arxiv":true,"paper":"/paper/a-method-to-facilitate-membership-inference","title":"A Method to Facilitate Membership Inference Attacks in Deep Learning Models","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DependableSystemsLab/code_poison_MIA","path":"lira-plot.py","file_url":"https://github.com/DependableSystemsLab/code_poison_MIA/blob/HEAD/lira-plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from vlgiitr/confidence-is-all-you-need, and GitHub detected no licence in that repository when it was checked","code_sha256":"18da2122420deb20","code_sha256_prefix":"18da2122420deb20","mcp_get_code":{"code_sha256":"18da2122420deb20"}},{"arxiv_id":"2404.00699","arxiv_id_is_arxiv":true,"paper":"/paper/how-much-are-llms-contaminated-a","title":"How Much are Large Language Models Contaminated? A Comprehensive Survey and the LLMSanitize Library","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntunlp/llmsanitize","path":"llmsanitize/closed_data_methods/min_prob.py","file_url":"https://github.com/ntunlp/llmsanitize/blob/HEAD/llmsanitize/closed_data_methods/min_prob.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af0842b1fdd72528","code_sha256_prefix":"af0842b1fdd72528","mcp_get_code":{"code_sha256":"af0842b1fdd72528"}},{"arxiv_id":"2403.00352","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-disentanglement-in-downstream","title":"Revisiting Disentanglement in Downstream Tasks: A Study on Its Necessity for Abstract Visual Reasoning","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Richard-coder-Nai/disentanglement-lib-necessity","path":"disentanglement_lib/utils/hyperparams.py","file_url":"https://github.com/Richard-coder-Nai/disentanglement-lib-necessity/blob/HEAD/disentanglement_lib/utils/hyperparams.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, Richard-coder-Nai/disentanglement-lib-necessity when it was checked","code_sha256":"3504131533494b67","code_sha256_prefix":"3504131533494b67","mcp_get_code":{"code_sha256":"3504131533494b67"}},{"arxiv_id":"2402.15159","arxiv_id_is_arxiv":true,"paper":"/paper/machine-unlearning-of-pre-trained-large","title":"Machine Unlearning of Pre-trained Large Language Models","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaojin17/unlearning_llm","path":"llm_unlearn/utils/mia_eval.py","file_url":"https://github.com/yaojin17/unlearning_llm/blob/HEAD/llm_unlearn/utils/mia_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from vlgiitr/confidence-is-all-you-need, and GitHub detected no licence in that repository when it was checked","code_sha256":"18da2122420deb20","code_sha256_prefix":"18da2122420deb20","mcp_get_code":{"code_sha256":"18da2122420deb20"}},{"arxiv_id":"2306.01181","arxiv_id_is_arxiv":true,"paper":"/paper/tmi-finetuned-models-leak-private-information","title":"TMI! Finetuned Models Leak Private Information from their Pretraining Data","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnmath/tmi-pets24","path":"utils/transfermi.py","file_url":"https://github.com/johnmath/tmi-pets24/blob/HEAD/utils/transfermi.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":"ceb4a41d93e5cebc","code_sha256_prefix":"ceb4a41d93e5cebc","mcp_get_code":{"code_sha256":"ceb4a41d93e5cebc"}},{"arxiv_id":"2112.05746","arxiv_id_is_arxiv":true,"paper":"/paper/on-causally-disentangled-representations","title":"On Causally Disentangled Representations","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causal-disentanglement/disentanglement_lib","path":"disentanglement_lib/utils/hyperparams.py","file_url":"https://github.com/causal-disentanglement/disentanglement_lib/blob/HEAD/disentanglement_lib/utils/hyperparams.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 Richard-coder-Nai/disentanglement-lib-necessity, and GitHub detected no licence in that repository when it was checked","code_sha256":"3504131533494b67","code_sha256_prefix":"3504131533494b67","mcp_get_code":{"code_sha256":"3504131533494b67"}},{"arxiv_id":"2112.03570","arxiv_id_is_arxiv":true,"paper":"/paper/membership-inference-attacks-from-first","title":"Membership Inference Attacks From First Principles","date":"2021-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlgiitr/confidence-is-all-you-need","path":"plot.py","file_url":"https://github.com/vlgiitr/confidence-is-all-you-need/blob/HEAD/plot.py","status":"unverified","verification_level":0,"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, vlgiitr/confidence-is-all-you-need when it was checked","code_sha256":"18da2122420deb20","code_sha256_prefix":"18da2122420deb20","mcp_get_code":{"code_sha256":"18da2122420deb20"}},{"arxiv_id":"2010.01878","arxiv_id_is_arxiv":true,"paper":"/paper/lazimpa-lazy-and-impatient-neural-agents","title":"\"LazImpa\": Lazy and Impatient neural agents learn to communicate efficiently","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MathieuRita/Lazimpa","path":"egg/nest/common.py","file_url":"https://github.com/MathieuRita/Lazimpa/blob/HEAD/egg/nest/common.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":"7febd697258e8673","code_sha256_prefix":"7febd697258e8673","mcp_get_code":{"code_sha256":"7febd697258e8673"}},{"arxiv_id":"2006.07886","arxiv_id_is_arxiv":true,"paper":"/paper/is-independence-all-you-need-on-the","title":"On Disentangled Representations Learned From Correlated Data","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ftraeuble/disentanglement_lib","path":"disentanglement_lib/utils/hyperparams.py","file_url":"https://github.com/ftraeuble/disentanglement_lib/blob/HEAD/disentanglement_lib/utils/hyperparams.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 Richard-coder-Nai/disentanglement-lib-necessity, and GitHub detected no licence in that repository when it was checked","code_sha256":"3504131533494b67","code_sha256_prefix":"3504131533494b67","mcp_get_code":{"code_sha256":"3504131533494b67"}}],"record_sha256":"7e315f3b04567c6b90f0f808db9fa62fffad1d9c14583f5b04b8cfc092a0d8d3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}