{"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/bleu","entry":"bleu","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":13,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":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":13,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":5,"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":2,"ran_fixture":0,"ran":8,"unverified":3},"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":"2412.06141","arxiv_id_is_arxiv":true,"paper":"/paper/mmedpo-aligning-medical-vision-language","title":"MMedPO: Aligning Medical Vision-Language Models with Clinical-Aware Multimodal Preference Optimization","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiming-lab/mmedpo","path":"eval/eval_report.py","file_url":"https://github.com/aiming-lab/mmedpo/blob/HEAD/eval/eval_report.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd8fbb4ca9a20927","code_sha256_prefix":"cd8fbb4ca9a20927","mcp_get_code":{"code_sha256":"cd8fbb4ca9a20927"}},{"arxiv_id":"2406.13236","arxiv_id_is_arxiv":true,"paper":"/paper/data-contamination-can-cross-language","title":"Data Contamination Can Cross Language Barriers","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShangDataLab/Deep-Contam","path":"detect_method/metrics.py","file_url":"https://github.com/ShangDataLab/Deep-Contam/blob/HEAD/detect_method/metrics.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, ShangDataLab/Deep-Contam when it was checked","code_sha256":"316e7af195b72405","code_sha256_prefix":"316e7af195b72405","mcp_get_code":{"code_sha256":"316e7af195b72405"}},{"arxiv_id":"2406.13173","arxiv_id_is_arxiv":true,"paper":"/paper/biomedical-visual-instruction-tuning-with","title":"Biomedical Visual Instruction Tuning with Clinician Preference Alignment","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mao1207/BioMed-VITAL","path":"eval/evaluate_metrics.py","file_url":"https://github.com/mao1207/BioMed-VITAL/blob/HEAD/eval/evaluate_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"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, mao1207/BioMed-VITAL when it was checked","code_sha256":"027c69e6d41cb10b","code_sha256_prefix":"027c69e6d41cb10b","mcp_get_code":{"code_sha256":"027c69e6d41cb10b"}},{"arxiv_id":"2404.03637","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"applied-machine-learning-lab/dt4ier","path":"GPT_model_accuracy.py","file_url":"https://github.com/applied-machine-learning-lab/dt4ier/blob/HEAD/GPT_model_accuracy.py","status":"ran","verification_level":1,"contract_check":null,"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, applied-machine-learning-lab/dt4ier when it was checked","code_sha256":"177e65070d17ec10","code_sha256_prefix":"177e65070d17ec10","mcp_get_code":{"code_sha256":"177e65070d17ec10"}},{"arxiv_id":"2404.03637","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"applied-machine-learning-lab/dt4ier","path":"baseline.py","file_url":"https://github.com/applied-machine-learning-lab/dt4ier/blob/HEAD/baseline.py","status":"ran","verification_level":1,"contract_check":null,"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, applied-machine-learning-lab/dt4ier when it was checked","code_sha256":"0b64b2b3b2700f5b","code_sha256_prefix":"0b64b2b3b2700f5b","mcp_get_code":{"code_sha256":"0b64b2b3b2700f5b"}},{"arxiv_id":"2311.10774","arxiv_id_is_arxiv":true,"paper":"/paper/mmc-advancing-multimodal-chart-understanding","title":"MMC: Advancing Multimodal Chart Understanding with Large-scale Instruction Tuning","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FuxiaoLiu/VisualNews-Repository","path":"model/model.py","file_url":"https://github.com/FuxiaoLiu/VisualNews-Repository/blob/HEAD/model/model.py","status":"unverified","verification_level":0,"contract_check":null,"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, FuxiaoLiu/VisualNews-Repository when it was checked","code_sha256":"2def4d18e743753b","code_sha256_prefix":"2def4d18e743753b","mcp_get_code":{"code_sha256":"2def4d18e743753b"}},{"arxiv_id":"1911.09709","arxiv_id_is_arxiv":true,"paper":"/paper/automatically-neutralizing-subjective-bias-in","title":"Automatically Neutralizing Subjective Bias in Text","date":"2019-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpryzant/neutralizing-bias","path":"baselines/evaluation.py","file_url":"https://github.com/rpryzant/neutralizing-bias/blob/HEAD/baselines/evaluation.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":"434a3b59116b43ca","code_sha256_prefix":"434a3b59116b43ca","mcp_get_code":{"code_sha256":"434a3b59116b43ca"}},{"arxiv_id":"1909.01214","arxiv_id_is_arxiv":true,"paper":"/paper/better-rewards-yield-better-summaries","title":"Better Rewards Yield Better Summaries: Learning to Summarise Without References","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yg211/summary-reward-no-reference","path":"scorer/auto_metrics/metrics.py","file_url":"https://github.com/yg211/summary-reward-no-reference/blob/HEAD/scorer/auto_metrics/metrics.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":"b8a6998c443cf95c","code_sha256_prefix":"b8a6998c443cf95c","mcp_get_code":{"code_sha256":"b8a6998c443cf95c"}},{"arxiv_id":"1808.09644","arxiv_id_is_arxiv":true,"paper":"/paper/on-tree-based-neural-sentence-modeling","title":"On Tree-Based Neural Sentence Modeling","date":"2018-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ExplorerFreda/TreeEnc","path":"src/utils.py","file_url":"https://github.com/ExplorerFreda/TreeEnc/blob/HEAD/src/utils.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":"678e6d5f0dc54710","code_sha256_prefix":"678e6d5f0dc54710","mcp_get_code":{"code_sha256":"678e6d5f0dc54710"}},{"arxiv_id":"1805.03989","arxiv_id_is_arxiv":true,"paper":"/paper/global-encoding-for-abstractive-summarization","title":"Global Encoding for Abstractive Summarization","date":"2018-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lancopku/Global-Encoding","path":"utils/metrics.py","file_url":"https://github.com/lancopku/Global-Encoding/blob/HEAD/utils/metrics.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":"6333d7dad419ba0a","code_sha256_prefix":"6333d7dad419ba0a","mcp_get_code":{"code_sha256":"6333d7dad419ba0a"}},{"arxiv_id":"1804.06437","arxiv_id_is_arxiv":true,"paper":"/paper/delete-retrieve-generate-a-simple-approach-to","title":"Delete, Retrieve, Generate: A Simple Approach to Sentiment and Style Transfer","date":"2018-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpryzant/delete_retrieve_generate","path":"src/evaluation.py","file_url":"https://github.com/rpryzant/delete_retrieve_generate/blob/HEAD/src/evaluation.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":"434a3b59116b43ca","code_sha256_prefix":"434a3b59116b43ca","mcp_get_code":{"code_sha256":"434a3b59116b43ca"}},{"arxiv_id":"1411.4555","arxiv_id_is_arxiv":true,"paper":"/paper/show-and-tell-a-neural-image-caption","title":"Show and Tell: A Neural Image Caption Generator","date":"2014-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicolafan/image-captioning-cnn-rnn","path":"src/models/metrics.py","file_url":"https://github.com/nicolafan/image-captioning-cnn-rnn/blob/HEAD/src/models/metrics.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":"f1bf9ccad2d63845","code_sha256_prefix":"f1bf9ccad2d63845","mcp_get_code":{"code_sha256":"f1bf9ccad2d63845"}},{"arxiv_id":"aaai_21320","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21320","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"siat-nlp/GALAXY","path":"galaxy/metrics/metrics.py","file_url":"https://github.com/siat-nlp/GALAXY/blob/HEAD/galaxy/metrics/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"49fd25cc7470b510","code_sha256_prefix":"49fd25cc7470b510","mcp_get_code":{"code_sha256":"49fd25cc7470b510"}},{"arxiv_id":"2023.findings-emnlp.313","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.313","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UKPLab/dior-cvae","path":"evaluation.py","file_url":"https://github.com/UKPLab/dior-cvae/blob/HEAD/evaluation.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":"aee28ff9a16afe4c","code_sha256_prefix":"aee28ff9a16afe4c","mcp_get_code":{"code_sha256":"aee28ff9a16afe4c"}}],"record_sha256":"b612be6636da14414b9030a6f336f571396abde20c4d0002108e57b1332ceeda","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}