{"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/bertlmpredictionhead","entry":"BertLMPredictionHead","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":4,"n_papers_ran_no_instrument_failure":4,"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":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":4,"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":6},"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":"2603.05969","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-05969","title":"Imagine How To Change: Explicit Procedure Modeling for Change Captioning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"BlueberryOreo/ProCap","path":"src/rtransformer/model.py","file_url":"https://github.com/BlueberryOreo/ProCap/blob/HEAD/src/rtransformer/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c080e6051838cc3f","code_sha256_prefix":"c080e6051838cc3f","mcp_get_code":{"code_sha256":"c080e6051838cc3f"}},{"arxiv_id":"2601.15771","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-15771","title":"Rethinking Drug-Drug Interaction Modeling as Generalizable Relation Learning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"SZU-ADDG/GenRel-DDI","path":"model.py","file_url":"https://github.com/SZU-ADDG/GenRel-DDI/blob/HEAD/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, SZU-ADDG/GenRel-DDI when it was checked","code_sha256":"2aa2964a3f4be05c","code_sha256_prefix":"2aa2964a3f4be05c","mcp_get_code":{"code_sha256":"2aa2964a3f4be05c"}},{"arxiv_id":"2308.12587","arxiv_id_is_arxiv":true,"paper":"/paper/grounded-entity-landmark-adaptive-pre","title":"Grounded Entity-Landmark Adaptive Pre-training for Vision-and-Language Navigation","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csir1996/vln-gela","path":"ada_pretrain_src/model/pretrain_cmt.py","file_url":"https://github.com/csir1996/vln-gela/blob/HEAD/ada_pretrain_src/model/pretrain_cmt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, csir1996/vln-gela when it was checked","code_sha256":"6ef8a8f38e5061ea","code_sha256_prefix":"6ef8a8f38e5061ea","mcp_get_code":{"code_sha256":"6ef8a8f38e5061ea"}},{"arxiv_id":"2306.15006","arxiv_id_is_arxiv":true,"paper":"/paper/dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frederikkemarin/bend","path":"bend/utils/embedders.py","file_url":"https://github.com/frederikkemarin/bend/blob/HEAD/bend/utils/embedders.py","status":"unverified","verification_level":0,"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":"810c58679e40ef3e","code_sha256_prefix":"810c58679e40ef3e","mcp_get_code":{"code_sha256":"810c58679e40ef3e"}},{"arxiv_id":"2303.08409","arxiv_id_is_arxiv":true,"paper":"/paper/lana-a-language-capable-navigator-for","title":"Lana: A Language-Capable Navigator for Instruction Following and Generation","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wxh1996/lana-vln","path":"finetune_src/models/vilmodel_cmt_lana.py","file_url":"https://github.com/wxh1996/lana-vln/blob/HEAD/finetune_src/models/vilmodel_cmt_lana.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":"46726083e44b793d","code_sha256_prefix":"46726083e44b793d","mcp_get_code":{"code_sha256":"46726083e44b793d"}},{"arxiv_id":"2203.14040","arxiv_id_is_arxiv":true,"paper":"/paper/visual-abductive-reasoning","title":"Visual Abductive Reasoning","date":"2022-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonnnop/var","path":"src/model/mainmodel.py","file_url":"https://github.com/leonnnop/var/blob/HEAD/src/model/mainmodel.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":"8dcc67f7cdd708fe","code_sha256_prefix":"8dcc67f7cdd708fe","mcp_get_code":{"code_sha256":"8dcc67f7cdd708fe"}},{"arxiv_id":"2011.05268","arxiv_id_is_arxiv":true,"paper":"/paper/towards-interpretable-natural-language","title":"Towards Interpretable Natural Language Understanding with Explanations as Latent Variables","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JamesHujy/ELV","path":"ELV_re/s2s_ft/modeling_decoding.py","file_url":"https://github.com/JamesHujy/ELV/blob/HEAD/ELV_re/s2s_ft/modeling_decoding.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":"4c4cc2ac34ec0f6d","code_sha256_prefix":"4c4cc2ac34ec0f6d","mcp_get_code":{"code_sha256":"4c4cc2ac34ec0f6d"}},{"arxiv_id":"2006.06195","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-adversarial-training-for-vision","title":"Large-Scale Adversarial Training for Vision-and-Language Representation Learning","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhegan27/LXMERT-AdvTrain","path":"src/lxrt/modeling.py","file_url":"https://github.com/zhegan27/LXMERT-AdvTrain/blob/HEAD/src/lxrt/modeling.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":"77ff902ef6858211","code_sha256_prefix":"77ff902ef6858211","mcp_get_code":{"code_sha256":"77ff902ef6858211"}},{"arxiv_id":"1909.10351","arxiv_id_is_arxiv":true,"paper":"/paper/190910351","title":"TinyBERT: Distilling BERT for Natural Language Understanding","date":"2019-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-noah/Pretrained-Language-Model","path":"TinyBERT/transformer/modeling.py","file_url":"https://github.com/huawei-noah/Pretrained-Language-Model/blob/HEAD/TinyBERT/transformer/modeling.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, huawei-noah/Pretrained-Language-Model when it was checked","code_sha256":"031455b1879a2b6c","code_sha256_prefix":"031455b1879a2b6c","mcp_get_code":{"code_sha256":"031455b1879a2b6c"}},{"arxiv_id":"1908.02265","arxiv_id_is_arxiv":true,"paper":"/paper/vilbert-pretraining-task-agnostic","title":"ViLBERT: Pretraining Task-Agnostic Visiolinguistic Representations for Vision-and-Language Tasks","date":"2019-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiasenlu/vilbert_beta","path":"vilbert/vilbert.py","file_url":"https://github.com/jiasenlu/vilbert_beta/blob/HEAD/vilbert/vilbert.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, jiasenlu/vilbert_beta when it was checked","code_sha256":"95b9fa155e0b962d","code_sha256_prefix":"95b9fa155e0b962d","mcp_get_code":{"code_sha256":"95b9fa155e0b962d"}}],"record_sha256":"7e662d7432771ba3bce3e0169608c602ef75b9067dcbecbecf35575ba412e668","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}