{"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/convert-single-example","entry":"convert_single_example","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"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":5,"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":"1909.05017","arxiv_id_is_arxiv":true,"paper":"/paper/question-generation-by-transformers","title":"Question Generation by Transformers","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"artitw/BERT_QA","path":"bert_qa/classifier_data_lib.py","file_url":"https://github.com/artitw/BERT_QA/blob/HEAD/bert_qa/classifier_data_lib.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":"7346ad7b1d174de0","code_sha256_prefix":"7346ad7b1d174de0","mcp_get_code":{"code_sha256":"7346ad7b1d174de0"}},{"arxiv_id":"1909.03186","arxiv_id_is_arxiv":true,"paper":"/paper/on-extractive-and-abstractive-neural-document","title":"On Extractive and Abstractive Neural Document Summarization with Transformer Language Models","date":"2019-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bread-and-Code/Text-Summarization","path":"Sam/transfer_learning/preprocess.py","file_url":"https://github.com/Bread-and-Code/Text-Summarization/blob/HEAD/Sam/transfer_learning/preprocess.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":"8b4900c56e32f11a","code_sha256_prefix":"8b4900c56e32f11a","mcp_get_code":{"code_sha256":"8b4900c56e32f11a"}},{"arxiv_id":"1906.05572","arxiv_id_is_arxiv":true,"paper":"/paper/proactive-human-machine-conversation-with","title":"Proactive Human-Machine Conversation with Explicit Conversation Goals","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/ducon_GPU","path":"src/reader.py","file_url":"https://github.com/yangyucheng000/ducon_GPU/blob/HEAD/src/reader.py","status":"ran","verification_level":1,"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":"42ecf6e94739c7db","code_sha256_prefix":"42ecf6e94739c7db","mcp_get_code":{"code_sha256":"42ecf6e94739c7db"}},{"arxiv_id":"1902.10909","arxiv_id_is_arxiv":true,"paper":"/paper/bert-for-joint-intent-classification-and-slot","title":"BERT for Joint Intent Classification and Slot Filling","date":"2019-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mangushev/intent_slot","path":"assistant/functions/intent_slot/preprocessor/preprocess.py","file_url":"https://github.com/mangushev/intent_slot/blob/HEAD/assistant/functions/intent_slot/preprocessor/preprocess.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":"047d8e25a9cd47a0","code_sha256_prefix":"047d8e25a9cd47a0","mcp_get_code":{"code_sha256":"047d8e25a9cd47a0"}},{"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":"chandu7077/mybert","path":"run_classifier.py","file_url":"https://github.com/chandu7077/mybert/blob/HEAD/run_classifier.py","status":"ran","verification_level":1,"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":"ac776e46fc1084e7","code_sha256_prefix":"ac776e46fc1084e7","mcp_get_code":{"code_sha256":"ac776e46fc1084e7"}},{"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":"lehoanganh298/BERT-Question-Answering","path":"run_classifier_predict.py","file_url":"https://github.com/lehoanganh298/BERT-Question-Answering/blob/HEAD/run_classifier_predict.py","status":"ran","verification_level":1,"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":"6bd23bdfeb17ff94","code_sha256_prefix":"6bd23bdfeb17ff94","mcp_get_code":{"code_sha256":"6bd23bdfeb17ff94"}}],"record_sha256":"e0d83390e0794dd36a9715ce6974a53520225121be0680d3628901270e3d5a8a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}