{"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/bertpooler","entry":"BertPooler","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":6,"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":8,"n_samples_ran":7,"n_samples_constructed":4,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":8,"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":7,"unverified":1},"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":true,"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":"6cadb1be8862ec47","code_sha256_prefix":"6cadb1be8862ec47","mcp_get_code":{"code_sha256":"6cadb1be8862ec47"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82086191fd1b0dae","code_sha256_prefix":"82086191fd1b0dae","mcp_get_code":{"code_sha256":"82086191fd1b0dae"}},{"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":"4dc8cae13c724e85","code_sha256_prefix":"4dc8cae13c724e85","mcp_get_code":{"code_sha256":"4dc8cae13c724e85"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"a218a1ea11358ec3","code_sha256_prefix":"a218a1ea11358ec3","mcp_get_code":{"code_sha256":"a218a1ea11358ec3"}},{"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":"deterministic","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":"4e755eff48bf0752","code_sha256_prefix":"4e755eff48bf0752","mcp_get_code":{"code_sha256":"4e755eff48bf0752"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f1a0b9437ccc562","code_sha256_prefix":"8f1a0b9437ccc562","mcp_get_code":{"code_sha256":"8f1a0b9437ccc562"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"1ffe5589b401ff00","code_sha256_prefix":"1ffe5589b401ff00","mcp_get_code":{"code_sha256":"1ffe5589b401ff00"}},{"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":"yifding/hetseq","path":"hetseq/bert_modeling.py","file_url":"https://github.com/yifding/hetseq/blob/HEAD/hetseq/bert_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":"cc2f2a6451c34620","code_sha256_prefix":"cc2f2a6451c34620","mcp_get_code":{"code_sha256":"cc2f2a6451c34620"}}],"record_sha256":"00e7a56ddefdb334716268fabfd3f22b1f91188dea460d185185533357b4fc48","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}