{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/import-data","entry":"import_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2408.04498","paper":"/paper/model-based-transfer-learning-for-contextual","title":"Model-Based Transfer Learning for Contextual Reinforcement Learning","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhoon-cho/MBTL","path":"MBTL/utils.py","file_url":"https://github.com/jhoon-cho/MBTL/blob/HEAD/MBTL/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89b89123a59829d8","mcp_get_code":{"code_sha256":"89b89123a59829d8"}},{"arxiv_id":"2211.08036","paper":"/paper/provably-reliable-large-scale-sampling-from","title":"Provably Reliable Large-Scale Sampling from Gaussian Processes","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ant-stephenson/gpsampler","path":"analyse_sweep_output.py","file_url":"https://github.com/ant-stephenson/gpsampler/blob/HEAD/analyse_sweep_output.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b3919379c2d17789","mcp_get_code":{"code_sha256":"b3919379c2d17789"}},{"arxiv_id":"1905.05583","paper":"/paper/how-to-fine-tune-bert-for-text-classification","title":"How to Fine-Tune BERT for Text Classification?","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data","path":"run_hbm.py","file_url":"https://github.com/GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data/blob/HEAD/run_hbm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e0395b2222399e6e","mcp_get_code":{"code_sha256":"e0395b2222399e6e"}},{"arxiv_id":"1811.00239","paper":"/paper/progressive-memory-banks-for-incremental","title":"Progressive Memory Banks for Incremental Domain Adaptation","date":"2018-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nabihach/IDA","path":"nli/nli_model.py","file_url":"https://github.com/nabihach/IDA/blob/HEAD/nli/nli_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b81648f26f1af519","mcp_get_code":{"code_sha256":"b81648f26f1af519"}},{"arxiv_id":"1803.10122","paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AppliedDataSciencePartners/WorldModels","path":"02_train_vae.py","file_url":"https://github.com/AppliedDataSciencePartners/WorldModels/blob/HEAD/02_train_vae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3ccd0377db51a3a2","mcp_get_code":{"code_sha256":"3ccd0377db51a3a2"}},{"arxiv_id":"1803.10122","paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syigzaw/WorldModels","path":"02_train_vae.py","file_url":"https://github.com/syigzaw/WorldModels/blob/HEAD/02_train_vae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c54adf8acefdb36","mcp_get_code":{"code_sha256":"3c54adf8acefdb36"}}]}