{"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/pretty","entry":"pretty","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":7,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":12,"n_places_pointer_only":9,"n_places_pointer_only_link_open":2,"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":5,"ran_fixture":0,"ran":3,"unverified":0},"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":"2405.04715","arxiv_id_is_arxiv":true,"paper":"/paper/causality-pursuit-from-heterogeneous","title":"Causality Pursuit from Heterogeneous Environments via Neural Adversarial Invariance Learning","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wmyw96/fair","path":"methods/predessors.py","file_url":"https://github.com/wmyw96/fair/blob/HEAD/methods/predessors.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wmyw96/fair when it was checked","code_sha256":"db4d05619d1e83d4","code_sha256_prefix":"db4d05619d1e83d4","mcp_get_code":{"code_sha256":"db4d05619d1e83d4"}},{"arxiv_id":"2311.11114","arxiv_id_is_arxiv":true,"paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/InvariantRiskMinimization","path":"code/experiment_synthetic/models.py","file_url":"https://github.com/facebookresearch/InvariantRiskMinimization/blob/HEAD/code/experiment_synthetic/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, facebookresearch/InvariantRiskMinimization when it was checked","code_sha256":"db4d05619d1e83d4","code_sha256_prefix":"db4d05619d1e83d4","mcp_get_code":{"code_sha256":"db4d05619d1e83d4"}},{"arxiv_id":"2305.15020","arxiv_id_is_arxiv":true,"paper":"/paper/an-efficient-multilingual-language-model","title":"An Efficient Multilingual Language Model Compression through Vocabulary Trimming","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asahi417/lm-vocab-trimmer","path":"vocabtrimmer/util.py","file_url":"https://github.com/asahi417/lm-vocab-trimmer/blob/HEAD/vocabtrimmer/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"337714394b87af04","code_sha256_prefix":"337714394b87af04","mcp_get_code":{"code_sha256":"337714394b87af04"}},{"arxiv_id":"2302.07944","arxiv_id_is_arxiv":true,"paper":"/paper/effective-data-augmentation-with-diffusion","title":"Effective Data Augmentation With Diffusion Models","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brandontrabucco/da-fusion","path":"plot.py","file_url":"https://github.com/brandontrabucco/da-fusion/blob/HEAD/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c507af67faa24273","code_sha256_prefix":"c507af67faa24273","mcp_get_code":{"code_sha256":"c507af67faa24273"}},{"arxiv_id":"2110.12425","arxiv_id_is_arxiv":true,"paper":"/paper/kernelized-heterogeneous-risk-minimization","title":"Kernelized Heterogeneous Risk Minimization","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljsthu/kernelized-hrm","path":"KernelHRM_sim1.py","file_url":"https://github.com/ljsthu/kernelized-hrm/blob/HEAD/KernelHRM_sim1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ljsthu/kernelized-hrm when it was checked","code_sha256":"9ca7f76887e2e090","code_sha256_prefix":"9ca7f76887e2e090","mcp_get_code":{"code_sha256":"9ca7f76887e2e090"}},{"arxiv_id":"2110.12425","arxiv_id_is_arxiv":true,"paper":"/paper/kernelized-heterogeneous-risk-minimization","title":"Kernelized Heterogeneous Risk Minimization","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljsthu/kernelized-hrm","path":"KernelHRM_sim1.py","file_url":"https://github.com/ljsthu/kernelized-hrm/blob/HEAD/KernelHRM_sim1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ljsthu/kernelized-hrm when it was checked","code_sha256":"063084ef6602865c","code_sha256_prefix":"063084ef6602865c","mcp_get_code":{"code_sha256":"063084ef6602865c"}},{"arxiv_id":"2103.11811","arxiv_id_is_arxiv":true,"paper":"/paper/masakhaner-named-entity-recognition-for","title":"MasakhaNER: Named Entity Recognition for African Languages","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michael-beukman/nertransfer","path":"src/analysis/v10/basic_analyse_pretrained_model.py","file_url":"https://github.com/michael-beukman/nertransfer/blob/HEAD/src/analysis/v10/basic_analyse_pretrained_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b655ab126afacd7a","code_sha256_prefix":"b655ab126afacd7a","mcp_get_code":{"code_sha256":"b655ab126afacd7a"}},{"arxiv_id":"2010.16412","arxiv_id_is_arxiv":true,"paper":"/paper/empirical-or-invariant-risk-minimization-a-1","title":"Empirical or Invariant Risk Minimization? A Sample Complexity Perspective","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/IRM-games","path":"ERM-IRM/models_crossval_Sep8.py","file_url":"https://github.com/IBM/IRM-games/blob/HEAD/ERM-IRM/models_crossval_Sep8.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from parshakova/IRM_ICP-IC_ERM, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"db4d05619d1e83d4","code_sha256_prefix":"db4d05619d1e83d4","mcp_get_code":{"code_sha256":"db4d05619d1e83d4"}},{"arxiv_id":"2010.16412","arxiv_id_is_arxiv":true,"paper":"/paper/empirical-or-invariant-risk-minimization-a-1","title":"Empirical or Invariant Risk Minimization? A Sample Complexity Perspective","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/IRM-games","path":"LRG_games/ERM_per_env/IRM_exhaustive_argparse_hper_wo_disc_Sep8.py","file_url":"https://github.com/IBM/IRM-games/blob/HEAD/LRG_games/ERM_per_env/IRM_exhaustive_argparse_hper_wo_disc_Sep8.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from capybaralet/REx_code_release, and GitHub detected no licence in that repository when it was checked","code_sha256":"1463989a26f3aa4f","code_sha256_prefix":"1463989a26f3aa4f","mcp_get_code":{"code_sha256":"1463989a26f3aa4f"}},{"arxiv_id":"2003.00688","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-distribution-generalization-via-risk","title":"Out-of-Distribution Generalization via Risk Extrapolation (REx)","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"capybaralet/REx_code_release","path":"InvariantRiskMinimization/experiment_synthetic/run_toy_SEMs.py","file_url":"https://github.com/capybaralet/REx_code_release/blob/HEAD/InvariantRiskMinimization/experiment_synthetic/run_toy_SEMs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, capybaralet/REx_code_release when it was checked","code_sha256":"1463989a26f3aa4f","code_sha256_prefix":"1463989a26f3aa4f","mcp_get_code":{"code_sha256":"1463989a26f3aa4f"}},{"arxiv_id":"1907.02893","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-risk-minimization","title":"Invariant Risk Minimization","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parshakova/IRM_ICP-IC_ERM","path":"code/models.py","file_url":"https://github.com/parshakova/IRM_ICP-IC_ERM/blob/HEAD/code/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, parshakova/IRM_ICP-IC_ERM (NOASSERTION)","code_sha256":"db4d05619d1e83d4","code_sha256_prefix":"db4d05619d1e83d4","mcp_get_code":{"code_sha256":"db4d05619d1e83d4"}},{"arxiv_id":"1807.08919","arxiv_id_is_arxiv":true,"paper":"/paper/the-variational-homoencoder-learning-to-learn","title":"The Variational Homoencoder: Learning to learn high capacity generative models from few examples","date":"2018-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insperatum/vhe","path":"example_czx.py","file_url":"https://github.com/insperatum/vhe/blob/HEAD/example_czx.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, insperatum/vhe when it was checked","code_sha256":"d59b9e65a0032373","code_sha256_prefix":"d59b9e65a0032373","mcp_get_code":{"code_sha256":"d59b9e65a0032373"}}],"record_sha256":"a7f38538fc964ceb2332395380c6ebb9f3768855540740cc60850c115e07e0f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}