{"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/load-adult","entry":"load_adult","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":1,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"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.17190","paper":"/paper/arxiv-2608-17190","title":"How smoothing the affinity matrix affects neighborhood preservation in t-SNE","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"aida-ugent/smooth_affinity_tsne","path":"experiments/compare_affinity_variants.py","file_url":"https://github.com/aida-ugent/smooth_affinity_tsne/blob/HEAD/experiments/compare_affinity_variants.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"bde1f33b923c355d","mcp_get_code":{"code_sha256":"bde1f33b923c355d"}},{"arxiv_id":"2602.10870","paper":"/paper/arxiv-2602-10870","title":"FedPS: Federated data Preprocessing via aggregated Statistics","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"xuefeng-xu/fl-tabular","path":"dataloader.py","file_url":"https://github.com/xuefeng-xu/fl-tabular/blob/HEAD/dataloader.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":"d38c4dfcce50ed8d","mcp_get_code":{"code_sha256":"d38c4dfcce50ed8d"}},{"arxiv_id":"2403.19381","paper":"/paper/on-uncertainty-quantification-for-near-bayes","title":"On Uncertainty Quantification for Near-Bayes Optimal Algorithms","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meta-inf/ipb","path":"classification/datasets.py","file_url":"https://github.com/meta-inf/ipb/blob/HEAD/classification/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"3fffcfbc80fafe7b","mcp_get_code":{"code_sha256":"3fffcfbc80fafe7b"}},{"arxiv_id":"1909.08982","paper":"/paper/adafair-cumulative-fairness-adaptive-boosting","title":"AdaFair: Cumulative Fairness Adaptive Boosting","date":"2019-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iosifidisvasileios/AdaFair","path":"adafair/load_adult.py","file_url":"https://github.com/iosifidisvasileios/AdaFair/blob/HEAD/adafair/load_adult.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"259e3f500265f735","mcp_get_code":{"code_sha256":"259e3f500265f735"}},{"arxiv_id":"1901.08665","paper":"/paper/fairness-risk-measures","title":"Fairness risk measures","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohanvandenHeuvel/FairnessRiskMeasures","path":"load_data.py","file_url":"https://github.com/JohanvandenHeuvel/FairnessRiskMeasures/blob/HEAD/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"fb9b99e159fa4aee","mcp_get_code":{"code_sha256":"fb9b99e159fa4aee"}}]}