{"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/get-checkpoint-callback","entry":"get_checkpoint_callback","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":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":10,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":1,"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":5,"unverified":5},"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":"2502.20750","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-hallucinations-in-large-vision-4","title":"Mitigating Hallucinations in Large Vision-Language Models by Adaptively Constraining Information Flow","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaqi5598/adavib","path":"callback.py","file_url":"https://github.com/jiaqi5598/adavib/blob/HEAD/callback.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":"87dda5e48a6f979b","code_sha256_prefix":"87dda5e48a6f979b","mcp_get_code":{"code_sha256":"87dda5e48a6f979b"}},{"arxiv_id":"2307.15190","arxiv_id_is_arxiv":true,"paper":"/paper/f-divergence-minimization-for-sequence-level","title":"f-Divergence Minimization for Sequence-Level Knowledge Distillation","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/fdistill","path":"chat/callbacks.py","file_url":"https://github.com/manga-uofa/fdistill/blob/HEAD/chat/callbacks.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, manga-uofa/fdistill when it was checked","code_sha256":"190b95ac90ccdd3e","code_sha256_prefix":"190b95ac90ccdd3e","mcp_get_code":{"code_sha256":"190b95ac90ccdd3e"}},{"arxiv_id":"2307.03115","arxiv_id_is_arxiv":true,"paper":"/paper/korc-knowledge-oriented-reading-comprehension","title":"KoRC: Knowledge oriented Reading Comprehension Benchmark for Deep Text Understanding","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/korc","path":"RAG/callbacks_rag.py","file_url":"https://github.com/thu-keg/korc/blob/HEAD/RAG/callbacks_rag.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":"02407515847e6c7a","code_sha256_prefix":"02407515847e6c7a","mcp_get_code":{"code_sha256":"02407515847e6c7a"}},{"arxiv_id":"2305.16816","arxiv_id_is_arxiv":true,"paper":"/paper/songs-across-borders-singable-and","title":"Songs Across Borders: Singable and Controllable Neural Lyric Translation","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sonata165/ControllableLyricTranslation","path":"BartFinetune/utils/callbacks.py","file_url":"https://github.com/Sonata165/ControllableLyricTranslation/blob/HEAD/BartFinetune/utils/callbacks.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":"b37c9b8121917eba","code_sha256_prefix":"b37c9b8121917eba","mcp_get_code":{"code_sha256":"b37c9b8121917eba"}},{"arxiv_id":"2302.05574","arxiv_id_is_arxiv":true,"paper":"/paper/napss-paragraph-level-medical-text","title":"NapSS: Paragraph-level Medical Text Simplification via Narrative Prompting and Sentence-matching Summarization","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LuJunru/NapSS","path":"modeling/callbacks.py","file_url":"https://github.com/LuJunru/NapSS/blob/HEAD/modeling/callbacks.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":"01cc9caede179564","code_sha256_prefix":"01cc9caede179564","mcp_get_code":{"code_sha256":"01cc9caede179564"}},{"arxiv_id":"2205.06733","arxiv_id_is_arxiv":true,"paper":"/paper/improving-the-numerical-reasoning-skills-of","title":"Arithmetic-Based Pretraining -- Improving Numeracy of Pretrained Language Models","date":"2022-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/emnlp2022-reasoning-aware-pretraining","path":"callbacks.py","file_url":"https://github.com/ukplab/emnlp2022-reasoning-aware-pretraining/blob/HEAD/callbacks.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":"c2d5c83a83cd96ef","code_sha256_prefix":"c2d5c83a83cd96ef","mcp_get_code":{"code_sha256":"c2d5c83a83cd96ef"}},{"arxiv_id":"2108.11846","arxiv_id_is_arxiv":true,"paper":"/paper/alleviating-exposure-bias-via-contrastive","title":"Alleviating Exposure Bias via Contrastive Learning for Abstractive Text Summarization","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shichaosun/conabssum","path":"src/callbacks.py","file_url":"https://github.com/shichaosun/conabssum/blob/HEAD/src/callbacks.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":"952f6fff9428619b","code_sha256_prefix":"952f6fff9428619b","mcp_get_code":{"code_sha256":"952f6fff9428619b"}},{"arxiv_id":"2105.11174","arxiv_id_is_arxiv":true,"paper":"/paper/retrieval-enhanced-model-for-commonsense","title":"Retrieval Enhanced Model for Commonsense Generation","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HanNight/RE-T5","path":"code/RE-T5/callbacks.py","file_url":"https://github.com/HanNight/RE-T5/blob/HEAD/code/RE-T5/callbacks.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":"952f6fff9428619b","code_sha256_prefix":"952f6fff9428619b","mcp_get_code":{"code_sha256":"952f6fff9428619b"}},{"arxiv_id":"2104.08400","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-abstractive-conversation","title":"Structure-Aware Abstractive Conversation Summarization via Discourse and Action Graphs","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-SALT/Structure-Aware-BART","path":"src/callbacks.py","file_url":"https://github.com/GT-SALT/Structure-Aware-BART/blob/HEAD/src/callbacks.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":"d6fdbced63d1ed12","code_sha256_prefix":"d6fdbced63d1ed12","mcp_get_code":{"code_sha256":"d6fdbced63d1ed12"}},{"arxiv_id":"2010.11856","arxiv_id_is_arxiv":true,"paper":"/paper/xor-qa-cross-lingual-open-retrieval-question","title":"XOR QA: Cross-lingual Open-Retrieval Question Answering","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mia-workshop/mia-shared-task-2022","path":"baseline/mGEN/callbacks_rag.py","file_url":"https://github.com/mia-workshop/mia-shared-task-2022/blob/HEAD/baseline/mGEN/callbacks_rag.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":"e2849ab65c6105e4","code_sha256_prefix":"e2849ab65c6105e4","mcp_get_code":{"code_sha256":"e2849ab65c6105e4"}},{"arxiv_id":"2010.05953","arxiv_id_is_arxiv":true,"paper":"/paper/comet-atomic-2020-on-symbolic-and-neural","title":"COMET-ATOMIC 2020: On Symbolic and Neural Commonsense Knowledge Graphs","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfl-nlp/kogito","path":"kogito/core/callbacks.py","file_url":"https://github.com/epfl-nlp/kogito/blob/HEAD/kogito/core/callbacks.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":"add86362d9bda7c7","code_sha256_prefix":"add86362d9bda7c7","mcp_get_code":{"code_sha256":"add86362d9bda7c7"}},{"arxiv_id":"2007.08426","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-pretrained-language-models-for","title":"Investigating Pretrained Language Models for Graph-to-Text Generation","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/plms-graph2text","path":"agenda/callbacks.py","file_url":"https://github.com/UKPLab/plms-graph2text/blob/HEAD/agenda/callbacks.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":"01cc9caede179564","code_sha256_prefix":"01cc9caede179564","mcp_get_code":{"code_sha256":"01cc9caede179564"}},{"arxiv_id":"2023.findings-acl.743","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.743","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THU-KEG/KoRC","path":"RAG/callbacks_rag.py","file_url":"https://github.com/THU-KEG/KoRC/blob/HEAD/RAG/callbacks_rag.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":"02407515847e6c7a","code_sha256_prefix":"02407515847e6c7a","mcp_get_code":{"code_sha256":"02407515847e6c7a"}}],"record_sha256":"40676d16f355cb0581bbae33ecea80d86bcf2466059d1651c8505b4d6639d5cc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}