{"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/bertembeddings","entry":"BertEmbeddings","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":21,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":13,"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":26,"n_samples_ran":14,"n_samples_constructed":7,"n_samples_ran_checked":14,"n_samples_instrument":0,"n_samples_unverified":12,"n_samples_fingerprinted":1,"n_places":26,"n_places_pointer_only":10,"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":14,"unverified":12},"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":"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","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":"3cdcc0a6be122ca6","code_sha256_prefix":"3cdcc0a6be122ca6","mcp_get_code":{"code_sha256":"3cdcc0a6be122ca6"}},{"arxiv_id":"2501.17403","arxiv_id_is_arxiv":true,"paper":"/paper/general-scene-adaptation-for-vision-and","title":"General Scene Adaptation for Vision-and-Language Navigation","date":"2025-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"honghd16/gsa-vln","path":"GR-DUET/map_nav_src/models/vilmodel.py","file_url":"https://github.com/honghd16/gsa-vln/blob/HEAD/GR-DUET/map_nav_src/models/vilmodel.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":"66bd358094beb851","code_sha256_prefix":"66bd358094beb851","mcp_get_code":{"code_sha256":"66bd358094beb851"}},{"arxiv_id":"2406.05478","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-non-autoregressive-transformers","title":"Revisiting Non-Autoregressive Transformers for Efficient Image Synthesis","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeapLabTHU/ImprovedNAT","path":"libs/nat_model.py","file_url":"https://github.com/LeapLabTHU/ImprovedNAT/blob/HEAD/libs/nat_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7001b82c42bcf7a8","code_sha256_prefix":"7001b82c42bcf7a8","mcp_get_code":{"code_sha256":"7001b82c42bcf7a8"}},{"arxiv_id":"2312.03701","arxiv_id_is_arxiv":true,"paper":"/paper/self-conditioned-image-generation-via","title":"Return of Unconditional Generation: A Self-supervised Representation Generation Method","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LTH14/rcg","path":"pixel_generator/mage/models_mage.py","file_url":"https://github.com/LTH14/rcg/blob/HEAD/pixel_generator/mage/models_mage.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":"63c52efe80c94cb3","code_sha256_prefix":"63c52efe80c94cb3","mcp_get_code":{"code_sha256":"63c52efe80c94cb3"}},{"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":"e11f492583515dc1","code_sha256_prefix":"e11f492583515dc1","mcp_get_code":{"code_sha256":"e11f492583515dc1"}},{"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":"48ac189cd4db0ad9","code_sha256_prefix":"48ac189cd4db0ad9","mcp_get_code":{"code_sha256":"48ac189cd4db0ad9"}},{"arxiv_id":"2305.12074","arxiv_id_is_arxiv":true,"paper":"/paper/disco-distilled-student-models-co-training","title":"DisCo: Distilled Student Models Co-training for Semi-supervised Text Mining","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litesslhub/disco","path":"src/model.py","file_url":"https://github.com/litesslhub/disco/blob/HEAD/src/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, litesslhub/disco when it was checked","code_sha256":"03e9b234d335c704","code_sha256_prefix":"03e9b234d335c704","mcp_get_code":{"code_sha256":"03e9b234d335c704"}},{"arxiv_id":"2305.03602","arxiv_id_is_arxiv":true,"paper":"/paper/a-dual-semantic-aware-recurrent-global","title":"A Dual Semantic-Aware Recurrent Global-Adaptive Network For Vision-and-Language Navigation","date":"2023-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CrystalSixone/DSRG","path":"finetune_src/models/vilmodel.py","file_url":"https://github.com/CrystalSixone/DSRG/blob/HEAD/finetune_src/models/vilmodel.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":"887a39ce2142a57d","code_sha256_prefix":"887a39ce2142a57d","mcp_get_code":{"code_sha256":"887a39ce2142a57d"}},{"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":"c7064aca92e2f1ef","code_sha256_prefix":"c7064aca92e2f1ef","mcp_get_code":{"code_sha256":"c7064aca92e2f1ef"}},{"arxiv_id":"2210.08465","arxiv_id_is_arxiv":true,"paper":"/paper/character-centric-story-visualization-via","title":"Character-Centric Story Visualization via Visual Planning and Token Alignment","date":"2022-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adymaharana/VLCStoryGan","path":"vlcgan/model.py","file_url":"https://github.com/adymaharana/VLCStoryGan/blob/HEAD/vlcgan/model.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":"79728760d660d983","code_sha256_prefix":"79728760d660d983","mcp_get_code":{"code_sha256":"79728760d660d983"}},{"arxiv_id":"2203.03825","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-hierarchy-into-text-encoder-a","title":"Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classification","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzh9969/contrastive-htc","path":"model/contrast.py","file_url":"https://github.com/wzh9969/contrastive-htc/blob/HEAD/model/contrast.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":"dcc09c5532200722","code_sha256_prefix":"dcc09c5532200722","mcp_get_code":{"code_sha256":"dcc09c5532200722"}},{"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":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43ea2bbc815e3fd5","code_sha256_prefix":"43ea2bbc815e3fd5","mcp_get_code":{"code_sha256":"43ea2bbc815e3fd5"}},{"arxiv_id":"2107.14596","arxiv_id_is_arxiv":true,"paper":"/paper/multi-stage-pre-training-over-simplified","title":"Multi-stage Pre-training over Simplified Multimodal Pre-training Models","date":"2021-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lttsmn/LXMERT-S","path":"Desktop/LXMERT_S/src/lxrt/modeling.py","file_url":"https://github.com/lttsmn/LXMERT-S/blob/HEAD/Desktop/LXMERT_S/src/lxrt/modeling.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, lttsmn/LXMERT-S when it was checked","code_sha256":"4f3d156722ae6484","code_sha256_prefix":"4f3d156722ae6484","mcp_get_code":{"code_sha256":"4f3d156722ae6484"}},{"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":"079b9f19680e22e9","code_sha256_prefix":"079b9f19680e22e9","mcp_get_code":{"code_sha256":"079b9f19680e22e9"}},{"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":"7373ebea53445c9c","code_sha256_prefix":"7373ebea53445c9c","mcp_get_code":{"code_sha256":"7373ebea53445c9c"}},{"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":"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":"7cd6bab68e15976d","code_sha256_prefix":"7cd6bab68e15976d","mcp_get_code":{"code_sha256":"7cd6bab68e15976d"}},{"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":"d128e762e565e2bb","code_sha256_prefix":"d128e762e565e2bb","mcp_get_code":{"code_sha256":"d128e762e565e2bb"}},{"arxiv_id":"1908.07490","arxiv_id_is_arxiv":true,"paper":"/paper/lxmert-learning-cross-modality-encoder","title":"LXMERT: Learning Cross-Modality Encoder Representations from Transformers","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghazaleh-mahmoodi/lxmert_compression","path":"lxmert/src/lxrt/modeling.py","file_url":"https://github.com/ghazaleh-mahmoodi/lxmert_compression/blob/HEAD/lxmert/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":"e988ae429f42601c","code_sha256_prefix":"e988ae429f42601c","mcp_get_code":{"code_sha256":"e988ae429f42601c"}},{"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":true,"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":"c3af34b4f438eaea","code_sha256_prefix":"c3af34b4f438eaea","mcp_get_code":{"code_sha256":"c3af34b4f438eaea"}},{"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":"0bc4f9d5bf271d61","code_sha256_prefix":"0bc4f9d5bf271d61","mcp_get_code":{"code_sha256":"0bc4f9d5bf271d61"}},{"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":"95de1baf9219476c","code_sha256_prefix":"95de1baf9219476c","mcp_get_code":{"code_sha256":"95de1baf9219476c"}},{"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":"77df05a2a5d00853","code_sha256_prefix":"77df05a2a5d00853","mcp_get_code":{"code_sha256":"77df05a2a5d00853"}},{"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":"822402eb726689f9","code_sha256_prefix":"822402eb726689f9","mcp_get_code":{"code_sha256":"822402eb726689f9"}},{"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":"c265396993793fbf","code_sha256_prefix":"c265396993793fbf","mcp_get_code":{"code_sha256":"c265396993793fbf"}},{"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":"Impavidity/relogic","path":"relogic/logickit/inference/modeling.py","file_url":"https://github.com/Impavidity/relogic/blob/HEAD/relogic/logickit/inference/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":"83ba0b7e85109bc1","code_sha256_prefix":"83ba0b7e85109bc1","mcp_get_code":{"code_sha256":"83ba0b7e85109bc1"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonNo2/MulTeacher-KD","path":"models/search_cnn.py","file_url":"https://github.com/anonNo2/MulTeacher-KD/blob/HEAD/models/search_cnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, anonNo2/MulTeacher-KD when it was checked","code_sha256":"be6377d03707aa67","code_sha256_prefix":"be6377d03707aa67","mcp_get_code":{"code_sha256":"be6377d03707aa67"}}],"record_sha256":"449e0f57937e5b03f1dbe23e76e9e3b3bf4d6330b3be6de01843e2ed907674b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}