{"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-results-to-str","entry":"rouge_results_to_str","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"n_places_pointer_only_link_open":5,"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":1,"ran_fixture":0,"ran":3,"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":"2405.04163","arxiv_id_is_arxiv":true,"paper":"/paper/medvoc-vocabulary-adaptation-for-fine-tuning","title":"MEDVOC: Vocabulary Adaptation for Fine-tuning Pre-trained Language Models on Medical Text Summarization","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gb-kgp/MEDVOC","path":"src/Model_Scripts/BertSumAbs_Modified_Scripts/src/cal_rouge.py","file_url":"https://github.com/gb-kgp/MEDVOC/blob/HEAD/src/Model_Scripts/BertSumAbs_Modified_Scripts/src/cal_rouge.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, gb-kgp/MEDVOC when it was checked","code_sha256":"14b39c4dc7a42e40","code_sha256_prefix":"14b39c4dc7a42e40","mcp_get_code":{"code_sha256":"14b39c4dc7a42e40"}},{"arxiv_id":"2212.10218","arxiv_id_is_arxiv":true,"paper":"/paper/ganlm-encoder-decoder-pre-training-with-an","title":"GanLM: Encoder-Decoder Pre-training with an Auxiliary Discriminator","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csjianyang/ganlm","path":"evaluation/cnn_dm.py","file_url":"https://github.com/csjianyang/ganlm/blob/HEAD/evaluation/cnn_dm.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":"c19b75e22d2023fb","code_sha256_prefix":"c19b75e22d2023fb","mcp_get_code":{"code_sha256":"c19b75e22d2023fb"}},{"arxiv_id":"2207.03509","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-the-difference-preparing-large","title":"Meta-Learning the Difference: Preparing Large Language Models for Efficient Adaptation","date":"2022-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/meta-learning-the-difference","path":"abstractive_summarization/src/cal_rouge.py","file_url":"https://github.com/amazon-research/meta-learning-the-difference/blob/HEAD/abstractive_summarization/src/cal_rouge.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":"3aa756a41c020da7","code_sha256_prefix":"3aa756a41c020da7","mcp_get_code":{"code_sha256":"3aa756a41c020da7"}},{"arxiv_id":"2004.14135","arxiv_id_is_arxiv":true,"paper":"/paper/bert-fine-tuning-for-arabic-text","title":"BERT Fine-tuning For Arabic Text Summarization","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mukhtar-algezoli/Arabic_PreSumm","path":"src/cal_rouge.py","file_url":"https://github.com/mukhtar-algezoli/Arabic_PreSumm/blob/HEAD/src/cal_rouge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 gb-kgp/MEDVOC, and GitHub detected no licence in that repository when it was checked","code_sha256":"14b39c4dc7a42e40","code_sha256_prefix":"14b39c4dc7a42e40","mcp_get_code":{"code_sha256":"14b39c4dc7a42e40"}},{"arxiv_id":"1910.14142","arxiv_id_is_arxiv":true,"paper":"/paper/discourse-aware-neural-extractive-model-for","title":"Discourse-Aware Neural Extractive Text Summarization","date":"2019-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng-xu/DiscoBERT","path":"model/pyrouge_metrics.py","file_url":"https://github.com/jiacheng-xu/DiscoBERT/blob/HEAD/model/pyrouge_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 gb-kgp/MEDVOC, and GitHub detected no licence in that repository when it was checked","code_sha256":"14b39c4dc7a42e40","code_sha256_prefix":"14b39c4dc7a42e40","mcp_get_code":{"code_sha256":"14b39c4dc7a42e40"}},{"arxiv_id":"1908.08345","arxiv_id_is_arxiv":true,"paper":"/paper/text-summarization-with-pretrained-encoders","title":"Text Summarization with Pretrained Encoders","date":"2019-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nachotp/BertCommentSum","path":"src/cal_rouge.py","file_url":"https://github.com/nachotp/BertCommentSum/blob/HEAD/src/cal_rouge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 gb-kgp/MEDVOC, and GitHub detected no licence in that repository when it was checked","code_sha256":"14b39c4dc7a42e40","code_sha256_prefix":"14b39c4dc7a42e40","mcp_get_code":{"code_sha256":"14b39c4dc7a42e40"}},{"arxiv_id":"1905.13164","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-transformers-for-multi-document","title":"Hierarchical Transformers for Multi-Document Summarization","date":"2019-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpyang/hiersumm","path":"src/abstractive/cal_rouge.py","file_url":"https://github.com/nlpyang/hiersumm/blob/HEAD/src/abstractive/cal_rouge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 gb-kgp/MEDVOC, and GitHub detected no licence in that repository when it was checked","code_sha256":"14b39c4dc7a42e40","code_sha256_prefix":"14b39c4dc7a42e40","mcp_get_code":{"code_sha256":"14b39c4dc7a42e40"}},{"arxiv_id":"1903.10318","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tune-bert-for-extractive-summarization","title":"Fine-tune BERT for Extractive Summarization","date":"2019-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TidalPaladin/neural-summarizer","path":"src/others/utils.py","file_url":"https://github.com/TidalPaladin/neural-summarizer/blob/HEAD/src/others/utils.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":"7e979303d1cfbf18","code_sha256_prefix":"7e979303d1cfbf18","mcp_get_code":{"code_sha256":"7e979303d1cfbf18"}},{"arxiv_id":"aaai_21432","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21432","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/DialogLM","path":"DialogLM_UniLM/DialogLM/evaluations/eval_for_cnndm.py","file_url":"https://github.com/microsoft/DialogLM/blob/HEAD/DialogLM_UniLM/DialogLM/evaluations/eval_for_cnndm.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":"c19b75e22d2023fb","code_sha256_prefix":"c19b75e22d2023fb","mcp_get_code":{"code_sha256":"c19b75e22d2023fb"}},{"arxiv_id":"aaai_16089","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16089","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nlpyang/presumm","path":"src/cal_rouge.py","file_url":"https://github.com/nlpyang/presumm/blob/HEAD/src/cal_rouge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 gb-kgp/MEDVOC, and GitHub detected no licence in that repository when it was checked","code_sha256":"14b39c4dc7a42e40","code_sha256_prefix":"14b39c4dc7a42e40","mcp_get_code":{"code_sha256":"14b39c4dc7a42e40"}}],"record_sha256":"9f4ced89aa02b7ef294075158de8363704817c55f2889433f138581cd999c97d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}