{"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/mkdir","entry":"mkdir","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":12,"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":10,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":4,"unverified":3},"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.04462","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04462","title":"Meta-probabilistic Modeling","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"kzhangm02/mpm","path":"sequential_text_modeling/mpm/model.py","file_url":"https://github.com/kzhangm02/mpm/blob/HEAD/sequential_text_modeling/mpm/model.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":"6bf6a03fd61496a6","code_sha256_prefix":"6bf6a03fd61496a6","mcp_get_code":{"code_sha256":"6bf6a03fd61496a6"}},{"arxiv_id":"2512.02206","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-02206","title":"WhAM: Towards A Translative Model of Sperm Whale Vocalization","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Project-CETI/wham","path":"vampnet/vampnet/beats.py","file_url":"https://github.com/Project-CETI/wham/blob/HEAD/vampnet/vampnet/beats.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"843cfb3ab9041539","code_sha256_prefix":"843cfb3ab9041539","mcp_get_code":{"code_sha256":"843cfb3ab9041539"}},{"arxiv_id":"2507.01006","arxiv_id_is_arxiv":true,"paper":"/paper/glm-4-1v-thinking-towards-versatile","title":"GLM-4.1V-Thinking: Towards Versatile Multimodal Reasoning with Scalable Reinforcement Learning","date":"2025-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/glm-4.1v-thinking","path":"glmv_reward/src/glmv_reward/utils/path.py","file_url":"https://github.com/thudm/glm-4.1v-thinking/blob/HEAD/glmv_reward/src/glmv_reward/utils/path.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3eda651318fb875a","code_sha256_prefix":"3eda651318fb875a","mcp_get_code":{"code_sha256":"3eda651318fb875a"}},{"arxiv_id":"2310.12404","arxiv_id_is_arxiv":true,"paper":"/paper/loop-copilot-conducting-ai-ensembles-for","title":"Loop Copilot: Conducting AI Ensembles for Music Generation and Iterative Editing","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ldzhangyx/loop-copilot","path":"melodytalk/dependencies/vampnet/beats.py","file_url":"https://github.com/ldzhangyx/loop-copilot/blob/HEAD/melodytalk/dependencies/vampnet/beats.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"843cfb3ab9041539","code_sha256_prefix":"843cfb3ab9041539","mcp_get_code":{"code_sha256":"843cfb3ab9041539"}},{"arxiv_id":"2307.04686","arxiv_id_is_arxiv":true,"paper":"/paper/vampnet-music-generation-via-masked-acoustic","title":"VampNet: Music Generation via Masked Acoustic Token Modeling","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugofloresgarcia/vampnet","path":"vampnet/beats.py","file_url":"https://github.com/hugofloresgarcia/vampnet/blob/HEAD/vampnet/beats.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"843cfb3ab9041539","code_sha256_prefix":"843cfb3ab9041539","mcp_get_code":{"code_sha256":"843cfb3ab9041539"}},{"arxiv_id":"2306.05862","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-you-may-communicate-less","title":"Lessons from Generalization Error Analysis of Federated Learning: You May Communicate Less Often!","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"romainchor/generalization_fl_icml2024","path":"Additional/train_utils.py","file_url":"https://github.com/romainchor/generalization_fl_icml2024/blob/HEAD/Additional/train_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":"1c3ea89e818e1fa2","code_sha256_prefix":"1c3ea89e818e1fa2","mcp_get_code":{"code_sha256":"1c3ea89e818e1fa2"}},{"arxiv_id":"2306.03921","arxiv_id_is_arxiv":true,"paper":"/paper/variational-monte-carlo-with-large-patched","title":"Variational Monte Carlo with Large Patched Transformers","date":null,"month_inferred_from_arxiv_id":"2023-06","title_source":"archive","repo":"apriquot/vmc_with_lptfs","path":"tvmc/models/training.py","file_url":"https://github.com/apriquot/vmc_with_lptfs/blob/HEAD/tvmc/models/training.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":"885ca2b41a753a9a","code_sha256_prefix":"885ca2b41a753a9a","mcp_get_code":{"code_sha256":"885ca2b41a753a9a"}},{"arxiv_id":"2205.03990","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-parametric-spatiotemporal-dynamics","title":"Multi-resolution partial differential equations preserved learning framework for spatiotemporal dynamics","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianxun-wang/ppnn","path":"baselines/PINN_DeepONet/deeponet_train_u.py","file_url":"https://github.com/jianxun-wang/ppnn/blob/HEAD/baselines/PINN_DeepONet/deeponet_train_u.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":"a69b7f072458ebc3","code_sha256_prefix":"a69b7f072458ebc3","mcp_get_code":{"code_sha256":"a69b7f072458ebc3"}},{"arxiv_id":"2205.03990","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-parametric-spatiotemporal-dynamics","title":"Multi-resolution partial differential equations preserved learning framework for spatiotemporal dynamics","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianxun-wang/ppnn","path":"baselines/PINN_DeepONet/deeponet_train_v.py","file_url":"https://github.com/jianxun-wang/ppnn/blob/HEAD/baselines/PINN_DeepONet/deeponet_train_v.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":"48dc07bb5deedd70","code_sha256_prefix":"48dc07bb5deedd70","mcp_get_code":{"code_sha256":"48dc07bb5deedd70"}},{"arxiv_id":"1810.04374","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-approximation-capabilities-of-relu","title":"On the Approximation Properties of Random ReLU Features","date":"2018-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syitong/randrelu","path":"depth_sep/lib/utils.py","file_url":"https://github.com/syitong/randrelu/blob/HEAD/depth_sep/lib/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":"d6b9558bc0e2c5a9","code_sha256_prefix":"d6b9558bc0e2c5a9","mcp_get_code":{"code_sha256":"d6b9558bc0e2c5a9"}},{"arxiv_id":"1806.07366","arxiv_id_is_arxiv":true,"paper":"/paper/neural-ordinary-differential-equations","title":"Neural Ordinary Differential Equations","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/numerics_independent_neural_odes","path":"models/models.py","file_url":"https://github.com/boschresearch/numerics_independent_neural_odes/blob/HEAD/models/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/numerics_independent_neural_odes, is not in the permissive set Syntology serves inline","code_sha256":"9012d6958edc86f1","code_sha256_prefix":"9012d6958edc86f1","mcp_get_code":{"code_sha256":"9012d6958edc86f1"}},{"arxiv_id":"1803.07055","arxiv_id_is_arxiv":true,"paper":"/paper/simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jainpankul/Augmented-Random-Search","path":"ARS.py","file_url":"https://github.com/jainpankul/Augmented-Random-Search/blob/HEAD/ARS.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jainpankul/Augmented-Random-Search when it was checked","code_sha256":"6b3bc12652205efd","code_sha256_prefix":"6b3bc12652205efd","mcp_get_code":{"code_sha256":"6b3bc12652205efd"}},{"arxiv_id":"1703.03864","arxiv_id_is_arxiv":true,"paper":"/paper/evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"6b3bc12652205efd","code_sha256_prefix":"6b3bc12652205efd","mcp_get_code":{"code_sha256":"6b3bc12652205efd"}}],"record_sha256":"b079a24a528d1626ca3b1e869e2d2fc1855d29ec88df55d45a335b64c22399ae","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}