{"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/create-batches","entry":"create_batches","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":13,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":13,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":13,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":5,"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":"2601.17197","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17197","title":"Reasoning Beyond Literal: Cross-style Multimodal Reasoning for Figurative Language Understanding","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"scheshmi/CrossStyle-MMR","path":"infer/gemini.py","file_url":"https://github.com/scheshmi/CrossStyle-MMR/blob/HEAD/infer/gemini.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, scheshmi/CrossStyle-MMR when it was checked","code_sha256":"47166def646ebec4","code_sha256_prefix":"47166def646ebec4","mcp_get_code":{"code_sha256":"47166def646ebec4"}},{"arxiv_id":"2410.22564","arxiv_id_is_arxiv":true,"paper":"/paper/vertical-federated-learning-with-missing","title":"Vertical Federated Learning with Missing Features During Training and Inference","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Valdeira/LASER-VFL","path":"models/mimic_model_utils.py","file_url":"https://github.com/Valdeira/LASER-VFL/blob/HEAD/models/mimic_model_utils.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":"8205a45bb88f06e9","code_sha256_prefix":"8205a45bb88f06e9","mcp_get_code":{"code_sha256":"8205a45bb88f06e9"}},{"arxiv_id":"2405.10260","arxiv_id_is_arxiv":true,"paper":"/paper/keep-it-private-unsupervised-privatization-of","title":"Keep It Private: Unsupervised Privatization of Online Text","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csbao/kip-privatization","path":"src/helper_functions.py","file_url":"https://github.com/csbao/kip-privatization/blob/HEAD/src/helper_functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, csbao/kip-privatization when it was checked","code_sha256":"f1910cd6b05c84aa","code_sha256_prefix":"f1910cd6b05c84aa","mcp_get_code":{"code_sha256":"f1910cd6b05c84aa"}},{"arxiv_id":"2403.08002","arxiv_id_is_arxiv":true,"paper":"/paper/training-small-multimodal-models-to-bridge","title":"Towards a clinically accessible radiology foundation model: open-access and lightweight, with automated evaluation","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/llava-rad","path":"llava/eval/model_mimic_cxr.py","file_url":"https://github.com/microsoft/llava-rad/blob/HEAD/llava/eval/model_mimic_cxr.py","status":"ran","verification_level":1,"contract_check":null,"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, microsoft/llava-rad (NOASSERTION)","code_sha256":"6d2f3a4c1f6e2d48","code_sha256_prefix":"6d2f3a4c1f6e2d48","mcp_get_code":{"code_sha256":"6d2f3a4c1f6e2d48"}},{"arxiv_id":"2401.06712","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-detection-of-machine-generated-text","title":"Few-Shot Detection of Machine-Generated Text using Style Representations","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llnl/luar","path":"machine_detection/machine_utils.py","file_url":"https://github.com/llnl/luar/blob/HEAD/machine_detection/machine_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":"7811eb1fab7ee8c5","code_sha256_prefix":"7811eb1fab7ee8c5","mcp_get_code":{"code_sha256":"7811eb1fab7ee8c5"}},{"arxiv_id":"2311.14654","arxiv_id_is_arxiv":true,"paper":"/paper/jetlov-enhancing-jet-tree-tagging-through","title":"JetLOV: Enhancing Jet Tree Tagging through Neural Network Learning of Optimal LundNet Variables","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GiorgioCerro/jetlov","path":"experiments/shower.py","file_url":"https://github.com/GiorgioCerro/jetlov/blob/HEAD/experiments/shower.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aac1dd28c8780f75","code_sha256_prefix":"aac1dd28c8780f75","mcp_get_code":{"code_sha256":"aac1dd28c8780f75"}},{"arxiv_id":"2205.12644","arxiv_id_is_arxiv":true,"paper":"/paper/lingmess-linguistically-informed-multi-expert","title":"LingMess: Linguistically Informed Multi Expert Scorers for Coreference Resolution","date":"2022-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shon-otmazgin/lingmess-coref","path":"coref_dataset.py","file_url":"https://github.com/shon-otmazgin/lingmess-coref/blob/HEAD/coref_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":"1419e13af2d888ce","code_sha256_prefix":"1419e13af2d888ce","mcp_get_code":{"code_sha256":"1419e13af2d888ce"}},{"arxiv_id":"2204.13841","arxiv_id_is_arxiv":true,"paper":"/paper/an-extensive-data-processing-pipeline-for","title":"An Extensive Data Processing Pipeline for MIMIC-IV","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"healthylaife/mimic-iv-data-pipeline","path":"model/model_utils.py","file_url":"https://github.com/healthylaife/mimic-iv-data-pipeline/blob/HEAD/model/model_utils.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":"e33b3ffeb2767d35","code_sha256_prefix":"e33b3ffeb2767d35","mcp_get_code":{"code_sha256":"e33b3ffeb2767d35"}},{"arxiv_id":"2203.07281","arxiv_id_is_arxiv":true,"paper":"/paper/grips-gradient-free-edit-based-instruction","title":"GrIPS: Gradient-free, Edit-based Instruction Search for Prompting Large Language Models","date":"2022-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"archiki/grips","path":"nat_inst_gpt3.py","file_url":"https://github.com/archiki/grips/blob/HEAD/nat_inst_gpt3.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"808e090115590f67","code_sha256_prefix":"808e090115590f67","mcp_get_code":{"code_sha256":"808e090115590f67"}},{"arxiv_id":"2201.08531","arxiv_id_is_arxiv":true,"paper":"/paper/black-box-prompt-learning-for-pre-trained","title":"Black-box Prompt Learning for Pre-trained Language Models","date":"2022-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shizhediao/black-box-prompt-learning","path":"run_glue_discrete_GPT.py","file_url":"https://github.com/shizhediao/black-box-prompt-learning/blob/HEAD/run_glue_discrete_GPT.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":"cf1b29b012c28b76","code_sha256_prefix":"cf1b29b012c28b76","mcp_get_code":{"code_sha256":"cf1b29b012c28b76"}},{"arxiv_id":"1808.09357","arxiv_id_is_arxiv":true,"paper":"/paper/rational-recurrences","title":"Rational Recurrences","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Noahs-ARK/rational-recurrences","path":"language_model/train_lm.py","file_url":"https://github.com/Noahs-ARK/rational-recurrences/blob/HEAD/language_model/train_lm.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":"a44cd456a2bbbef2","code_sha256_prefix":"a44cd456a2bbbef2","mcp_get_code":{"code_sha256":"a44cd456a2bbbef2"}},{"arxiv_id":"1803.01328","arxiv_id_is_arxiv":true,"paper":"/paper/whai-weibull-hybrid-autoencoding-inference","title":"WHAI: Weibull Hybrid Autoencoding Inference for Deep Topic Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sophieburkhardt/dirichlet-vae-topic-models","path":"utils.py","file_url":"https://github.com/sophieburkhardt/dirichlet-vae-topic-models/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sophieburkhardt/dirichlet-vae-topic-models when it was checked","code_sha256":"c7c5038d6f0b010f","code_sha256_prefix":"c7c5038d6f0b010f","mcp_get_code":{"code_sha256":"c7c5038d6f0b010f"}},{"arxiv_id":"1610.02351","arxiv_id_is_arxiv":true,"paper":"/paper/panning-for-gold-model-x-knockoffs-for-high","title":"Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selection","date":null,"month_inferred_from_arxiv_id":"2016-10","title_source":"archive","repo":"amspector100/knockpy","path":"knockpy/kpytorch/deeppink.py","file_url":"https://github.com/amspector100/knockpy/blob/HEAD/knockpy/kpytorch/deeppink.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":"746a83193745ebea","code_sha256_prefix":"746a83193745ebea","mcp_get_code":{"code_sha256":"746a83193745ebea"}}],"record_sha256":"584fbbf55eeb193883f41227ae52dcb4c9b2cb0cc00c7bf53fec336397a4f222","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}