{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/return-data","entry":"return_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":11,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":7},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d920047f26420214","code_sha256_prefix":"d920047f26420214","mcp_get_code":{"code_sha256":"d920047f26420214"}},{"arxiv_id":"2402.03254","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05d0b6602a883bd3","code_sha256_prefix":"05d0b6602a883bd3","mcp_get_code":{"code_sha256":"05d0b6602a883bd3"}},{"arxiv_id":"2309.16515","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ZhengqingUUU/LatentNoiseSegmentation, is not in the permissive set Syntology serves inline","code_sha256":"75b9f9771c727b95","code_sha256_prefix":"75b9f9771c727b95","mcp_get_code":{"code_sha256":"75b9f9771c727b95"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"69e44b454bef1c76","code_sha256_prefix":"69e44b454bef1c76","mcp_get_code":{"code_sha256":"69e44b454bef1c76"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b441fdbef0a06567","code_sha256_prefix":"b441fdbef0a06567","mcp_get_code":{"code_sha256":"b441fdbef0a06567"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bddd1344d4501303","code_sha256_prefix":"bddd1344d4501303","mcp_get_code":{"code_sha256":"bddd1344d4501303"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5dfa113ed2d4f658","code_sha256_prefix":"5dfa113ed2d4f658","mcp_get_code":{"code_sha256":"5dfa113ed2d4f658"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de6faacbeb0eb06d","code_sha256_prefix":"de6faacbeb0eb06d","mcp_get_code":{"code_sha256":"de6faacbeb0eb06d"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"69930c08eceb6a88","code_sha256_prefix":"69930c08eceb6a88","mcp_get_code":{"code_sha256":"69930c08eceb6a88"}},{"arxiv_id":"1902.01568","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f48944b54ecf0097","code_sha256_prefix":"f48944b54ecf0097","mcp_get_code":{"code_sha256":"f48944b54ecf0097"}},{"arxiv_id":"1802.05983","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8752210a3f89714d","code_sha256_prefix":"8752210a3f89714d","mcp_get_code":{"code_sha256":"8752210a3f89714d"}}],"record_sha256":"b3e81665a894a421b86d816e7e7ade390bdbfdd50b41571a0a4c3722e7ee66aa","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}