{"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/cdp-delta-standard","entry":"cdp_delta_standard","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":5,"n_papers_ran":5,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2604.18352","paper":"/paper/arxiv-2604-18352","title":"Tight Auditing of Differential Privacy in MST and AIM","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"6026d9da4638c121","mcp_get_code":{"code_sha256":"6026d9da4638c121"}},{"arxiv_id":"2403.07797","paper":"/paper/joint-selection-adaptively-incorporating","title":"Joint Selection: Adaptively Incorporating Public Information for Private Synthetic Data","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miguel-fuentes/jam_aistats","path":"code/mechanisms/cdp2adp.py","file_url":"https://github.com/miguel-fuentes/jam_aistats/blob/HEAD/code/mechanisms/cdp2adp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6026d9da4638c121","mcp_get_code":{"code_sha256":"6026d9da4638c121"}},{"arxiv_id":"2402.03985","paper":"/paper/a-bias-variance-decomposition-for-ensembles","title":"A Bias-Variance Decomposition for Ensembles over Multiple Synthetic Datasets","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dpbayes/generative-ensemble-bias-variance-decomposition","path":"lib/aim/cdp2adp.py","file_url":"https://github.com/dpbayes/generative-ensemble-bias-variance-decomposition/blob/HEAD/lib/aim/cdp2adp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6026d9da4638c121","mcp_get_code":{"code_sha256":"6026d9da4638c121"}},{"arxiv_id":"2401.17823","paper":"/paper/privacy-preserving-data-release-leveraging","title":"Privacy-preserving data release leveraging optimal transport and particle gradient descent","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaabmar/private-pgd","path":"src/mechanisms/cdp2adp.py","file_url":"https://github.com/jaabmar/private-pgd/blob/HEAD/src/mechanisms/cdp2adp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6026d9da4638c121","mcp_get_code":{"code_sha256":"6026d9da4638c121"}},{"arxiv_id":"2004.00010","paper":"/paper/the-discrete-gaussian-for-differential","title":"The Discrete Gaussian for Differential Privacy","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/discrete-gaussian-differential-privacy","path":"cdp2adp.py","file_url":"https://github.com/IBM/discrete-gaussian-differential-privacy/blob/HEAD/cdp2adp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6026d9da4638c121","mcp_get_code":{"code_sha256":"6026d9da4638c121"}}]}