{"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/rouge-n","entry":"rouge_n","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":1,"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":8,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":4,"n_places_pointer_only_link_open":2,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"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":"2607.18304","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-18304","title":"TD-DPO: Difference-Aware Preference Optimization for Mitigating Sycophancy in Clinical Autism Intervention Dialogue","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Shuzhong-Lai/TD-DPO","path":"src/td_dpo/evaluation.py","file_url":"https://github.com/Shuzhong-Lai/TD-DPO/blob/HEAD/src/td_dpo/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd18d871cf77ae12","code_sha256_prefix":"dd18d871cf77ae12","mcp_get_code":{"code_sha256":"dd18d871cf77ae12"}},{"arxiv_id":"2405.10587","arxiv_id_is_arxiv":true,"paper":"/paper/rdrec-rationale-distillation-for-llm-based","title":"RDRec: Rationale Distillation for LLM-based Recommendation","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangXFng/RDRec","path":"utils/rouge.py","file_url":"https://github.com/WangXFng/RDRec/blob/HEAD/utils/rouge.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, WangXFng/RDRec when it was checked","code_sha256":"eb37c01f4067f842","code_sha256_prefix":"eb37c01f4067f842","mcp_get_code":{"code_sha256":"eb37c01f4067f842"}},{"arxiv_id":"2404.11262","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-based-pseudo-likelihood-for","title":"Sampling-based Pseudo-Likelihood for Membership Inference Attacks","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlp-titech/samia","path":"src/eval_samia.py","file_url":"https://github.com/nlp-titech/samia/blob/HEAD/src/eval_samia.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":"1c31724ab6c583c2","code_sha256_prefix":"1c31724ab6c583c2","mcp_get_code":{"code_sha256":"1c31724ab6c583c2"}},{"arxiv_id":"2402.16050","arxiv_id_is_arxiv":true,"paper":"/paper/lstp-language-guided-spatial-temporal-prompt","title":"Efficient Temporal Extrapolation of Multimodal Large Language Models with Temporal Grounding Bridge","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigai-nlco/VideoTGB","path":"src/gadgets/my_metrics.py","file_url":"https://github.com/bigai-nlco/VideoTGB/blob/HEAD/src/gadgets/my_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":"ebd4b08feabf5d88","code_sha256_prefix":"ebd4b08feabf5d88","mcp_get_code":{"code_sha256":"ebd4b08feabf5d88"}},{"arxiv_id":"2310.08129","arxiv_id_is_arxiv":true,"paper":"/paper/tailored-visions-enhancing-text-to-image","title":"Tailored Visions: Enhancing Text-to-Image Generation with Personalized Prompt Rewriting","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzjchen/tailored-visions","path":"rougeL/rouge_score.py","file_url":"https://github.com/zzjchen/tailored-visions/blob/HEAD/rougeL/rouge_score.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, zzjchen/tailored-visions when it was checked","code_sha256":"88dade7220148dcb","code_sha256_prefix":"88dade7220148dcb","mcp_get_code":{"code_sha256":"88dade7220148dcb"}},{"arxiv_id":"2308.12241","arxiv_id_is_arxiv":true,"paper":"/paper/llmrec-benchmarking-large-language-models-on","title":"LLMRec: Benchmarking Large Language Models on Recommendation Task","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"williamliujl/llmrec","path":"utils/evaluate/rouge.py","file_url":"https://github.com/williamliujl/llmrec/blob/HEAD/utils/evaluate/rouge.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from WangXFng/RDRec, and GitHub detected no licence in that repository when it was checked","code_sha256":"eb37c01f4067f842","code_sha256_prefix":"eb37c01f4067f842","mcp_get_code":{"code_sha256":"eb37c01f4067f842"}},{"arxiv_id":"2108.01879","arxiv_id_is_arxiv":true,"paper":"/paper/summary-explorer-visualizing-the-state-of-the","title":"Summary Explorer: Visualizing the State of the Art in Text Summarization","date":"2021-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pltrdy/rouge","path":"rouge/rouge_score.py","file_url":"https://github.com/pltrdy/rouge/blob/HEAD/rouge/rouge_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd3dfb07f3d3bf48","code_sha256_prefix":"dd3dfb07f3d3bf48","mcp_get_code":{"code_sha256":"dd3dfb07f3d3bf48"}},{"arxiv_id":"1908.07687","arxiv_id_is_arxiv":true,"paper":"/paper/190807687","title":"MoEL: Mixture of Empathetic Listeners","date":"2019-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/MoEL","path":"utils/metric.py","file_url":"https://github.com/HLTCHKUST/MoEL/blob/HEAD/utils/metric.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":"ee28f00102414dc1","code_sha256_prefix":"ee28f00102414dc1","mcp_get_code":{"code_sha256":"ee28f00102414dc1"}},{"arxiv_id":"1905.10033","arxiv_id_is_arxiv":true,"paper":"/paper/personalizing-dialogue-agents-via-meta","title":"Personalizing Dialogue Agents via Meta-Learning","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/PAML","path":"utils/metric.py","file_url":"https://github.com/HLTCHKUST/PAML/blob/HEAD/utils/metric.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":"ee28f00102414dc1","code_sha256_prefix":"ee28f00102414dc1","mcp_get_code":{"code_sha256":"ee28f00102414dc1"}},{"arxiv_id":"1805.09461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-sequence-to","title":"Deep Reinforcement Learning For Sequence to Sequence Models","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaserkl/RLSeq2Seq","path":"src/rouge.py","file_url":"https://github.com/yaserkl/RLSeq2Seq/blob/HEAD/src/rouge.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from WangXFng/RDRec, and GitHub detected no licence in that repository when it was checked","code_sha256":"eb37c01f4067f842","code_sha256_prefix":"eb37c01f4067f842","mcp_get_code":{"code_sha256":"eb37c01f4067f842"}},{"arxiv_id":"1805.09461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-sequence-to","title":"Deep Reinforcement Learning For Sequence to Sequence Models","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaserkl/RLSeq2Seq","path":"src/rouge_tensor.py","file_url":"https://github.com/yaserkl/RLSeq2Seq/blob/HEAD/src/rouge_tensor.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":"eb5c66f55e72516a","code_sha256_prefix":"eb5c66f55e72516a","mcp_get_code":{"code_sha256":"eb5c66f55e72516a"}},{"arxiv_id":"2020.findings-emnlp.289","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.findings-emnlp.289","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"h4ste/mtft_zsl","path":"fslks/eval/rouge.py","file_url":"https://github.com/h4ste/mtft_zsl/blob/HEAD/fslks/eval/rouge.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":"a06819c8659ed609","code_sha256_prefix":"a06819c8659ed609","mcp_get_code":{"code_sha256":"a06819c8659ed609"}}],"record_sha256":"4ecf007ea86ca39ca04fc5f7beda9d5193938b07f23e649da165451811fe80d5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}