{"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/modified-precision","entry":"modified_precision","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":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":9,"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":0,"ran_fixture":0,"ran":4,"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":"2312.04746","arxiv_id_is_arxiv":true,"paper":"/paper/quilt-llava-visual-instruction-tuning-by","title":"Quilt-LLaVA: Visual Instruction Tuning by Extracting Localized Narratives from Open-Source Histopathology Videos","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aldraus/quilt-llava","path":"llava/eval/quilt_utils.py","file_url":"https://github.com/aldraus/quilt-llava/blob/HEAD/llava/eval/quilt_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":"21c8c6289af5c1e5","code_sha256_prefix":"21c8c6289af5c1e5","mcp_get_code":{"code_sha256":"21c8c6289af5c1e5"}},{"arxiv_id":"2106.06169","arxiv_id_is_arxiv":true,"paper":"/paper/bob-bert-over-bert-for-training-persona-based","title":"BoB: BERT Over BERT for Training Persona-based Dialogue Models from Limited Personalized Data","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songhaoyu/BoB","path":"evaluations.py","file_url":"https://github.com/songhaoyu/BoB/blob/HEAD/evaluations.py","status":"unverified","verification_level":0,"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":"d52e5869b9bdda18","code_sha256_prefix":"d52e5869b9bdda18","mcp_get_code":{"code_sha256":"d52e5869b9bdda18"}},{"arxiv_id":"2009.10297","arxiv_id_is_arxiv":true,"paper":"/paper/codebleu-a-method-for-automatic-evaluation-of","title":"CodeBLEU: a Method for Automatic Evaluation of Code Synthesis","date":"2020-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k4black/codebleu","path":"codebleu/bleu.py","file_url":"https://github.com/k4black/codebleu/blob/HEAD/codebleu/bleu.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":"68e6098d18d043f3","code_sha256_prefix":"68e6098d18d043f3","mcp_get_code":{"code_sha256":"68e6098d18d043f3"}},{"arxiv_id":"2009.07396","arxiv_id_is_arxiv":true,"paper":"/paper/grounded-adaptation-for-zero-shot-executable","title":"Grounded Adaptation for Zero-shot Executable Semantic Parsing","date":"2020-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vzhong/gazp","path":"bleu.py","file_url":"https://github.com/vzhong/gazp/blob/HEAD/bleu.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":"cbcbdae866b89725","code_sha256_prefix":"cbcbdae866b89725","mcp_get_code":{"code_sha256":"cbcbdae866b89725"}},{"arxiv_id":"1911.04700","arxiv_id_is_arxiv":true,"paper":"/paper/a-pre-training-based-personalized-dialogue","title":"A Pre-training Based Personalized Dialogue Generation Model with Persona-sparse Data","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lireanstar/BPDG","path":"eval_bleu.py","file_url":"https://github.com/Lireanstar/BPDG/blob/HEAD/eval_bleu.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":"d52e5869b9bdda18","code_sha256_prefix":"d52e5869b9bdda18","mcp_get_code":{"code_sha256":"d52e5869b9bdda18"}},{"arxiv_id":"1904.03971","arxiv_id_is_arxiv":true,"paper":"/paper/jointly-measuring-diversity-and-quality-in","title":"Jointly Measuring Diversity and Quality in Text Generation Models","date":"2019-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Danial-Alh/fast-bleu","path":"old_metrics/bleu-old.py","file_url":"https://github.com/Danial-Alh/fast-bleu/blob/HEAD/old_metrics/bleu-old.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":"30fb058c70150725","code_sha256_prefix":"30fb058c70150725","mcp_get_code":{"code_sha256":"30fb058c70150725"}},{"arxiv_id":"1901.04112","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-neural-machine-translation-with","title":"Unsupervised Neural Machine Translation with SMT as Posterior Regularization","date":"2019-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Imagist-Shuo/UNMT-SPR","path":"t2tlight/utils/bleu.py","file_url":"https://github.com/Imagist-Shuo/UNMT-SPR/blob/HEAD/t2tlight/utils/bleu.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":"9c5e87513bca1bae","code_sha256_prefix":"9c5e87513bca1bae","mcp_get_code":{"code_sha256":"9c5e87513bca1bae"}},{"arxiv_id":"1805.04755","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-and-effective-model-based-variable","title":"A Simple and Effective Model-Based Variable Importance Measure","date":"2018-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monte-flora/scikit-explain","path":"skexplain/common/metrics.py","file_url":"https://github.com/monte-flora/scikit-explain/blob/HEAD/skexplain/common/metrics.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":"0c2fb4092e113f68","code_sha256_prefix":"0c2fb4092e113f68","mcp_get_code":{"code_sha256":"0c2fb4092e113f68"}},{"arxiv_id":"1805.00631","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-neural-transformer-via-an","title":"Accelerating Neural Transformer via an Average Attention Network","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bzhangXMU/transformer-aan","path":"code/thumt/utils/bleu.py","file_url":"https://github.com/bzhangXMU/transformer-aan/blob/HEAD/code/thumt/utils/bleu.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c5e87513bca1bae","code_sha256_prefix":"9c5e87513bca1bae","mcp_get_code":{"code_sha256":"9c5e87513bca1bae"}}],"record_sha256":"686d9e3980379ea65006f384746ce9ca4eda4e2065115af6e576e1ee405e9c94","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}