{"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/bertoutput","entry":"BertOutput","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":9,"n_papers_ran_no_instrument_failure":9,"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":17,"n_samples_ran":10,"n_samples_constructed":4,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":8,"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":10,"unverified":7},"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":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d7bf02e4a7c75a1","code_sha256_prefix":"5d7bf02e4a7c75a1","mcp_get_code":{"code_sha256":"5d7bf02e4a7c75a1"}},{"arxiv_id":"2511.21416","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-21416","title":"Odin: Oriented Dual-module Integration for Text-rich Network Representation Learning","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"hongkaifeng/Odin","path":"src/OpenLP/models/Graphformer ME.py","file_url":"https://github.com/hongkaifeng/Odin/blob/HEAD/src/OpenLP/models/Graphformer%20ME.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, hongkaifeng/Odin when it was checked","code_sha256":"1ca500dc6d3e0485","code_sha256_prefix":"1ca500dc6d3e0485","mcp_get_code":{"code_sha256":"1ca500dc6d3e0485"}},{"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":false,"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":"6b2df70e78c4e5e8","code_sha256_prefix":"6b2df70e78c4e5e8","mcp_get_code":{"code_sha256":"6b2df70e78c4e5e8"}},{"arxiv_id":"2305.12268","arxiv_id_is_arxiv":true,"paper":"/paper/patton-language-model-pretraining-on-text","title":"Patton: Language Model Pretraining on Text-Rich Networks","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeterGriffinJin/Patton","path":"src/OpenLP/models/Graphformer.py","file_url":"https://github.com/PeterGriffinJin/Patton/blob/HEAD/src/OpenLP/models/Graphformer.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":"ea98a87e1b400ad7","code_sha256_prefix":"ea98a87e1b400ad7","mcp_get_code":{"code_sha256":"ea98a87e1b400ad7"}},{"arxiv_id":"2210.08714","arxiv_id_is_arxiv":true,"paper":"/paper/selective-query-guided-debiasing-network-for","title":"Selective Query-guided Debiasing for Video Corpus Moment Retrieval","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbstjswo505/SQuiDNet","path":"model/squidnet.py","file_url":"https://github.com/dbstjswo505/SQuiDNet/blob/HEAD/model/squidnet.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":"e1d8bf9abfe29c23","code_sha256_prefix":"e1d8bf9abfe29c23","mcp_get_code":{"code_sha256":"e1d8bf9abfe29c23"}},{"arxiv_id":"2110.13309","arxiv_id_is_arxiv":true,"paper":"/paper/history-aware-multimodal-transformer-for","title":"History Aware Multimodal Transformer for Vision-and-Language Navigation","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cshizhe/vln-hamt","path":"finetune_src/models/vilmodel_cmt.py","file_url":"https://github.com/cshizhe/vln-hamt/blob/HEAD/finetune_src/models/vilmodel_cmt.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":"6c574c57986a3d21","code_sha256_prefix":"6c574c57986a3d21","mcp_get_code":{"code_sha256":"6c574c57986a3d21"}},{"arxiv_id":"2106.14019","arxiv_id_is_arxiv":true,"paper":"/paper/umic-an-unreferenced-metric-for-image","title":"UMIC: An Unreferenced Metric for Image Captioning via Contrastive Learning","date":"2021-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwanheelee1993/UMIC","path":"model/ce.py","file_url":"https://github.com/hwanheelee1993/UMIC/blob/HEAD/model/ce.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97991514f03a073e","code_sha256_prefix":"97991514f03a073e","mcp_get_code":{"code_sha256":"97991514f03a073e"}},{"arxiv_id":"2106.00149","arxiv_id_is_arxiv":true,"paper":"/paper/hiddencut-simple-data-augmentation-for","title":"HiddenCut: Simple Data Augmentation for Natural Language Understanding with Better Generalization","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-SALT/HiddenCut","path":"transformers/modeling_bert.py","file_url":"https://github.com/GT-SALT/HiddenCut/blob/HEAD/transformers/modeling_bert.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, GT-SALT/HiddenCut when it was checked","code_sha256":"b0bba126f9be2ee6","code_sha256_prefix":"b0bba126f9be2ee6","mcp_get_code":{"code_sha256":"b0bba126f9be2ee6"}},{"arxiv_id":"2103.03493","arxiv_id_is_arxiv":true,"paper":"/paper/causal-attention-for-vision-language-tasks","title":"Causal Attention for Vision-Language Tasks","date":"2021-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangxuntu/lxmertcatt","path":"src/lxrt/modeling.py","file_url":"https://github.com/yangxuntu/lxmertcatt/blob/HEAD/src/lxrt/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61f383a856ac089e","code_sha256_prefix":"61f383a856ac089e","mcp_get_code":{"code_sha256":"61f383a856ac089e"}},{"arxiv_id":"2010.08210","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-to-fine-pre-training-for-named-entity","title":"Coarse-to-Fine Pre-training for Named Entity Recognition","date":"2020-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"strawberryx/CoFEE","path":"model/bert_mrc_ner_cluster.py","file_url":"https://github.com/strawberryx/CoFEE/blob/HEAD/model/bert_mrc_ner_cluster.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, strawberryx/CoFEE when it was checked","code_sha256":"e2496b3448dddc7b","code_sha256_prefix":"e2496b3448dddc7b","mcp_get_code":{"code_sha256":"e2496b3448dddc7b"}},{"arxiv_id":"2004.13278","arxiv_id_is_arxiv":true,"paper":"/paper/vd-bert-a-unified-vision-and-dialog","title":"VD-BERT: A Unified Vision and Dialog Transformer with BERT","date":"2020-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/VD-BERT","path":"pytorch_pretrained_bert/modeling.py","file_url":"https://github.com/salesforce/VD-BERT/blob/HEAD/pytorch_pretrained_bert/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":"4a7f9dbc40aaed5d","code_sha256_prefix":"4a7f9dbc40aaed5d","mcp_get_code":{"code_sha256":"4a7f9dbc40aaed5d"}},{"arxiv_id":"1907.11692","arxiv_id_is_arxiv":true,"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data","path":"run_hbm.py","file_url":"https://github.com/GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data/blob/HEAD/run_hbm.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, GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data when it was checked","code_sha256":"5e5629cb8e93e004","code_sha256_prefix":"5e5629cb8e93e004","mcp_get_code":{"code_sha256":"5e5629cb8e93e004"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cybertronai/megatron-lm","path":"model/modeling.py","file_url":"https://github.com/cybertronai/megatron-lm/blob/HEAD/model/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, cybertronai/megatron-lm (NOASSERTION)","code_sha256":"8a5a74db0d87b031","code_sha256_prefix":"8a5a74db0d87b031","mcp_get_code":{"code_sha256":"8a5a74db0d87b031"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maknotavailable/pytorch-pretrained-bert","path":"pytorch_pretrained_bert/modeling.py","file_url":"https://github.com/maknotavailable/pytorch-pretrained-bert/blob/HEAD/pytorch_pretrained_bert/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85b548d92c70c22b","code_sha256_prefix":"85b548d92c70c22b","mcp_get_code":{"code_sha256":"85b548d92c70c22b"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cedrickchee/pytorch-pretrained-BERT","path":"pytorch_pretrained_bert/modeling.py","file_url":"https://github.com/cedrickchee/pytorch-pretrained-BERT/blob/HEAD/pytorch_pretrained_bert/modeling.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":"aea48c66c585eea7","code_sha256_prefix":"aea48c66c585eea7","mcp_get_code":{"code_sha256":"aea48c66c585eea7"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"derronxu/sparsebert","path":"SparseBERT/main_functions/transformer/modeling.py","file_url":"https://github.com/derronxu/sparsebert/blob/HEAD/SparseBERT/main_functions/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, derronxu/sparsebert when it was checked","code_sha256":"a0407d4bf4593206","code_sha256_prefix":"a0407d4bf4593206","mcp_get_code":{"code_sha256":"a0407d4bf4593206"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lonePatient/ERNIE-text-classification-pytorch","path":"pyernie/model/ernie/modeling.py","file_url":"https://github.com/lonePatient/ERNIE-text-classification-pytorch/blob/HEAD/pyernie/model/ernie/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, lonePatient/ERNIE-text-classification-pytorch when it was checked","code_sha256":"fb6862928ef36d03","code_sha256_prefix":"fb6862928ef36d03","mcp_get_code":{"code_sha256":"fb6862928ef36d03"}}],"record_sha256":"9d070ed7b672af2462f10b1600e07635e7bf4e24e83f03018fd6f57a9d2fb5d6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}