{"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/get-shape-list","entry":"get_shape_list","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":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":8,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":15,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":8,"ran_fixture":0,"ran":2,"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":"2106.02636","arxiv_id_is_arxiv":true,"paper":"/paper/merlot-multimodal-neural-script-knowledge","title":"MERLOT: Multimodal Neural Script Knowledge Models","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rowanz/merlot","path":"utils/model_utils.py","file_url":"https://github.com/rowanz/merlot/blob/HEAD/utils/model_utils.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":"54e064e79cb0b5fd","code_sha256_prefix":"54e064e79cb0b5fd","mcp_get_code":{"code_sha256":"54e064e79cb0b5fd"}},{"arxiv_id":"2009.07258","arxiv_id_is_arxiv":true,"paper":"/paper/bert-qe-contextualized-query-expansion-for","title":"BERT-QE: Contextualized Query Expansion for Document Re-ranking","date":"2020-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zh-zheng/BERT-QE","path":"functions.py","file_url":"https://github.com/zh-zheng/BERT-QE/blob/HEAD/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ac12e42a0d45740","code_sha256_prefix":"3ac12e42a0d45740","mcp_get_code":{"code_sha256":"3ac12e42a0d45740"}},{"arxiv_id":"2004.13931","arxiv_id_is_arxiv":true,"paper":"/paper/span-based-localizing-network-for-natural","title":"Span-based Localizing Network for Natural Language Video Localization","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IsaacChanghau/VSLNet","path":"model/ops.py","file_url":"https://github.com/IsaacChanghau/VSLNet/blob/HEAD/model/ops.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":"9eb82fd2ed0c768d","code_sha256_prefix":"9eb82fd2ed0c768d","mcp_get_code":{"code_sha256":"9eb82fd2ed0c768d"}},{"arxiv_id":"2004.11579","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistically-masked-language-model","title":"Probabilistically Masked Language Model Capable of Autoregressive Generation in Arbitrary Word Order","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-noah/Pretrained-Language-Model","path":"PMLM/interactive_conditional_samples_sincos_acrostic.py","file_url":"https://github.com/huawei-noah/Pretrained-Language-Model/blob/HEAD/PMLM/interactive_conditional_samples_sincos_acrostic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, huawei-noah/Pretrained-Language-Model when it was checked","code_sha256":"5a657fd9d0832b35","code_sha256_prefix":"5a657fd9d0832b35","mcp_get_code":{"code_sha256":"5a657fd9d0832b35"}},{"arxiv_id":"1906.10652","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-gradient-estimation-in-machine","title":"Monte Carlo Gradient Estimation in Machine Learning","date":"2019-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/mc_gradients","path":"monte_carlo_gradients/utils.py","file_url":"https://github.com/deepmind/mc_gradients/blob/HEAD/monte_carlo_gradients/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 huawei-noah/Pretrained-Language-Model, and GitHub detected no licence in that repository when it was checked","code_sha256":"5a657fd9d0832b35","code_sha256_prefix":"5a657fd9d0832b35","mcp_get_code":{"code_sha256":"5a657fd9d0832b35"}},{"arxiv_id":"1905.12616","arxiv_id_is_arxiv":true,"paper":"/paper/defending-against-neural-fake-news","title":"Defending Against Neural Fake News","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agermanidis/OpenGPT-2","path":"lm/utils.py","file_url":"https://github.com/agermanidis/OpenGPT-2/blob/HEAD/lm/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, agermanidis/OpenGPT-2, 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":"35fdcad846dde14a","code_sha256_prefix":"35fdcad846dde14a","mcp_get_code":{"code_sha256":"35fdcad846dde14a"}},{"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":"TeamLab/bert-gcn-for-paper-citation","path":"modeling.py","file_url":"https://github.com/TeamLab/bert-gcn-for-paper-citation/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, TeamLab/bert-gcn-for-paper-citation when it was checked","code_sha256":"4c33136de32333c9","code_sha256_prefix":"4c33136de32333c9","mcp_get_code":{"code_sha256":"4c33136de32333c9"}},{"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":"pengshuyuan/Bert","path":"modeling.py","file_url":"https://github.com/pengshuyuan/Bert/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d8aa8d9d0c2d5e5","code_sha256_prefix":"2d8aa8d9d0c2d5e5","mcp_get_code":{"code_sha256":"2d8aa8d9d0c2d5e5"}},{"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":"haidershaour/bert","path":"modeling.py","file_url":"https://github.com/haidershaour/bert/blob/HEAD/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":"7b6fa879bb8d0363","code_sha256_prefix":"7b6fa879bb8d0363","mcp_get_code":{"code_sha256":"7b6fa879bb8d0363"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yydai/bert_test","path":"modeling.py","file_url":"https://github.com/yydai/bert_test/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35fdcad846dde14a","code_sha256_prefix":"35fdcad846dde14a","mcp_get_code":{"code_sha256":"35fdcad846dde14a"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SCismycat/bert_code_view","path":"modeling.py","file_url":"https://github.com/SCismycat/bert_code_view/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb8ec9bbf81de318","code_sha256_prefix":"fb8ec9bbf81de318","mcp_get_code":{"code_sha256":"fb8ec9bbf81de318"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ricardordb/bert","path":"modeling.py","file_url":"https://github.com/ricardordb/bert/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce94f4a8d55587e7","code_sha256_prefix":"ce94f4a8d55587e7","mcp_get_code":{"code_sha256":"ce94f4a8d55587e7"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"appcoreopc/berty","path":"modeling.py","file_url":"https://github.com/appcoreopc/berty/blob/HEAD/modeling.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac0b035c48e0e24e","code_sha256_prefix":"ac0b035c48e0e24e","mcp_get_code":{"code_sha256":"ac0b035c48e0e24e"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"demelin/nematode","path":"codebase/transformer.py","file_url":"https://github.com/demelin/nematode/blob/HEAD/codebase/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e35c850bf527e5c","code_sha256_prefix":"8e35c850bf527e5c","mcp_get_code":{"code_sha256":"8e35c850bf527e5c"}},{"arxiv_id":"2023.acl-long.693","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-long.693","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AI4Bharat/IndicBERT","path":"train/modeling.py","file_url":"https://github.com/AI4Bharat/IndicBERT/blob/HEAD/train/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"71f6311eb1501f2e","code_sha256_prefix":"71f6311eb1501f2e","mcp_get_code":{"code_sha256":"71f6311eb1501f2e"}}],"record_sha256":"b5fb7a6ff3b11b4451771923ac47b0409e12a7ef675c056d17898493a3d2c7a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}