{"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/one-hot-encoder","entry":"one_hot_encoder","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":4,"unverified":1},"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":"2605.05993","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05993","title":"TabCF: Distributional Control Function Estimation with Tabular Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"py-why/EconML","path":"econml/_sklearn_compat.py","file_url":"https://github.com/py-why/EconML/blob/HEAD/econml/_sklearn_compat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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, py-why/EconML (NOASSERTION)","code_sha256":"cc963910bceeb426","code_sha256_prefix":"cc963910bceeb426","mcp_get_code":{"code_sha256":"cc963910bceeb426"}},{"arxiv_id":"2307.16847","arxiv_id_is_arxiv":true,"paper":"/paper/latent-masking-for-multimodal-self-supervised","title":"CroSSL: Cross-modal Self-Supervised Learning for Time-series through Latent Masking","date":"2023-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dr-bell/crossl","path":"src/baselines/sup_data_helper.py","file_url":"https://github.com/dr-bell/crossl/blob/HEAD/src/baselines/sup_data_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, dr-bell/crossl, is not in the permissive set Syntology serves inline","code_sha256":"9129d81d4de302ee","code_sha256_prefix":"9129d81d4de302ee","mcp_get_code":{"code_sha256":"9129d81d4de302ee"}},{"arxiv_id":"2206.07769","arxiv_id_is_arxiv":true,"paper":"/paper/hyperimpute-generalized-iterative-imputation","title":"HyperImpute: Generalized Iterative Imputation with Automatic Model Selection","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/hyperimpute","path":"src/hyperimpute/utils/torch.py","file_url":"https://github.com/vanderschaarlab/hyperimpute/blob/HEAD/src/hyperimpute/utils/torch.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":"2dce2ec30a5e1389","code_sha256_prefix":"2dce2ec30a5e1389","mcp_get_code":{"code_sha256":"2dce2ec30a5e1389"}},{"arxiv_id":"2110.06389","arxiv_id_is_arxiv":true,"paper":"/paper/amortized-tree-generation-for-bottom-up-1","title":"Amortized Tree Generation for Bottom-up Synthesis Planning and Synthesizable Molecular Design","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenhao-gao/SynNet","path":"src/synnet/encoding/utils.py","file_url":"https://github.com/wenhao-gao/SynNet/blob/HEAD/src/synnet/encoding/utils.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":"0b129c7a9fb74eb5","code_sha256_prefix":"0b129c7a9fb74eb5","mcp_get_code":{"code_sha256":"0b129c7a9fb74eb5"}},{"arxiv_id":"2107.01952","arxiv_id_is_arxiv":true,"paper":"/paper/partition-and-code-learning-how-to-compress","title":"Partition and Code: learning how to compress graphs","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbouritsas/PnC","path":"models/GNN_neural_part_subgraph_selection.py","file_url":"https://github.com/gbouritsas/PnC/blob/HEAD/models/GNN_neural_part_subgraph_selection.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":"1f0176d5abd4a4be","code_sha256_prefix":"1f0176d5abd4a4be","mcp_get_code":{"code_sha256":"1f0176d5abd4a4be"}},{"arxiv_id":"2102.04306","arxiv_id_is_arxiv":true,"paper":"/paper/transunet-transformers-make-strong-encoders","title":"TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation","date":"2021-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljollans/trunet","path":"TRUNet_network/trunet_train.py","file_url":"https://github.com/ljollans/trunet/blob/HEAD/TRUNet_network/trunet_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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, ljollans/trunet, is not in the permissive set Syntology serves inline","code_sha256":"7e0f38dc41fa04e1","code_sha256_prefix":"7e0f38dc41fa04e1","mcp_get_code":{"code_sha256":"7e0f38dc41fa04e1"}},{"arxiv_id":"1906.08230","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-protein-transfer-learning-with","title":"Evaluating Protein Transfer Learning with TAPE","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"googleinterns/protein-embedding-retrieval","path":"contextual_lenses/encoders.py","file_url":"https://github.com/googleinterns/protein-embedding-retrieval/blob/HEAD/contextual_lenses/encoders.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b10d1d06cd24b15f","code_sha256_prefix":"b10d1d06cd24b15f","mcp_get_code":{"code_sha256":"b10d1d06cd24b15f"}}],"record_sha256":"2b20154d7e9eb73e26bc10a6a932aa3d528ffdfd611e1a59ba902b1e4f098a88","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}