{"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/sample-latent","entry":"sample_latent","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":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":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2602.20480","paper":"/paper/arxiv-2602-20480","title":"VINA: Variational Invertible Neural Architectures","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ananya-ac/INN-Project","path":"latent_prior.py","file_url":"https://github.com/ananya-ac/INN-Project/blob/HEAD/latent_prior.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bc935b2038be5c3d","mcp_get_code":{"code_sha256":"bc935b2038be5c3d"}},{"arxiv_id":"2402.03715","paper":"/paper/clarify-improving-model-robustness-with","title":"Clarify: Improving Model Robustness With Natural Language Corrections","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoonholee/clarify","path":"dsprites.py","file_url":"https://github.com/yoonholee/clarify/blob/HEAD/dsprites.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f672ac0c8e2d4a0","mcp_get_code":{"code_sha256":"4f672ac0c8e2d4a0"}},{"arxiv_id":"2210.17478","paper":"/paper/tiada-a-time-scale-adaptive-algorithm-for","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShawnLixx/time-scale_adaptive_minimax","path":"dist_robust/utils/dataset.py","file_url":"https://github.com/ShawnLixx/time-scale_adaptive_minimax/blob/HEAD/dist_robust/utils/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"507b3f6ffa35a4e2","mcp_get_code":{"code_sha256":"507b3f6ffa35a4e2"}},{"arxiv_id":"1606.00704","paper":"/paper/adversarially-learned-inference","title":"Adversarially Learned Inference","date":"2016-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Adversarially_Learned_Inference/ali.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Adversarially_Learned_Inference/ali.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1422451452fe36c8","mcp_get_code":{"code_sha256":"1422451452fe36c8"}},{"arxiv_id":"1605.09782","paper":"/paper/adversarial-feature-learning","title":"Adversarial Feature Learning","date":"2016-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Adversarial_Feature_Learning/adversarial_feature_learning.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Adversarial_Feature_Learning/adversarial_feature_learning.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7fa675c958056021","mcp_get_code":{"code_sha256":"7fa675c958056021"}}]}