{"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/load-tf-weights-in-albert","entry":"load_tf_weights_in_albert","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":9,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":0,"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":"2310.05185","arxiv_id_is_arxiv":true,"paper":"/paper/text2nkg-fine-grained-n-ary-relation","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LHRLAB/Text2NKG","path":"transformers/src/transformers/modeling_albert.py","file_url":"https://github.com/LHRLAB/Text2NKG/blob/HEAD/transformers/src/transformers/modeling_albert.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":"0acb90d02eadd73f","code_sha256_prefix":"0acb90d02eadd73f","mcp_get_code":{"code_sha256":"0acb90d02eadd73f"}},{"arxiv_id":"2203.11431","arxiv_id_is_arxiv":true,"paper":"/paper/task-guided-disentangled-tuning-for","title":"Task-guided Disentangled Tuning for Pretrained Language Models","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lemon0830/TDT","path":"TDT/transformers/modeling_albert.py","file_url":"https://github.com/lemon0830/TDT/blob/HEAD/TDT/transformers/modeling_albert.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":"c93b91f99a958850","code_sha256_prefix":"c93b91f99a958850","mcp_get_code":{"code_sha256":"c93b91f99a958850"}},{"arxiv_id":"2110.12567","arxiv_id_is_arxiv":true,"paper":"/paper/alignment-attention-by-matching-key-and-query","title":"Alignment Attention by Matching Key and Query Distributions","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szhang42/alignment_attention","path":"src/transformers/modeling_albert.py","file_url":"https://github.com/szhang42/alignment_attention/blob/HEAD/src/transformers/modeling_albert.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":"465b788c5456f812","code_sha256_prefix":"465b788c5456f812","mcp_get_code":{"code_sha256":"465b788c5456f812"}},{"arxiv_id":"2109.06067","arxiv_id_is_arxiv":true,"paper":"/paper/pack-together-entity-and-relation-extraction","title":"Packed Levitated Marker for Entity and Relation Extraction","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"0acb90d02eadd73f","code_sha256_prefix":"0acb90d02eadd73f","mcp_get_code":{"code_sha256":"0acb90d02eadd73f"}},{"arxiv_id":"2010.13382","arxiv_id_is_arxiv":true,"paper":"/paper/fastformers-highly-efficient-transformer","title":"FastFormers: Highly Efficient Transformer Models for Natural Language Understanding","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/fastformers","path":"src/transformers/modeling_albert.py","file_url":"https://github.com/microsoft/fastformers/blob/HEAD/src/transformers/modeling_albert.py","status":"unverified","verification_level":0,"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, microsoft/fastformers (NOASSERTION)","code_sha256":"08a158e902f91371","code_sha256_prefix":"08a158e902f91371","mcp_get_code":{"code_sha256":"08a158e902f91371"}},{"arxiv_id":"1911.03631","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-graph-network-for-multi-hop","title":"Hierarchical Graph Network for Multi-hop Question Answering","date":"2019-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuwfan/HGN","path":"transformers/modeling_albert.py","file_url":"https://github.com/yuwfan/HGN/blob/HEAD/transformers/modeling_albert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, yuwfan/HGN, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"4f56c9a37e92815f","code_sha256_prefix":"4f56c9a37e92815f","mcp_get_code":{"code_sha256":"4f56c9a37e92815f"}},{"arxiv_id":"1909.11942","arxiv_id_is_arxiv":true,"paper":"/paper/albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Soikonomou/albert_final","path":"src/model/ALBERT/modeling_albert.py","file_url":"https://github.com/Soikonomou/albert_final/blob/HEAD/src/model/ALBERT/modeling_albert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from yuwfan/HGN, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"4f56c9a37e92815f","code_sha256_prefix":"4f56c9a37e92815f","mcp_get_code":{"code_sha256":"4f56c9a37e92815f"}},{"arxiv_id":"1909.11942","arxiv_id_is_arxiv":true,"paper":"/paper/albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lonePatient/albert_pytorch","path":"model/modeling_albert.py","file_url":"https://github.com/lonePatient/albert_pytorch/blob/HEAD/model/modeling_albert.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":"c7c4917ba776e16d","code_sha256_prefix":"c7c4917ba776e16d","mcp_get_code":{"code_sha256":"c7c4917ba776e16d"}},{"arxiv_id":"1909.11942","arxiv_id_is_arxiv":true,"paper":"/paper/albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lonePatient/albert_pytorch","path":"model/modeling_albert_bright.py","file_url":"https://github.com/lonePatient/albert_pytorch/blob/HEAD/model/modeling_albert_bright.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":"c405dd24b1c4e3bc","code_sha256_prefix":"c405dd24b1c4e3bc","mcp_get_code":{"code_sha256":"c405dd24b1c4e3bc"}},{"arxiv_id":"2021.findings-acl.216","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-acl.216","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"destwang/DCN","path":"transformers/modeling_albert.py","file_url":"https://github.com/destwang/DCN/blob/HEAD/transformers/modeling_albert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from microsoft/fastformers, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"08a158e902f91371","code_sha256_prefix":"08a158e902f91371","mcp_get_code":{"code_sha256":"08a158e902f91371"}},{"arxiv_id":"2021.acl-long.390","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.acl-long.390","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/MetaAdaptRank","path":"contrastqg/transformers/modeling_albert.py","file_url":"https://github.com/thunlp/MetaAdaptRank/blob/HEAD/contrastqg/transformers/modeling_albert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from microsoft/fastformers, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"08a158e902f91371","code_sha256_prefix":"08a158e902f91371","mcp_get_code":{"code_sha256":"08a158e902f91371"}}],"record_sha256":"ecbb9805b67b6da02abaac429297c012393667040867bb670c9b59e65314fcf9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}