{"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/return-data","entry":"return_data","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":11,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":9},"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":"2406.19298","paper":"/paper/compositional-image-decomposition-with","title":"Compositional Image Decomposition with Diffusion Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/Beta-VAE","path":"dataset.py","file_url":"https://github.com/1Konny/Beta-VAE/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d920047f26420214","mcp_get_code":{"code_sha256":"d920047f26420214"}},{"arxiv_id":"2402.03254","paper":"/paper/minimum-description-length-and-generalization-1","title":"Minimum Description Length and Generalization Guarantees for Representation Learning","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning","path":"datasets.py","file_url":"https://github.com/piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"05d0b6602a883bd3","mcp_get_code":{"code_sha256":"05d0b6602a883bd3"}},{"arxiv_id":"2309.16515","paper":"/paper/latent-noise-segmentation-how-neural-noise","title":"Latent Noise Segmentation: How Neural Noise Leads to the Emergence of Segmentation and Grouping","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhengqingUUU/LatentNoiseSegmentation","path":"dataloaders.py","file_url":"https://github.com/ZhengqingUUU/LatentNoiseSegmentation/blob/HEAD/dataloaders.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"75b9f9771c727b95","mcp_get_code":{"code_sha256":"75b9f9771c727b95"}},{"arxiv_id":"2009.03300","paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjass/MultiTaskLearning","path":"036questions/filtering.py","file_url":"https://github.com/sanjass/MultiTaskLearning/blob/HEAD/036questions/filtering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"69e44b454bef1c76","mcp_get_code":{"code_sha256":"69e44b454bef1c76"}},{"arxiv_id":"2009.03300","paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjass/MultiTaskLearning","path":"036questions/filtering2.py","file_url":"https://github.com/sanjass/MultiTaskLearning/blob/HEAD/036questions/filtering2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b441fdbef0a06567","mcp_get_code":{"code_sha256":"b441fdbef0a06567"}},{"arxiv_id":"2009.03300","paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjass/MultiTaskLearning","path":"036questions/gradientdescent.py","file_url":"https://github.com/sanjass/MultiTaskLearning/blob/HEAD/036questions/gradientdescent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bddd1344d4501303","mcp_get_code":{"code_sha256":"bddd1344d4501303"}},{"arxiv_id":"2009.03300","paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjass/MultiTaskLearning","path":"036questions/gradientdescent2.py","file_url":"https://github.com/sanjass/MultiTaskLearning/blob/HEAD/036questions/gradientdescent2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5dfa113ed2d4f658","mcp_get_code":{"code_sha256":"5dfa113ed2d4f658"}},{"arxiv_id":"2009.03300","paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjass/MultiTaskLearning","path":"036questions/logisticregression.py","file_url":"https://github.com/sanjass/MultiTaskLearning/blob/HEAD/036questions/logisticregression.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de6faacbeb0eb06d","mcp_get_code":{"code_sha256":"de6faacbeb0eb06d"}},{"arxiv_id":"2009.03300","paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjass/MultiTaskLearning","path":"036questions/rnn.py","file_url":"https://github.com/sanjass/MultiTaskLearning/blob/HEAD/036questions/rnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"69930c08eceb6a88","mcp_get_code":{"code_sha256":"69930c08eceb6a88"}},{"arxiv_id":"1902.01568","paper":"/paper/relevance-factor-vae-learning-and-identifying","title":"Relevance Factor VAE: Learning and Identifying Disentangled Factors","date":"2019-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThomasMrY/RF-VAE","path":"dataset.py","file_url":"https://github.com/ThomasMrY/RF-VAE/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f48944b54ecf0097","mcp_get_code":{"code_sha256":"f48944b54ecf0097"}},{"arxiv_id":"1802.05983","paper":"/paper/disentangling-by-factorising","title":"Disentangling by Factorising","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/FactorVAE","path":"dataset.py","file_url":"https://github.com/1Konny/FactorVAE/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8752210a3f89714d","mcp_get_code":{"code_sha256":"8752210a3f89714d"}}]}