{"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/is-categorical","entry":"is_categorical","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"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":3,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"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":"2604.22337","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22337","title":"TabSCM: A practical Framework for Generating Realistic Tabular Data","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"jsve96/TabSCM","path":"tabscm/model.py","file_url":"https://github.com/jsve96/TabSCM/blob/HEAD/tabscm/model.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aeb8d135315f48e5","code_sha256_prefix":"aeb8d135315f48e5","mcp_get_code":{"code_sha256":"aeb8d135315f48e5"}},{"arxiv_id":"2508.00924","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-00924","title":"XAutoLM: Efficient Fine-Tuning of Language Models via Meta-Learning and AutoML","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"EEstevanell/XAutoLM","path":"autogoal-contrib/autogoal_contrib/autogoal_contrib/_utils.py","file_url":"https://github.com/EEstevanell/XAutoLM/blob/HEAD/autogoal-contrib/autogoal_contrib/autogoal_contrib/_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af2a06ad3fdaae35","code_sha256_prefix":"af2a06ad3fdaae35","mcp_get_code":{"code_sha256":"af2a06ad3fdaae35"}},{"arxiv_id":"2503.14434","arxiv_id_is_arxiv":true,"paper":"/paper/llm-fe-automated-feature-engineering-for","title":"LLM-FE: Automated Feature Engineering for Tabular Data with LLMs as Evolutionary Optimizers","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nikhilsab/llmfe","path":"optimization_utils.py","file_url":"https://github.com/nikhilsab/llmfe/blob/HEAD/optimization_utils.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":"d471862319b6d24a","code_sha256_prefix":"d471862319b6d24a","mcp_get_code":{"code_sha256":"d471862319b6d24a"}},{"arxiv_id":"2406.07815","arxiv_id_is_arxiv":true,"paper":"/paper/are-large-language-models-good-statisticians","title":"Are Large Language Models Good Statisticians?","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"derrickzhuyz/statqa","path":"utils.py","file_url":"https://github.com/derrickzhuyz/statqa/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, derrickzhuyz/statqa, is not in the permissive set Syntology serves inline","code_sha256":"210bb3d7d71304d8","code_sha256_prefix":"210bb3d7d71304d8","mcp_get_code":{"code_sha256":"210bb3d7d71304d8"}},{"arxiv_id":"2312.07577","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-distribution-shift-in-tabular-1","title":"Benchmarking Distribution Shift in Tabular Data with TableShift","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlfoundations/tableshift","path":"tableshift/core/features.py","file_url":"https://github.com/mlfoundations/tableshift/blob/HEAD/tableshift/core/features.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c783977dad9f056e","code_sha256_prefix":"c783977dad9f056e","mcp_get_code":{"code_sha256":"c783977dad9f056e"}}],"record_sha256":"b6c49279153d5baefaf880440601381fe3c386b69be2f8d44812adb85f727428","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}