{"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/make-prompt","entry":"make_prompt","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":19,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":12,"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":20,"n_samples_ran":20,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":14,"n_samples_unverified":0,"n_samples_fingerprinted":12,"n_places":21,"n_places_pointer_only":12,"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":14,"ran_fixture":0,"ran":6,"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":"2609.12653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12653","title":"SWARM: A Multilingual Human-Annotated Dataset for Russian Propaganda Detection in Search Engine Results","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"manueltonneau/swarm","path":"swarm/common.py","file_url":"https://github.com/manueltonneau/swarm/blob/HEAD/swarm/common.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":"0e6a0cd98d63ca44","code_sha256_prefix":"0e6a0cd98d63ca44","mcp_get_code":{"code_sha256":"0e6a0cd98d63ca44"}},{"arxiv_id":"2606.00619","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00619","title":"MemPro: Agentic Memory Systems as Evolvable Programs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wanghai673/MemPro","path":"MemPro/hotpotqa/versions/v_best/working_prompts.py","file_url":"https://github.com/wanghai673/MemPro/blob/HEAD/MemPro/hotpotqa/versions/v_best/working_prompts.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, wanghai673/MemPro when it was checked","code_sha256":"bd08cb277bcf62c1","code_sha256_prefix":"bd08cb277bcf62c1","mcp_get_code":{"code_sha256":"bd08cb277bcf62c1"}},{"arxiv_id":"2605.01148","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01148","title":"Arithmetic in the Wild: Llama uses Base-10 Addition to Reason About Cyclic Concepts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"goodfire-ai/arithmetic-wild","path":"src/fourier_probes/fourier_probes_sweep.py","file_url":"https://github.com/goodfire-ai/arithmetic-wild/blob/HEAD/src/fourier_probes/fourier_probes_sweep.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, goodfire-ai/arithmetic-wild when it was checked","code_sha256":"b086cc55c7031e8d","code_sha256_prefix":"b086cc55c7031e8d","mcp_get_code":{"code_sha256":"b086cc55c7031e8d"}},{"arxiv_id":"2604.16132","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-16132","title":"Can LLMs Understand the Impact of Trauma? Costs and Benefits of LLMs Coding the Interviews of Firearm Violence Survivors","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"jhzsquared/AIvsHumanCoding","path":"travail_code/llm_topic.py","file_url":"https://github.com/jhzsquared/AIvsHumanCoding/blob/HEAD/travail_code/llm_topic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, jhzsquared/AIvsHumanCoding when it was checked","code_sha256":"a1d37b95239f4557","code_sha256_prefix":"a1d37b95239f4557","mcp_get_code":{"code_sha256":"a1d37b95239f4557"}},{"arxiv_id":"2604.05818","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-05818","title":"WikiSeeker: Rethinking the Role of Vision-Language Models in Knowledge-Based Visual Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zhuyjan/WikiSeeker","path":"gen_refined_queries.py","file_url":"https://github.com/zhuyjan/WikiSeeker/blob/HEAD/gen_refined_queries.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93de3112886f0ae2","code_sha256_prefix":"93de3112886f0ae2","mcp_get_code":{"code_sha256":"93de3112886f0ae2"}},{"arxiv_id":"2601.17823","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17823","title":"DIETA: A Decoder-only transformer-based model for Italian-English machine TrAnslation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"pkasela/DIETA-Machine-Translation","path":"src/translate.py","file_url":"https://github.com/pkasela/DIETA-Machine-Translation/blob/HEAD/src/translate.py","status":"ran","verification_level":1,"contract_check":null,"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, pkasela/DIETA-Machine-Translation when it was checked","code_sha256":"e132f3b8af6f483b","code_sha256_prefix":"e132f3b8af6f483b","mcp_get_code":{"code_sha256":"e132f3b8af6f483b"}},{"arxiv_id":"2509.07730","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-07730","title":"M-BRe: Discovering Training Samples for Relation Extraction from Unlabeled Texts with Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Lzx-ZBC/M-BRe","path":"NER/bbn_afet/binary-fgner.py","file_url":"https://github.com/Lzx-ZBC/M-BRe/blob/HEAD/NER/bbn_afet/binary-fgner.py","status":"ran","verification_level":1,"contract_check":null,"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, Lzx-ZBC/M-BRe when it was checked","code_sha256":"cfbc649efbcdf87a","code_sha256_prefix":"cfbc649efbcdf87a","mcp_get_code":{"code_sha256":"cfbc649efbcdf87a"}},{"arxiv_id":"2509.07730","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-07730","title":"M-BRe: Discovering Training Samples for Relation Extraction from Unlabeled Texts with Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Lzx-ZBC/M-BRe","path":"NER/bbn_afet/multi-fgner.py","file_url":"https://github.com/Lzx-ZBC/M-BRe/blob/HEAD/NER/bbn_afet/multi-fgner.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, Lzx-ZBC/M-BRe when it was checked","code_sha256":"e9f46da936abe1ae","code_sha256_prefix":"e9f46da936abe1ae","mcp_get_code":{"code_sha256":"e9f46da936abe1ae"}},{"arxiv_id":"2509.07730","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-07730","title":"M-BRe: Discovering Training Samples for Relation Extraction from Unlabeled Texts with Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Lzx-ZBC/M-BRe","path":"NER/ontonotes_uf/multi-fgner.py","file_url":"https://github.com/Lzx-ZBC/M-BRe/blob/HEAD/NER/ontonotes_uf/multi-fgner.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, Lzx-ZBC/M-BRe when it was checked","code_sha256":"0d568a7b50137cda","code_sha256_prefix":"0d568a7b50137cda","mcp_get_code":{"code_sha256":"0d568a7b50137cda"}},{"arxiv_id":"2505.05505","arxiv_id_is_arxiv":true,"paper":"/paper/apply-hierarchical-chain-of-generation-to","title":"Apply Hierarchical-Chain-of-Generation to Complex Attributes Text-to-3D Generation","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wakals/GASCOL","path":"threestudio/gpt/PE.py","file_url":"https://github.com/Wakals/GASCOL/blob/HEAD/threestudio/gpt/PE.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a738297eb782fb24","code_sha256_prefix":"a738297eb782fb24","mcp_get_code":{"code_sha256":"a738297eb782fb24"}},{"arxiv_id":"2503.16212","arxiv_id_is_arxiv":true,"paper":"/paper/mathfusion-enhancing-mathematic-problem","title":"MathFusion: Enhancing Mathematic Problem-solving of LLM through Instruction Fusion","date":"2025-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qizhipei/mathfusion","path":"evaluation/dart_math/olympiadbench.py","file_url":"https://github.com/qizhipei/mathfusion/blob/HEAD/evaluation/dart_math/olympiadbench.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":"e6eeb93f5a059925","code_sha256_prefix":"e6eeb93f5a059925","mcp_get_code":{"code_sha256":"e6eeb93f5a059925"}},{"arxiv_id":"2501.18623","arxiv_id_is_arxiv":true,"paper":"/paper/vlmaterial-procedural-material-generation","title":"VLMaterial: Procedural Material Generation with Large Vision-Language Models","date":"2025-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-gfx/VLMaterial","path":"data_scripts/gen_programs_llm_async.py","file_url":"https://github.com/mit-gfx/VLMaterial/blob/HEAD/data_scripts/gen_programs_llm_async.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3884ccd0ec99644e","code_sha256_prefix":"3884ccd0ec99644e","mcp_get_code":{"code_sha256":"3884ccd0ec99644e"}},{"arxiv_id":"2407.13690","arxiv_id_is_arxiv":true,"paper":"/paper/dart-math-difficulty-aware-rejection-tuning-1","title":"DART-Math: Difficulty-Aware Rejection Tuning for Mathematical Problem-Solving","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-nlp/dart-math","path":"dart_math/olympiadbench.py","file_url":"https://github.com/hkust-nlp/dart-math/blob/HEAD/dart_math/olympiadbench.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":"e6eeb93f5a059925","code_sha256_prefix":"e6eeb93f5a059925","mcp_get_code":{"code_sha256":"e6eeb93f5a059925"}},{"arxiv_id":"2406.15885","arxiv_id_is_arxiv":true,"paper":"/paper/the-music-maestro-or-the-musically-challenged","title":"The Music Maestro or The Musically Challenged, A Massive Music Evaluation Benchmark for Large Language Models","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zcli-charlie/ziqi-eval","path":"src/five-shot.py","file_url":"https://github.com/zcli-charlie/ziqi-eval/blob/HEAD/src/five-shot.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, zcli-charlie/ziqi-eval when it was checked","code_sha256":"e5b9d3d8fb4bd79d","code_sha256_prefix":"e5b9d3d8fb4bd79d","mcp_get_code":{"code_sha256":"e5b9d3d8fb4bd79d"}},{"arxiv_id":"2406.09948","arxiv_id_is_arxiv":true,"paper":"/paper/blend-a-benchmark-for-llms-on-everyday","title":"BLEnD: A Benchmark for LLMs on Everyday Knowledge in Diverse Cultures and Languages","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlee0212/BLEnD","path":"model_inference.py","file_url":"https://github.com/nlee0212/BLEnD/blob/HEAD/model_inference.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, nlee0212/BLEnD when it was checked","code_sha256":"debb9aac44c9ee82","code_sha256_prefix":"debb9aac44c9ee82","mcp_get_code":{"code_sha256":"debb9aac44c9ee82"}},{"arxiv_id":"2405.10548","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-can-exploit-cross-task-in","title":"Language Models can Exploit Cross-Task In-context Learning for Data-Scarce Novel Tasks","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"C-anwoy/Cross-Task-ICL","path":"LLAMA-psudo.py","file_url":"https://github.com/C-anwoy/Cross-Task-ICL/blob/HEAD/LLAMA-psudo.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":"64e4f9b4c5d53a6b","code_sha256_prefix":"64e4f9b4c5d53a6b","mcp_get_code":{"code_sha256":"64e4f9b4c5d53a6b"}},{"arxiv_id":"2404.02418","arxiv_id_is_arxiv":true,"paper":"/paper/auxiliary-task-demands-mask-the-capabilities","title":"Auxiliary task demands mask the capabilities of smaller language models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jennhu/lm-task-demands","path":"src/metrics/crt.py","file_url":"https://github.com/jennhu/lm-task-demands/blob/HEAD/src/metrics/crt.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, jennhu/lm-task-demands when it was checked","code_sha256":"29db9cb7090f2405","code_sha256_prefix":"29db9cb7090f2405","mcp_get_code":{"code_sha256":"29db9cb7090f2405"}},{"arxiv_id":"2403.20009","arxiv_id_is_arxiv":true,"paper":"/paper/on-large-language-models-hallucination-with","title":"On Large Language Models' Hallucination with Regard to Known Facts","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dcdsf321/known_fact_hallucination","path":"get_model_output_example_opt.py","file_url":"https://github.com/dcdsf321/known_fact_hallucination/blob/HEAD/get_model_output_example_opt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7189a783afded05","code_sha256_prefix":"c7189a783afded05","mcp_get_code":{"code_sha256":"c7189a783afded05"}},{"arxiv_id":"2403.02966","arxiv_id_is_arxiv":true,"paper":"/paper/evidence-focused-fact-summarization-for","title":"Evidence-Focused Fact Summarization for Knowledge-Augmented Zero-Shot Question Answering","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kk13332488/EFSum","path":"hallucination_check/hallucination_checking.py","file_url":"https://github.com/kk13332488/EFSum/blob/HEAD/hallucination_check/hallucination_checking.py","status":"ran","verification_level":1,"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, kk13332488/EFSum when it was checked","code_sha256":"6cd4220d01988589","code_sha256_prefix":"6cd4220d01988589","mcp_get_code":{"code_sha256":"6cd4220d01988589"}},{"arxiv_id":"2308.16705","arxiv_id_is_arxiv":true,"paper":"/paper/crehate-cross-cultural-re-annotation-of","title":"Exploring Cross-Cultural Differences in English Hate Speech Annotations: From Dataset Construction to Analysis","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlee0212/crehate","path":"llm_inference.py","file_url":"https://github.com/nlee0212/crehate/blob/HEAD/llm_inference.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, nlee0212/crehate when it was checked","code_sha256":"c083b5f35fb91864","code_sha256_prefix":"c083b5f35fb91864","mcp_get_code":{"code_sha256":"c083b5f35fb91864"}},{"arxiv_id":"2302.12239","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-a-language-easy-to-deep-learn","title":"What makes a language easy to deep-learn? Deep neural networks and humans similarly benefit from compositional structure","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lgalke/easy2deeplearn","path":"lang2prompt.py","file_url":"https://github.com/lgalke/easy2deeplearn/blob/HEAD/lang2prompt.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":"246b6d3de7325350","code_sha256_prefix":"246b6d3de7325350","mcp_get_code":{"code_sha256":"246b6d3de7325350"}}],"record_sha256":"231422c7ea35d43bbbebc47c4a07db54985b59bd6976ee41e7fd803e92b2a0ae","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}