{"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/shape-list","entry":"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":9,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":0},"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.10926","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-10926","title":"Selecting Language Models for Social Science: Start Small, Start Open, and Validate Preprint XX(X):1-22 ©The Author(s) 2026","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"openai/gpt-2","path":"src/model.py","file_url":"https://github.com/openai/gpt-2/blob/HEAD/src/model.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, openai/gpt-2 when it was checked","code_sha256":"6220c13c591c68a7","code_sha256_prefix":"6220c13c591c68a7","mcp_get_code":{"code_sha256":"6220c13c591c68a7"}},{"arxiv_id":"2206.00888","arxiv_id_is_arxiv":true,"paper":"/paper/squeezeformer-an-efficient-transformer-for","title":"Squeezeformer: An Efficient Transformer for Automatic Speech Recognition","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kssteven418/squeezeformer","path":"src/models/conformer_encoder.py","file_url":"https://github.com/kssteven418/squeezeformer/blob/HEAD/src/models/conformer_encoder.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":"f1f0e7aba532e2f6","code_sha256_prefix":"f1f0e7aba532e2f6","mcp_get_code":{"code_sha256":"f1f0e7aba532e2f6"}},{"arxiv_id":"2006.00555","arxiv_id_is_arxiv":true,"paper":"/paper/transferring-inductive-biases-through","title":"Transferring Inductive Biases through Knowledge Distillation","date":"2020-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samiraabnar/Reflect","path":"tf2_models/common_layers.py","file_url":"https://github.com/samiraabnar/Reflect/blob/HEAD/tf2_models/common_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6220c13c591c68a7","code_sha256_prefix":"6220c13c591c68a7","mcp_get_code":{"code_sha256":"6220c13c591c68a7"}},{"arxiv_id":"2003.04218","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/deepltl","path":"deepltl/models/beam_search.py","file_url":"https://github.com/reactive-systems/deepltl/blob/HEAD/deepltl/models/beam_search.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e092e8e3a00bcec6","code_sha256_prefix":"e092e8e3a00bcec6","mcp_get_code":{"code_sha256":"e092e8e3a00bcec6"}},{"arxiv_id":"1910.01108","arxiv_id_is_arxiv":true,"paper":"/paper/distilbert-a-distilled-version-of-bert","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkavim/finetune_bert","path":"finetune/modeling_distilbert.py","file_url":"https://github.com/mkavim/finetune_bert/blob/HEAD/finetune/modeling_distilbert.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":"6220c13c591c68a7","code_sha256_prefix":"6220c13c591c68a7","mcp_get_code":{"code_sha256":"6220c13c591c68a7"}},{"arxiv_id":"1904.09925","arxiv_id_is_arxiv":true,"paper":"/paper/190409925","title":"Attention Augmented Convolutional Networks","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Data-drone/attention_augmented_cnn","path":"pytorch_code/self_atten_utils.py","file_url":"https://github.com/Data-drone/attention_augmented_cnn/blob/HEAD/pytorch_code/self_atten_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6478c4d903d597e7","code_sha256_prefix":"6478c4d903d597e7","mcp_get_code":{"code_sha256":"6478c4d903d597e7"}},{"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":"haydlite/sparse-bert-ner","path":"bert_sparse/utils.py","file_url":"https://github.com/haydlite/sparse-bert-ner/blob/HEAD/bert_sparse/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":"cd763e47e29c808f","code_sha256_prefix":"cd763e47e29c808f","mcp_get_code":{"code_sha256":"cd763e47e29c808f"}},{"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":"reactive-systems/circuit-repair","path":"ml2/models/transformer.py","file_url":"https://github.com/reactive-systems/circuit-repair/blob/HEAD/ml2/models/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e092e8e3a00bcec6","code_sha256_prefix":"e092e8e3a00bcec6","mcp_get_code":{"code_sha256":"e092e8e3a00bcec6"}},{"arxiv_id":"2021.emnlp-main.154","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.emnlp-main.154","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hazelsuko07/TextHide","path":"transformers_hide/modeling_tf_utils.py","file_url":"https://github.com/Hazelsuko07/TextHide/blob/HEAD/transformers_hide/modeling_tf_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":"99b8a0bda9a0f475","code_sha256_prefix":"99b8a0bda9a0f475","mcp_get_code":{"code_sha256":"99b8a0bda9a0f475"}}],"record_sha256":"04393a2e61da47128c5822cc6fac84aa9c650195b33cdadb4db21943a317dc46","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}