{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/message-to-str","entry":"message_to_str","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":0,"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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2411.14503","paper":"/paper/planning-driven-programming-a-large-language","title":"Planning-Driven Programming: A Large Language Model Programming Workflow","date":"2024-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"you68681/lpw","path":"programming/generators/model.py","file_url":"https://github.com/you68681/lpw/blob/HEAD/programming/generators/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a067a230397d97aa","mcp_get_code":{"code_sha256":"a067a230397d97aa"}},{"arxiv_id":"2407.11770","paper":"/paper/robust-utility-preserving-text-anonymization","title":"Robust Utility-Preserving Text Anonymization Based on Large Language Models","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/arxiv2024-rupta","path":"generators/model.py","file_url":"https://github.com/ukplab/arxiv2024-rupta/blob/HEAD/generators/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a067a230397d97aa","mcp_get_code":{"code_sha256":"a067a230397d97aa"}},{"arxiv_id":"2404.02183","paper":"/paper/self-organized-agents-a-llm-multi-agent","title":"Self-Organized Agents: A LLM Multi-Agent Framework toward Ultra Large-Scale Code Generation and Optimization","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsukushiai/self-organized-agent","path":"programming_runs/generators/model.py","file_url":"https://github.com/tsukushiai/self-organized-agent/blob/HEAD/programming_runs/generators/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a067a230397d97aa","mcp_get_code":{"code_sha256":"a067a230397d97aa"}},{"arxiv_id":"2402.16906","paper":"/paper/ldb-a-large-language-model-debugger-via","title":"Debug like a Human: A Large Language Model Debugger via Verifying Runtime Execution Step-by-step","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"floridsleeves/llmdebugger","path":"programming/generators/model.py","file_url":"https://github.com/floridsleeves/llmdebugger/blob/HEAD/programming/generators/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a067a230397d97aa","mcp_get_code":{"code_sha256":"a067a230397d97aa"}},{"arxiv_id":"2310.04406","paper":"/paper/language-agent-tree-search-unifies-reasoning","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyz245/LanguageAgentTreeSearch","path":"programming/generators/model.py","file_url":"https://github.com/andyz245/LanguageAgentTreeSearch/blob/HEAD/programming/generators/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a067a230397d97aa","mcp_get_code":{"code_sha256":"a067a230397d97aa"}}]}