{"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-openai-gpt","entry":"load_tf_weights_in_openai_gpt","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":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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":1,"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":0,"unverified":2},"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":"2404.19563","arxiv_id_is_arxiv":true,"paper":"/paper/repeval-effective-text-evaluation-with-llm","title":"RepEval: Effective Text Evaluation with LLM Representation","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shikib/usr","path":"transformers/modeling_openai.py","file_url":"https://github.com/shikib/usr/blob/HEAD/transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"2212.03506","arxiv_id_is_arxiv":true,"paper":"/paper/wider-closer-mixture-of-short-channel","title":"WIDER & CLOSER: Mixture of Short-channel Distillers for Zero-shot Cross-lingual Named Entity Recognition","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mckysse/msd","path":"transformers/modeling_openai.py","file_url":"https://github.com/mckysse/msd/blob/HEAD/transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"2010.05607","arxiv_id_is_arxiv":true,"paper":"/paper/the-elephant-in-the-interpretability-room-why","title":"The elephant in the interpretability room: Why use attention as explanation when we have saliency methods?","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jessevig/bertviz","path":"bertviz/transformers_neuron_view/modeling_openai.py","file_url":"https://github.com/jessevig/bertviz/blob/HEAD/bertviz/transformers_neuron_view/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"2005.02439","arxiv_id_is_arxiv":true,"paper":"/paper/contextualizing-hate-speech-classifiers-with","title":"Contextualizing Hate Speech Classifiers with Post-hoc Explanation","date":"2020-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"owaisCS/TestHateSpeech","path":"bert/modeling_openai.py","file_url":"https://github.com/owaisCS/TestHateSpeech/blob/HEAD/bert/modeling_openai.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":"46f305675277e757","code_sha256_prefix":"46f305675277e757","mcp_get_code":{"code_sha256":"46f305675277e757"}},{"arxiv_id":"2005.00558","arxiv_id_is_arxiv":true,"paper":"/paper/pointer-constrained-text-generation-via","title":"POINTER: Constrained Progressive Text Generation via Insertion-based Generative Pre-training","date":"2020-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreasysnail/POINTER","path":"pytorch_transformers/modeling_openai.py","file_url":"https://github.com/dreasysnail/POINTER/blob/HEAD/pytorch_transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"2004.03829","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-versatile-generative-language-model","title":"Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learning","date":"2020-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zlinao/VGLM","path":"pytorch_transformers/modeling_openai.py","file_url":"https://github.com/zlinao/VGLM/blob/HEAD/pytorch_transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"2002.01808","arxiv_id_is_arxiv":true,"paper":"/paper/k-adapter-infusing-knowledge-into-pre-trained","title":"K-Adapter: Infusing Knowledge into Pre-Trained Models with Adapters","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/K-Adapter","path":"pytorch_transformers/modeling_openai.py","file_url":"https://github.com/microsoft/K-Adapter/blob/HEAD/pytorch_transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"1911.00720","arxiv_id_is_arxiv":true,"paper":"/paper/zen-pre-training-chinese-text-encoder","title":"ZEN: Pre-training Chinese Text Encoder Enhanced by N-gram Representations","date":"2019-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SVAIGBA/TwASP","path":"pytorch_pretrained_bert/modeling_openai.py","file_url":"https://github.com/SVAIGBA/TwASP/blob/HEAD/pytorch_pretrained_bert/modeling_openai.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":"46f305675277e757","code_sha256_prefix":"46f305675277e757","mcp_get_code":{"code_sha256":"46f305675277e757"}},{"arxiv_id":"1909.05311","arxiv_id_is_arxiv":true,"paper":"/paper/graph-based-reasoning-over-heterogeneous","title":"Graph-Based Reasoning over Heterogeneous External Knowledge for Commonsense Question Answering","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DecstionBack/AAAI_2020_CommonsenseQA","path":"pytorch_transformers/modeling_openai.py","file_url":"https://github.com/DecstionBack/AAAI_2020_CommonsenseQA/blob/HEAD/pytorch_transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"1908.09355","arxiv_id_is_arxiv":true,"paper":"/paper/patient-knowledge-distillation-for-bert-model","title":"Patient Knowledge Distillation for BERT Model Compression","date":"2019-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eunanomist/PKD_BERT","path":"BERT/pytorch_pretrained_bert/modeling_openai.py","file_url":"https://github.com/eunanomist/PKD_BERT/blob/HEAD/BERT/pytorch_pretrained_bert/modeling_openai.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, eunanomist/PKD_BERT, 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":"46f305675277e757","code_sha256_prefix":"46f305675277e757","mcp_get_code":{"code_sha256":"46f305675277e757"}},{"arxiv_id":"1906.08237","arxiv_id_is_arxiv":true,"paper":"/paper/xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samwisegamjeee/pytorch-transformers","path":"pytorch_transformers/modeling_openai.py","file_url":"https://github.com/samwisegamjeee/pytorch-transformers/blob/HEAD/pytorch_transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}},{"arxiv_id":"1906.01698","arxiv_id_is_arxiv":true,"paper":"/paper/open-sesame-getting-inside-berts-linguistic","title":"Open Sesame: Getting Inside BERT's Linguistic Knowledge","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongjie-lin/bert-opensesame","path":"bertviz/bertviz/pytorch_pretrained_bert/modeling_openai.py","file_url":"https://github.com/yongjie-lin/bert-opensesame/blob/HEAD/bertviz/bertviz/pytorch_pretrained_bert/modeling_openai.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":"46f305675277e757","code_sha256_prefix":"46f305675277e757","mcp_get_code":{"code_sha256":"46f305675277e757"}},{"arxiv_id":"2024.findings-naacl.32","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-naacl.32","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SnowYJ/sem_syn_separation","path":"optimus_separate_graph_sem_syntax_fuse_gpt2/pytorch_transformers/modeling_openai.py","file_url":"https://github.com/SnowYJ/sem_syn_separation/blob/HEAD/optimus_separate_graph_sem_syntax_fuse_gpt2/pytorch_transformers/modeling_openai.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":"42ee168c3ae12e60","code_sha256_prefix":"42ee168c3ae12e60","mcp_get_code":{"code_sha256":"42ee168c3ae12e60"}}],"record_sha256":"8e8af1bf1da9912a7c1826d8bf67c8259111a889f1534aed9d6ee78bdd98fece","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}