{"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/generate-samples","entry":"generate_samples","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":16,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":3,"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":15,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":16,"n_places_pointer_only":8,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":8,"unverified":4},"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.01148","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01148","title":"Arithmetic in the Wild: Llama uses Base-10 Addition to Reason About Cyclic Concepts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"goodfire-ai/arithmetic-wild","path":"src/fourier_probes/pca_fourier_probes_sweep.py","file_url":"https://github.com/goodfire-ai/arithmetic-wild/blob/HEAD/src/fourier_probes/pca_fourier_probes_sweep.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, goodfire-ai/arithmetic-wild when it was checked","code_sha256":"d0869cb2a6ea673c","code_sha256_prefix":"d0869cb2a6ea673c","mcp_get_code":{"code_sha256":"d0869cb2a6ea673c"}},{"arxiv_id":"2410.19192","arxiv_id_is_arxiv":true,"paper":"/paper/team-topological-evolution-aware-framework","title":"TEAM: Topological Evolution-aware Framework for Traffic Forecasting--Extended Version","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvmduc/TEAM-topo-evo-traffic-forecasting","path":"utils/data_convert.py","file_url":"https://github.com/kvmduc/TEAM-topo-evo-traffic-forecasting/blob/HEAD/utils/data_convert.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, kvmduc/TEAM-topo-evo-traffic-forecasting when it was checked","code_sha256":"9dc0173af6e1dfb9","code_sha256_prefix":"9dc0173af6e1dfb9","mcp_get_code":{"code_sha256":"9dc0173af6e1dfb9"}},{"arxiv_id":"2410.17891","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-diffusion-language-models-via","title":"Scaling Diffusion Language Models via Adaptation from Autoregressive Models","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/DiffuLLaMA","path":"model.py","file_url":"https://github.com/HKUNLP/DiffuLLaMA/blob/HEAD/model.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, HKUNLP/DiffuLLaMA when it was checked","code_sha256":"2d05c810fd8d785d","code_sha256_prefix":"2d05c810fd8d785d","mcp_get_code":{"code_sha256":"2d05c810fd8d785d"}},{"arxiv_id":"2402.13040","arxiv_id_is_arxiv":true,"paper":"/paper/text-guided-molecule-generation-with","title":"Text-Guided Molecule Generation with Diffusion Language Model","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deno-v/tgm-dlm","path":"improved-diffusion/control_gen/baseline_control.py","file_url":"https://github.com/deno-v/tgm-dlm/blob/HEAD/improved-diffusion/control_gen/baseline_control.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, deno-v/tgm-dlm when it was checked","code_sha256":"bd70407415c5ed19","code_sha256_prefix":"bd70407415c5ed19","mcp_get_code":{"code_sha256":"bd70407415c5ed19"}},{"arxiv_id":"2311.18677","arxiv_id_is_arxiv":true,"paper":"/paper/splitwise-efficient-generative-llm-inference","title":"Splitwise: Efficient generative LLM inference using phase splitting","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"Mutinifni/splitwise-sim","path":"generate_trace.py","file_url":"https://github.com/Mutinifni/splitwise-sim/blob/HEAD/generate_trace.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":"506db674bec6177c","code_sha256_prefix":"506db674bec6177c","mcp_get_code":{"code_sha256":"506db674bec6177c"}},{"arxiv_id":"2310.10899","arxiv_id_is_arxiv":true,"paper":"/paper/instilling-inductive-biases-with-subnetworks","title":"Instilling Inductive Biases with Subnetworks","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rock-z/instilling-inductiva-bias","path":"math/utils.py","file_url":"https://github.com/rock-z/instilling-inductiva-bias/blob/HEAD/math/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, rock-z/instilling-inductiva-bias when it was checked","code_sha256":"4093d31d217c9e02","code_sha256_prefix":"4093d31d217c9e02","mcp_get_code":{"code_sha256":"4093d31d217c9e02"}},{"arxiv_id":"2302.03026","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-based-accuracy-testing-of-posterior","title":"Sampling-Based Accuracy Testing of Posterior Estimators for General Inference","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ciela-Institute/tarp","path":"scripts/gaussian.py","file_url":"https://github.com/Ciela-Institute/tarp/blob/HEAD/scripts/gaussian.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"435169c3d2a565bb","code_sha256_prefix":"435169c3d2a565bb","mcp_get_code":{"code_sha256":"435169c3d2a565bb"}},{"arxiv_id":"2209.15421","arxiv_id_is_arxiv":true,"paper":"/paper/tabddpm-modelling-tabular-data-with-diffusion","title":"TabDDPM: Modelling Tabular Data with Diffusion Models","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-liu-stat/syn","path":"conditional/utils/ddpm.py","file_url":"https://github.com/yifei-liu-stat/syn/blob/HEAD/conditional/utils/ddpm.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":"0ba9a28441c16b29","code_sha256_prefix":"0ba9a28441c16b29","mcp_get_code":{"code_sha256":"0ba9a28441c16b29"}},{"arxiv_id":"2205.14334","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-models-to-express-their-uncertainty","title":"Teaching Models to Express Their Uncertainty in Words","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sylinrl/calibratedmath","path":"dataset.py","file_url":"https://github.com/sylinrl/calibratedmath/blob/HEAD/dataset.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, sylinrl/calibratedmath when it was checked","code_sha256":"edd0fad862fa1892","code_sha256_prefix":"edd0fad862fa1892","mcp_get_code":{"code_sha256":"edd0fad862fa1892"}},{"arxiv_id":"2205.14217","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-lm-improves-controllable-text","title":"Diffusion-LM Improves Controllable Text Generation","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangli1999/diffusion-lm","path":"improved-diffusion/control_gen/baseline_control.py","file_url":"https://github.com/xiangli1999/diffusion-lm/blob/HEAD/improved-diffusion/control_gen/baseline_control.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 deno-v/tgm-dlm, and GitHub detected no licence in that repository when it was checked","code_sha256":"bd70407415c5ed19","code_sha256_prefix":"bd70407415c5ed19","mcp_get_code":{"code_sha256":"bd70407415c5ed19"}},{"arxiv_id":"2112.02815","arxiv_id_is_arxiv":true,"paper":"/paper/make-it-move-controllable-image-to-video","title":"Make It Move: Controllable Image-to-Video Generation with Text Descriptions","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youncy-hu/mage","path":"train_vqvae.py","file_url":"https://github.com/youncy-hu/mage/blob/HEAD/train_vqvae.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":"985a9706d3062c92","code_sha256_prefix":"985a9706d3062c92","mcp_get_code":{"code_sha256":"985a9706d3062c92"}},{"arxiv_id":"2105.12195","arxiv_id_is_arxiv":true,"paper":"/paper/bias-in-machine-learning-software-why-how","title":"Bias in Machine Learning Software: Why? How? What to do?","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joymallyac/Fair-SMOTE","path":"Generate_Samples.py","file_url":"https://github.com/joymallyac/Fair-SMOTE/blob/HEAD/Generate_Samples.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":"c7d03937e3c8925b","code_sha256_prefix":"c7d03937e3c8925b","mcp_get_code":{"code_sha256":"c7d03937e3c8925b"}},{"arxiv_id":"2102.11495","arxiv_id_is_arxiv":true,"paper":"/paper/anytime-sampling-for-autoregressive-models-1","title":"Anytime Sampling for Autoregressive Models via Ordered Autoencoding","date":"2021-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"newbeeer/anytime-auto-regressive-model","path":"vqvae.py","file_url":"https://github.com/newbeeer/anytime-auto-regressive-model/blob/HEAD/vqvae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, newbeeer/anytime-auto-regressive-model when it was checked","code_sha256":"f240c71dd79d8c7b","code_sha256_prefix":"f240c71dd79d8c7b","mcp_get_code":{"code_sha256":"f240c71dd79d8c7b"}},{"arxiv_id":"2007.04154","arxiv_id_is_arxiv":true,"paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"src/adapted_mtgl/mtgl_test/ada_emp_dist.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/src/adapted_mtgl/mtgl_test/ada_emp_dist.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":"5ac4c9297ca552b1","code_sha256_prefix":"5ac4c9297ca552b1","mcp_get_code":{"code_sha256":"5ac4c9297ca552b1"}},{"arxiv_id":"2006.02286","arxiv_id_is_arxiv":true,"paper":"/paper/learning-kernel-tests-without-data-splitting","title":"Learning Kernel Tests Without Data Splitting","date":"2020-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MPI-IS/tests-wo-splitting","path":"tests_wo_split/datasets/generate_data.py","file_url":"https://github.com/MPI-IS/tests-wo-splitting/blob/HEAD/tests_wo_split/datasets/generate_data.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":"5d33a90d85794f63","code_sha256_prefix":"5d33a90d85794f63","mcp_get_code":{"code_sha256":"5d33a90d85794f63"}},{"arxiv_id":"1811.04857","arxiv_id_is_arxiv":true,"paper":"/paper/generative-dual-adversarial-network-for","title":"Generative Dual Adversarial Network for Generalized Zero-shot Learning","date":"2018-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevehuanghe/GDAN","path":"valtest_gdan.py","file_url":"https://github.com/stevehuanghe/GDAN/blob/HEAD/valtest_gdan.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":"a2385e7b5e1c63a3","code_sha256_prefix":"a2385e7b5e1c63a3","mcp_get_code":{"code_sha256":"a2385e7b5e1c63a3"}}],"record_sha256":"66b11af447fd8bf70785dc94b7950afad2c18dcc8247846ed08fb86aaa102c17","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}