{"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/translate","entry":"translate","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":17,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":5,"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":24,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":7,"n_samples_unverified":8,"n_samples_fingerprinted":4,"n_places":24,"n_places_pointer_only":6,"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":5,"ran_fixture":2,"ran":8,"unverified":8},"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":"2605.14759","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14759","title":"Crys-JEPA: Accelerating Crystal Discovery via Embedding Screening and Generative Refinement","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"liun-online/Crys_JEPA","path":"components/jepa/frame/jepa.py","file_url":"https://github.com/liun-online/Crys_JEPA/blob/HEAD/components/jepa/frame/jepa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liun-online/Crys_JEPA when it was checked","code_sha256":"d77256e535c6b4c9","code_sha256_prefix":"d77256e535c6b4c9","mcp_get_code":{"code_sha256":"d77256e535c6b4c9"}},{"arxiv_id":"2602.13348","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13348","title":"Exploring the Performance of ML/DL Architectures on the MNIST-1D Dataset","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"michael-beebe/mnist1d","path":"mnist1d/transform.py","file_url":"https://github.com/michael-beebe/mnist1d/blob/HEAD/mnist1d/transform.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"62f92a4a7780fe57","code_sha256_prefix":"62f92a4a7780fe57","mcp_get_code":{"code_sha256":"62f92a4a7780fe57"}},{"arxiv_id":"2601.04716","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04716","title":"Identifying and Mitigating Bottlenecks in Role-Playing Agents: A Systematic Study of Disentangling Character Profile Axes","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"kwaroran/Risuai","path":"t.py","file_url":"https://github.com/kwaroran/Risuai/blob/HEAD/t.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, kwaroran/Risuai, is not in the permissive set Syntology serves inline","code_sha256":"628b9c2ba7b9a8c2","code_sha256_prefix":"628b9c2ba7b9a8c2","mcp_get_code":{"code_sha256":"628b9c2ba7b9a8c2"}},{"arxiv_id":"2505.08140","arxiv_id_is_arxiv":true,"paper":"/paper/lost-in-transmission-when-and-why-llms-fail","title":"Lost in Transmission: When and Why LLMs Fail to Reason Globally","date":"2025-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/bapo","path":"plot_results.py","file_url":"https://github.com/microsoft/bapo/blob/HEAD/plot_results.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":"6a1651f03df882eb","code_sha256_prefix":"6a1651f03df882eb","mcp_get_code":{"code_sha256":"6a1651f03df882eb"}},{"arxiv_id":"2501.06346","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-share-representations","title":"Large Language Models Share Representations of Latent Grammatical Concepts Across Typologically Diverse Languages","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jannik-brinkmann/multilingual-features","path":"translation.py","file_url":"https://github.com/jannik-brinkmann/multilingual-features/blob/HEAD/translation.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":"0d142a44e09ac98d","code_sha256_prefix":"0d142a44e09ac98d","mcp_get_code":{"code_sha256":"0d142a44e09ac98d"}},{"arxiv_id":"2404.18185","arxiv_id_is_arxiv":true,"paper":"/paper/ranked-list-truncation-for-large-language","title":"Ranked List Truncation for Large Language Model-based Re-Ranking","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuanmeng/rlt4reranking","path":"format.py","file_url":"https://github.com/chuanmeng/rlt4reranking/blob/HEAD/format.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chuanmeng/rlt4reranking when it was checked","code_sha256":"a30bc6e83a6ddfa2","code_sha256_prefix":"a30bc6e83a6ddfa2","mcp_get_code":{"code_sha256":"a30bc6e83a6ddfa2"}},{"arxiv_id":"2402.10946","arxiv_id_is_arxiv":true,"paper":"/paper/culturellm-incorporating-cultural-differences","title":"CultureLLM: Incorporating Cultural Differences into Large Language Models","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Scarelette/CultureLLM","path":"data_process.py","file_url":"https://github.com/Scarelette/CultureLLM/blob/HEAD/data_process.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Scarelette/CultureLLM when it was checked","code_sha256":"c6579ce09993d66e","code_sha256_prefix":"c6579ce09993d66e","mcp_get_code":{"code_sha256":"c6579ce09993d66e"}},{"arxiv_id":"2312.01473","arxiv_id_is_arxiv":true,"paper":"/paper/regularity-as-intrinsic-reward-for-free-play-1","title":"Regularity as Intrinsic Reward for Free Play","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orybkin/lexa-benchmark","path":"envs/utils.py","file_url":"https://github.com/orybkin/lexa-benchmark/blob/HEAD/envs/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, orybkin/lexa-benchmark when it was checked","code_sha256":"af79d1c1c616741a","code_sha256_prefix":"af79d1c1c616741a","mcp_get_code":{"code_sha256":"af79d1c1c616741a"}},{"arxiv_id":"2310.13398","arxiv_id_is_arxiv":true,"paper":"/paper/openannotate3d-open-vocabulary-auto-labeling","title":"OpenAnnotate3D: Open-Vocabulary Auto-Labeling System for Multi-modal 3D Data","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fudan-projecttitan/openannotate3d","path":"ICRA24_OpenAnnotate3D/Server/utils/agent.py","file_url":"https://github.com/fudan-projecttitan/openannotate3d/blob/HEAD/ICRA24_OpenAnnotate3D/Server/utils/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fudan-projecttitan/openannotate3d when it was checked","code_sha256":"d9b53d1783cd3fc0","code_sha256_prefix":"d9b53d1783cd3fc0","mcp_get_code":{"code_sha256":"d9b53d1783cd3fc0"}},{"arxiv_id":"2306.09077","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-generic-3d-room-structures-from-2d-1","title":"Estimating Generic 3D Room Structures from 2D Annotations","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/cad-estate","path":"src/cad_estate/transformations.py","file_url":"https://github.com/google-research/cad-estate/blob/HEAD/src/cad_estate/transformations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3d5abafbebad6155","code_sha256_prefix":"3d5abafbebad6155","mcp_get_code":{"code_sha256":"3d5abafbebad6155"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthur-heng/nlgraph","path":"evaluation/connectivity.py","file_url":"https://github.com/arthur-heng/nlgraph/blob/HEAD/evaluation/connectivity.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fac4585dd50fc9b7","code_sha256_prefix":"fac4585dd50fc9b7","mcp_get_code":{"code_sha256":"fac4585dd50fc9b7"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthur-heng/nlgraph","path":"evaluation/cycle.py","file_url":"https://github.com/arthur-heng/nlgraph/blob/HEAD/evaluation/cycle.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"38fdd534407c8c15","code_sha256_prefix":"38fdd534407c8c15","mcp_get_code":{"code_sha256":"38fdd534407c8c15"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/flow.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/flow.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":"8e91c3d4139b8193","code_sha256_prefix":"8e91c3d4139b8193","mcp_get_code":{"code_sha256":"8e91c3d4139b8193"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/gnn.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/gnn.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":"04daf61e489de501","code_sha256_prefix":"04daf61e489de501","mcp_get_code":{"code_sha256":"04daf61e489de501"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/topology.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/topology.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":"c8139334cc727e15","code_sha256_prefix":"c8139334cc727e15","mcp_get_code":{"code_sha256":"c8139334cc727e15"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/hamilton.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/hamilton.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":"503a4252204da5ca","code_sha256_prefix":"503a4252204da5ca","mcp_get_code":{"code_sha256":"503a4252204da5ca"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/matching.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/matching.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":"92ac2d6e4ce50246","code_sha256_prefix":"92ac2d6e4ce50246","mcp_get_code":{"code_sha256":"92ac2d6e4ce50246"}},{"arxiv_id":"2305.10037","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/shortest_path.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/shortest_path.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":"8ac657fd99c70d31","code_sha256_prefix":"8ac657fd99c70d31","mcp_get_code":{"code_sha256":"8ac657fd99c70d31"}},{"arxiv_id":"2210.13669","arxiv_id_is_arxiv":true,"paper":"/paper/help-me-write-a-poem-instruction-tuning-as-a","title":"Help me write a poem: Instruction Tuning as a Vehicle for Collaborative Poetry Writing","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vishakhpk/creative-instructions","path":"demo_poetic/demo_poetic.py","file_url":"https://github.com/vishakhpk/creative-instructions/blob/HEAD/demo_poetic/demo_poetic.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":"38ff82ed42c0eda8","code_sha256_prefix":"38ff82ed42c0eda8","mcp_get_code":{"code_sha256":"38ff82ed42c0eda8"}},{"arxiv_id":"2205.06153","arxiv_id_is_arxiv":true,"paper":"/paper/treemix-compositional-constituency-based-data","title":"TreeMix: Compositional Constituency-based Data Augmentation for Natural Language Understanding","date":"2022-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magiccircuit/treemix","path":"Augmentation.py","file_url":"https://github.com/magiccircuit/treemix/blob/HEAD/Augmentation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f097bb7bef545808","code_sha256_prefix":"f097bb7bef545808","mcp_get_code":{"code_sha256":"f097bb7bef545808"}},{"arxiv_id":"2002.12463","arxiv_id_is_arxiv":true,"paper":"/paper/certification-of-semantic-perturbations-via","title":"Certified Defense to Image Transformations via Randomized Smoothing","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/transformation-smoothing","path":"classifyHeuristic.py","file_url":"https://github.com/eth-sri/transformation-smoothing/blob/HEAD/classifyHeuristic.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0416a70893e0650d","code_sha256_prefix":"0416a70893e0650d","mcp_get_code":{"code_sha256":"0416a70893e0650d"}},{"arxiv_id":"1912.05200","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-spanish-translation-of-the-squad","title":"Automatic Spanish Translation of the SQuAD Dataset for Multilingual Question Answering","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmarent/TranslateAlignRetrieve","path":"src/tar/src/retrieve/translate_retrieve_utils.py","file_url":"https://github.com/lmarent/TranslateAlignRetrieve/blob/HEAD/src/tar/src/retrieve/translate_retrieve_utils.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":"1e4928b96c9f617a","code_sha256_prefix":"1e4928b96c9f617a","mcp_get_code":{"code_sha256":"1e4928b96c9f617a"}},{"arxiv_id":"1901.11196","arxiv_id_is_arxiv":true,"paper":"/paper/eda-easy-data-augmentation-techniques-for","title":"EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks","date":"2019-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wac81/textda","path":"textda/youdao_translate.py","file_url":"https://github.com/wac81/textda/blob/HEAD/textda/youdao_translate.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":"be53242ffe2dc1e4","code_sha256_prefix":"be53242ffe2dc1e4","mcp_get_code":{"code_sha256":"be53242ffe2dc1e4"}},{"arxiv_id":"1901.08149","arxiv_id_is_arxiv":true,"paper":"/paper/transfertransfo-a-transfer-learning-approach","title":"TransferTransfo: A Transfer Learning Approach for Neural Network Based Conversational Agents","date":"2019-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liliaellouz/wabi-sabi","path":"integrate_summary.py","file_url":"https://github.com/liliaellouz/wabi-sabi/blob/HEAD/integrate_summary.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4f520ecd9ceaa5e","code_sha256_prefix":"b4f520ecd9ceaa5e","mcp_get_code":{"code_sha256":"b4f520ecd9ceaa5e"}}],"record_sha256":"40971f3c05478ec5d753e00d1c490cde7686c0a5535e288eb5ff2850071ba756","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}