{"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/add-spaces","entry":"add_spaces","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":2,"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":4,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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":"2505.23564","paper":"/paper/segment-policy-optimization-effective-segment","title":"Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large Language Models","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIFrameResearch/SPO","path":"src/guidance/_program.py","file_url":"https://github.com/AIFrameResearch/SPO/blob/HEAD/src/guidance/_program.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0751f6d65e347f7d","mcp_get_code":{"code_sha256":"0751f6d65e347f7d"}},{"arxiv_id":"2412.07763","paper":"/paper/bayesian-optimization-of-antibodies-informed","title":"Bayesian Optimization of Antibodies Informed by a Generative Model of Evolving Sequences","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alannawzadamin/clonebo","path":"clonebo/seq_tools.py","file_url":"https://github.com/alannawzadamin/clonebo/blob/HEAD/clonebo/seq_tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54d062332b0337d9","mcp_get_code":{"code_sha256":"54d062332b0337d9"}},{"arxiv_id":"2411.08745","paper":"/paper/separating-tongue-from-thought-activation","title":"Separating Tongue from Thought: Activation Patching Reveals Language-Agnostic Concept Representations in Transformers","date":"2024-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"butanium/llm-lang-agnostic","path":"src/prompt_tools.py","file_url":"https://github.com/butanium/llm-lang-agnostic/blob/HEAD/src/prompt_tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d9985dd3f6df938f","mcp_get_code":{"code_sha256":"d9985dd3f6df938f"}},{"arxiv_id":"2410.01679","paper":"/paper/vineppo-unlocking-rl-potential-for-llm","title":"VinePPO: Unlocking RL Potential For LLM Reasoning Through Refined Credit Assignment","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcgill-nlp/vineppo","path":"src/guidance/_program.py","file_url":"https://github.com/mcgill-nlp/vineppo/blob/HEAD/src/guidance/_program.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0751f6d65e347f7d","mcp_get_code":{"code_sha256":"0751f6d65e347f7d"}},{"arxiv_id":"2024.findings-emnlp.365","paper":null,"title":"arXiv:2024.findings-emnlp.365","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UKPLab/m2qa","path":"Experiments/evaluate_model.py","file_url":"https://github.com/UKPLab/m2qa/blob/HEAD/Experiments/evaluate_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":"4c5509ae6404506e","mcp_get_code":{"code_sha256":"4c5509ae6404506e"}}]}