{"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/truncate-text","entry":"truncate_text","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":9,"n_papers_ran":5,"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":9,"n_samples_ran":6,"n_samples_fingerprinted":5,"n_places":10,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"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":"2606.18850","paper":"/paper/arxiv-2606-18850","title":"ScholarSum: Student-Teacher Abstractive Summarization via Knowledge Graph Reasoning and Reflective Refinement","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Xiaoyu-Tao/ScholarSum","path":"src/papersum/pipeline.py","file_url":"https://github.com/Xiaoyu-Tao/ScholarSum/blob/HEAD/src/papersum/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"262515fb6a504a33","mcp_get_code":{"code_sha256":"262515fb6a504a33"}},{"arxiv_id":"2606.11817","paper":"/paper/arxiv-2606-11817","title":"Grammar-Constrained Decoding Can Jailbreak LLMs into Generating Malicious Code","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"TsinghuaISE/CodeSpear-CodeShield","path":"Attack/LocalModels/script/evaluate_asr.py","file_url":"https://github.com/TsinghuaISE/CodeSpear-CodeShield/blob/HEAD/Attack/LocalModels/script/evaluate_asr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d74ef718b83da46a","mcp_get_code":{"code_sha256":"d74ef718b83da46a"}},{"arxiv_id":"2606.11817","paper":"/paper/arxiv-2606-11817","title":"Grammar-Constrained Decoding Can Jailbreak LLMs into Generating Malicious Code","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"TsinghuaISE/CodeSpear-CodeShield","path":"Attack/LocalModels/script/evaluate_mr.py","file_url":"https://github.com/TsinghuaISE/CodeSpear-CodeShield/blob/HEAD/Attack/LocalModels/script/evaluate_mr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fd2cfb4a6f4f355b","mcp_get_code":{"code_sha256":"fd2cfb4a6f4f355b"}},{"arxiv_id":"2604.19070","paper":"/paper/arxiv-2604-19070","title":"TRN-R1-Zero: Text-rich Network Reasoning via LLMs with Reinforcement Learning Only","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"superallen13/TRN-R1-Zero","path":"trn_r1_zero/prompts/build_training_dataset.py","file_url":"https://github.com/superallen13/TRN-R1-Zero/blob/HEAD/trn_r1_zero/prompts/build_training_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c442d508e706ca37","mcp_get_code":{"code_sha256":"c442d508e706ca37"}},{"arxiv_id":"2504.20860","paper":null,"title":"arXiv:2504.20860","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":null,"repo":"mainaksingha01/FedMVP","path":"model/FedMVP.py","file_url":"https://github.com/mainaksingha01/FedMVP/blob/HEAD/model/FedMVP.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d087afcbd5eb3bb4","mcp_get_code":{"code_sha256":"d087afcbd5eb3bb4"}},{"arxiv_id":"2503.07358","paper":"/paper/repost-scalable-repository-level-coding","title":"RepoST: Scalable Repository-Level Coding Environment Construction with Sandbox Testing","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiqingxyq/RepoST","path":"CodeRAGBench_evaluation/chunk.py","file_url":"https://github.com/yiqingxyq/RepoST/blob/HEAD/CodeRAGBench_evaluation/chunk.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"efd84bdfa4cd0bb2","mcp_get_code":{"code_sha256":"efd84bdfa4cd0bb2"}},{"arxiv_id":"2411.11758","paper":"/paper/the-power-of-many-multi-agent-multimodal","title":"The Power of Many: Multi-Agent Multimodal Models for Cultural Image Captioning","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michigannlp/mosaic","path":"eval/auto_metrics.py","file_url":"https://github.com/michigannlp/mosaic/blob/HEAD/eval/auto_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"87e1a6b6776d4d2e","mcp_get_code":{"code_sha256":"87e1a6b6776d4d2e"}},{"arxiv_id":"2403.03194","paper":"/paper/magid-an-automated-pipeline-for-generating","title":"MAGID: An Automated Pipeline for Generating Synthetic Multi-modal Datasets","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/MAGID","path":"src/tools.py","file_url":"https://github.com/amazon-science/MAGID/blob/HEAD/src/tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e050e890812a53b4","mcp_get_code":{"code_sha256":"e050e890812a53b4"}},{"arxiv_id":"aaai_26259","paper":null,"title":"arXiv:aaai_26259","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"stxupengyu/LSFA","path":"preprocess.py","file_url":"https://github.com/stxupengyu/LSFA/blob/HEAD/preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7218abc94d89db7e","mcp_get_code":{"code_sha256":"7218abc94d89db7e"}},{"arxiv_id":"2025.naacl-long.152","paper":null,"title":"arXiv:2025.naacl-long.152","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MichiganNLP/MosAIC","path":"eval/auto_metrics.py","file_url":"https://github.com/MichiganNLP/MosAIC/blob/HEAD/eval/auto_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"87e1a6b6776d4d2e","mcp_get_code":{"code_sha256":"87e1a6b6776d4d2e"}}]}