{"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/d-2","entry":"d","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":6,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2608.23640","paper":"/paper/arxiv-2608-23640","title":"Auditing the Synthetic Memoir: Measuring Scene-Level Confabulation in LLM-Generated Autobiography Against the Documented Record of the Life It Describes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"heathriel/synthetic-memoir-audit","path":"analysis/05_provenance.py","file_url":"https://github.com/heathriel/synthetic-memoir-audit/blob/HEAD/analysis/05_provenance.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e37f4877fb77bd88","mcp_get_code":{"code_sha256":"e37f4877fb77bd88"}},{"arxiv_id":"2302.12580","paper":"/paper/membership-inference-attacks-against-2","title":"Membership Inference Attacks against Synthetic Data through Overfitting Detection","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/domias","path":"src/domias/baselines.py","file_url":"https://github.com/vanderschaarlab/domias/blob/HEAD/src/domias/baselines.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f9c330f5ce6bd85","mcp_get_code":{"code_sha256":"8f9c330f5ce6bd85"}},{"arxiv_id":"2209.12396","paper":"/paper/deep-fair-clustering-via-maximizing-and","title":"Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metric","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PengxinZeng/2023-CVPR-FCMI","path":"Experiment/Temp.py","file_url":"https://github.com/PengxinZeng/2023-CVPR-FCMI/blob/HEAD/Experiment/Temp.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":"a7b7062b14a798bb","mcp_get_code":{"code_sha256":"a7b7062b14a798bb"}},{"arxiv_id":"2002.03113","paper":"/paper/projective-preferential-bayesian-optimization","title":"Projective Preferential Bayesian Optimization","date":"2020-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P-Mikkola/PPBO","path":"src/kernels.py","file_url":"https://github.com/P-Mikkola/PPBO/blob/HEAD/src/kernels.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2ec08ac02d66882","mcp_get_code":{"code_sha256":"e2ec08ac02d66882"}},{"arxiv_id":"1811.07095","paper":"/paper/deep-learning-of-turbulent-scalar-mixing","title":"Deep Learning of Turbulent Scalar Mixing","date":null,"month_inferred_from_arxiv_id":"2018-11","title_source":"archive","repo":"maziarraissi/DeepTurbulence","path":"PINNs_Turbulence/CookedUp.py","file_url":"https://github.com/maziarraissi/DeepTurbulence/blob/HEAD/PINNs_Turbulence/CookedUp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9eee478c93c59594","mcp_get_code":{"code_sha256":"9eee478c93c59594"}},{"arxiv_id":"1803.02155","paper":"/paper/self-attention-with-relative-position","title":"Self-Attention with Relative Position Representations","date":"2018-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chatha-Sphere/pno-ai","path":"model/attention.py","file_url":"https://github.com/Chatha-Sphere/pno-ai/blob/HEAD/model/attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"903e293032057e87","mcp_get_code":{"code_sha256":"903e293032057e87"}}]}