{"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/parse-prompt","entry":"parse_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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":11,"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":4,"ran_fixture":0,"ran":5,"unverified":2},"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.30965","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30965","title":"ImmersiveTTS: Environment-Aware Text-to-Speech with Multimodal Diffusion Transformer and Domain-Specific Representation Alignment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"black-forest-labs/flux","path":"src/flux/cli_control.py","file_url":"https://github.com/black-forest-labs/flux/blob/HEAD/src/flux/cli_control.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":"ab1c691728f4f9a5","code_sha256_prefix":"ab1c691728f4f9a5","mcp_get_code":{"code_sha256":"ab1c691728f4f9a5"}},{"arxiv_id":"2605.27805","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-27805","title":"ChildEval:WHEN LARGE LANGUAGE MODELS MEET CHILDREN'S PERSONALITIES","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ziyanluo/ChildEval","path":"evaluation_scripts/evaluate_accuracy_name.py","file_url":"https://github.com/ziyanluo/ChildEval/blob/HEAD/evaluation_scripts/evaluate_accuracy_name.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, ziyanluo/ChildEval when it was checked","code_sha256":"1e922028e3fcabd6","code_sha256_prefix":"1e922028e3fcabd6","mcp_get_code":{"code_sha256":"1e922028e3fcabd6"}},{"arxiv_id":"2605.13740","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13740","title":"Learning POMDP World Models from Observations with Language-Model Priors","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"aidan-curtis/pomdp_coder","path":"uncertain_worms/utils.py","file_url":"https://github.com/aidan-curtis/pomdp_coder/blob/HEAD/uncertain_worms/utils.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, aidan-curtis/pomdp_coder when it was checked","code_sha256":"3f2596ece2e1bf5c","code_sha256_prefix":"3f2596ece2e1bf5c","mcp_get_code":{"code_sha256":"3f2596ece2e1bf5c"}},{"arxiv_id":"2605.13740","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13740","title":"Learning POMDP World Models from Observations with Language-Model Priors","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"atomresearch/pinductor","path":"uncertain_worms/utils.py","file_url":"https://github.com/atomresearch/pinductor/blob/HEAD/uncertain_worms/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":"25c69312cf46044a","code_sha256_prefix":"25c69312cf46044a","mcp_get_code":{"code_sha256":"25c69312cf46044a"}},{"arxiv_id":"2511.14096","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-14096","title":"NeuroPath: Neurobiology-Inspired Path Tracking and Reflection for Semantically Coherent Retrieval","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"KennyCaty/NeuroPath","path":"src/rag_neuropath.py","file_url":"https://github.com/KennyCaty/NeuroPath/blob/HEAD/src/rag_neuropath.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d581f1e22c7c99ef","code_sha256_prefix":"d581f1e22c7c99ef","mcp_get_code":{"code_sha256":"d581f1e22c7c99ef"}},{"arxiv_id":"2511.14096","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-14096","title":"NeuroPath: Neurobiology-Inspired Path Tracking and Reflection for Semantically Coherent Retrieval","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"KennyCaty/NeuroPath","path":"src/baselines/ircot_246.py","file_url":"https://github.com/KennyCaty/NeuroPath/blob/HEAD/src/baselines/ircot_246.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":"eaf91b9196566123","code_sha256_prefix":"eaf91b9196566123","mcp_get_code":{"code_sha256":"eaf91b9196566123"}},{"arxiv_id":"2506.08249","arxiv_id_is_arxiv":true,"paper":"/paper/2506-08249","title":"RADAR: Benchmarking Language Models on Imperfect Tabular Data","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenqgu/radar","path":"radar/logger.py","file_url":"https://github.com/kenqgu/radar/blob/HEAD/radar/logger.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":"e3b663392c838eb8","code_sha256_prefix":"e3b663392c838eb8","mcp_get_code":{"code_sha256":"e3b663392c838eb8"}},{"arxiv_id":"2405.15383","arxiv_id_is_arxiv":true,"paper":"/paper/generating-code-world-models-with-large","title":"Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicoladainese96/code-world-models","path":"src/code_helpers.py","file_url":"https://github.com/nicoladainese96/code-world-models/blob/HEAD/src/code_helpers.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":"ea18a35e9636f7dd","code_sha256_prefix":"ea18a35e9636f7dd","mcp_get_code":{"code_sha256":"ea18a35e9636f7dd"}},{"arxiv_id":"2311.08396","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-audio-captioning-with-audio","title":"Zero-shot audio captioning with audio-language model guidance and audio context keywords","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/zeraucap","path":"audio_captioning/language_model/utlis.py","file_url":"https://github.com/explainableml/zeraucap/blob/HEAD/audio_captioning/language_model/utlis.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, explainableml/zeraucap when it was checked","code_sha256":"56d5003b7ee3900b","code_sha256_prefix":"56d5003b7ee3900b","mcp_get_code":{"code_sha256":"56d5003b7ee3900b"}},{"arxiv_id":"2110.11316","arxiv_id_is_arxiv":true,"paper":"/paper/cloob-modern-hopfield-networks-with-infoloob-1","title":"CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP","date":"2021-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JD-P/cloob-latent-diffusion","path":"cfg_sample.py","file_url":"https://github.com/JD-P/cloob-latent-diffusion/blob/HEAD/cfg_sample.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":"1fdcc5450a1266f3","code_sha256_prefix":"1fdcc5450a1266f3","mcp_get_code":{"code_sha256":"1fdcc5450a1266f3"}},{"arxiv_id":"2105.05233","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-beat-gans-on-image-synthesis","title":"Diffusion Models Beat GANs on Image Synthesis","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"afiaka87/clip-guided-diffusion","path":"cgd/script_util.py","file_url":"https://github.com/afiaka87/clip-guided-diffusion/blob/HEAD/cgd/script_util.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":"0a8c631b651f4813","code_sha256_prefix":"0a8c631b651f4813","mcp_get_code":{"code_sha256":"0a8c631b651f4813"}}],"record_sha256":"af0058b08048706cc7819098056f41f90e21df6c2ca4095898afb7ae881c4507","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}