{"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/get-hparams","entry":"get_hparams","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":9,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":0,"ran_fixture":0,"ran":2,"unverified":4},"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.03184","arxiv_id_is_arxiv":true,"paper":"/paper/ouroboros3d-image-to-3d-generation-via-3d","title":"Ouroboros3D: Image-to-3D Generation via 3D-aware Recursive Diffusion","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Costwen/Ouroboros3D","path":"src/utils/config.py","file_url":"https://github.com/Costwen/Ouroboros3D/blob/HEAD/src/utils/config.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":"f5b98a41b3655fc4","code_sha256_prefix":"f5b98a41b3655fc4","mcp_get_code":{"code_sha256":"f5b98a41b3655fc4"}},{"arxiv_id":"2401.06091","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzhang0/auc_bias","path":"experiments.py","file_url":"https://github.com/hzhang0/auc_bias/blob/HEAD/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"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, hzhang0/auc_bias when it was checked","code_sha256":"73d0cb5bbc5c4f0c","code_sha256_prefix":"73d0cb5bbc5c4f0c","mcp_get_code":{"code_sha256":"73d0cb5bbc5c4f0c"}},{"arxiv_id":"2210.10769","arxiv_id_is_arxiv":true,"paper":"/paper/why-did-the-model-fail-attributing-model","title":"\"Why did the Model Fail?\": Attributing Model Performance Changes to Distribution Shifts","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlforhealth/expl_perf_drop","path":"expl_perf_drop/experiments.py","file_url":"https://github.com/mlforhealth/expl_perf_drop/blob/HEAD/expl_perf_drop/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from hzhang0/auc_bias, and GitHub detected no licence in that repository when it was checked","code_sha256":"73d0cb5bbc5c4f0c","code_sha256_prefix":"73d0cb5bbc5c4f0c","mcp_get_code":{"code_sha256":"73d0cb5bbc5c4f0c"}},{"arxiv_id":"2108.12510","arxiv_id_is_arxiv":true,"paper":"/paper/pulling-up-by-the-causal-bootstraps-causal","title":"Pulling Up by the Causal Bootstraps: Causal Data Augmentation for Pre-training Debiasing","date":"2021-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MLforHealth/CausalDA","path":"experiments.py","file_url":"https://github.com/MLforHealth/CausalDA/blob/HEAD/experiments.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":"1333b4e802eba4f0","code_sha256_prefix":"1333b4e802eba4f0","mcp_get_code":{"code_sha256":"1333b4e802eba4f0"}},{"arxiv_id":"2108.12250","arxiv_id_is_arxiv":true,"paper":"/paper/a-comparison-of-approaches-to-improve-worst","title":"A comparison of approaches to improve worst-case predictive model performance over patient subpopulations","date":"2021-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"som-shahlab/subpopulation_robustness","path":"group_robustness_fairness/mimic_eicu/experiments.py","file_url":"https://github.com/som-shahlab/subpopulation_robustness/blob/HEAD/group_robustness_fairness/mimic_eicu/experiments.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":"1333b4e802eba4f0","code_sha256_prefix":"1333b4e802eba4f0","mcp_get_code":{"code_sha256":"1333b4e802eba4f0"}},{"arxiv_id":"2106.16209","arxiv_id_is_arxiv":true,"paper":"/paper/s2c2-an-orthogonal-method-for-semi-supervised","title":"A data-centric approach for improving ambiguous labels with combined semi-supervised classification and clustering","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emprime/dc3","path":"imagenet/training.py","file_url":"https://github.com/emprime/dc3/blob/HEAD/imagenet/training.py","status":"unverified","verification_level":0,"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":"d418bfeffed76d00","code_sha256_prefix":"d418bfeffed76d00","mcp_get_code":{"code_sha256":"d418bfeffed76d00"}},{"arxiv_id":"2002.03079","arxiv_id_is_arxiv":true,"paper":"/paper/blank-language-models","title":"Blank Language Models","date":"2020-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Varal7/blank_language_model","path":"utils.py","file_url":"https://github.com/Varal7/blank_language_model/blob/HEAD/utils.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":"96be2538380bf7f7","code_sha256_prefix":"96be2538380bf7f7","mcp_get_code":{"code_sha256":"96be2538380bf7f7"}},{"arxiv_id":"2002.00434","arxiv_id_is_arxiv":true,"paper":"/paper/integrating-deep-reinforcement-learning-with","title":"Integrating Deep Reinforcement Learning with Model-based Path Planners for Automated Driving","date":"2020-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ekim-Yurtsever/Hybrid-DeepRL-Automated-Driving","path":"hybrid-rl/sources/common.py","file_url":"https://github.com/Ekim-Yurtsever/Hybrid-DeepRL-Automated-Driving/blob/HEAD/hybrid-rl/sources/common.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":"83a20a9bd5e1d806","code_sha256_prefix":"83a20a9bd5e1d806","mcp_get_code":{"code_sha256":"83a20a9bd5e1d806"}},{"arxiv_id":"2001.07685","arxiv_id_is_arxiv":true,"paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnchenresearch/SSL","path":"imagenet/training.py","file_url":"https://github.com/johnchenresearch/SSL/blob/HEAD/imagenet/training.py","status":"unverified","verification_level":0,"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":"d418bfeffed76d00","code_sha256_prefix":"d418bfeffed76d00","mcp_get_code":{"code_sha256":"d418bfeffed76d00"}}],"record_sha256":"29a2a64e843b4f4e80d34894e5f461c2ec1aac77c9e0804ded1a852be2121dde","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}