{"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/truncate-text","entry":"truncate_text","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":9,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":7,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":0,"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":7,"ran_fixture":0,"ran":2,"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":"2606.18850","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"262515fb6a504a33","code_sha256_prefix":"262515fb6a504a33","mcp_get_code":{"code_sha256":"262515fb6a504a33"}},{"arxiv_id":"2606.11817","arxiv_id_is_arxiv":true,"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_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":"d74ef718b83da46a","code_sha256_prefix":"d74ef718b83da46a","mcp_get_code":{"code_sha256":"d74ef718b83da46a"}},{"arxiv_id":"2606.11817","arxiv_id_is_arxiv":true,"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_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":"fd2cfb4a6f4f355b","code_sha256_prefix":"fd2cfb4a6f4f355b","mcp_get_code":{"code_sha256":"fd2cfb4a6f4f355b"}},{"arxiv_id":"2604.19070","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c442d508e706ca37","code_sha256_prefix":"c442d508e706ca37","mcp_get_code":{"code_sha256":"c442d508e706ca37"}},{"arxiv_id":"2504.20860","arxiv_id_is_arxiv":true,"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_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":"d087afcbd5eb3bb4","code_sha256_prefix":"d087afcbd5eb3bb4","mcp_get_code":{"code_sha256":"d087afcbd5eb3bb4"}},{"arxiv_id":"2503.07358","arxiv_id_is_arxiv":true,"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":"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":"efd84bdfa4cd0bb2","code_sha256_prefix":"efd84bdfa4cd0bb2","mcp_get_code":{"code_sha256":"efd84bdfa4cd0bb2"}},{"arxiv_id":"2411.11758","arxiv_id_is_arxiv":true,"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":"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":"87e1a6b6776d4d2e","code_sha256_prefix":"87e1a6b6776d4d2e","mcp_get_code":{"code_sha256":"87e1a6b6776d4d2e"}},{"arxiv_id":"2403.03194","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e050e890812a53b4","code_sha256_prefix":"e050e890812a53b4","mcp_get_code":{"code_sha256":"e050e890812a53b4"}},{"arxiv_id":"aaai_26259","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id 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":"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":"7218abc94d89db7e","code_sha256_prefix":"7218abc94d89db7e","mcp_get_code":{"code_sha256":"7218abc94d89db7e"}},{"arxiv_id":"2025.naacl-long.152","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"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":"87e1a6b6776d4d2e","code_sha256_prefix":"87e1a6b6776d4d2e","mcp_get_code":{"code_sha256":"87e1a6b6776d4d2e"}}],"record_sha256":"b2fc85286ee45037338ff0c231c8cc9f927172fcada31077ec8ec99e7192b861","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}