{"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/create-dir","entry":"create_dir","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":10,"n_papers_ran":4,"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":12,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":9,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":2,"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":"2605.28589","paper":"/paper/arxiv-2605-28589","title":"Thinned Mean Field Langevin Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hudsonchen/thinned_mfld","path":"run_mfld.py","file_url":"https://github.com/hudsonchen/thinned_mfld/blob/HEAD/run_mfld.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b768cf9bfb263c52","mcp_get_code":{"code_sha256":"b768cf9bfb263c52"}},{"arxiv_id":"2605.28589","paper":"/paper/arxiv-2605-28589","title":"Thinned Mean Field Langevin Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hudsonchen/thinned_mfld","path":"run_mfg.py","file_url":"https://github.com/hudsonchen/thinned_mfld/blob/HEAD/run_mfg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b58f9b860674532","mcp_get_code":{"code_sha256":"5b58f9b860674532"}},{"arxiv_id":"2507.15501","paper":null,"title":"arXiv:2507.15501","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"apple/ml-aspera","path":"src/aspera/utils.py","file_url":"https://github.com/apple/ml-aspera/blob/HEAD/src/aspera/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"42ac624e5a29b6dc","mcp_get_code":{"code_sha256":"42ac624e5a29b6dc"}},{"arxiv_id":"2504.02199","paper":"/paper/esc-erasing-space-concept-for-knowledge","title":"ESC: Erasing Space Concept for Knowledge Deletion","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-VGI/ESC","path":"unlearn.py","file_url":"https://github.com/KU-VGI/ESC/blob/HEAD/unlearn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"54f51ff8da6ff35e","mcp_get_code":{"code_sha256":"54f51ff8da6ff35e"}},{"arxiv_id":"2410.04010","paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/hyplora","path":"utils/token_frequency_distribution.py","file_url":"https://github.com/marlin-codes/hyplora/blob/HEAD/utils/token_frequency_distribution.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2ac7050b0ae37227","mcp_get_code":{"code_sha256":"2ac7050b0ae37227"}},{"arxiv_id":"2302.06868","paper":"/paper/switchprompt-learning-domain-specific-gated","title":"SwitchPrompt: Learning Domain-Specific Gated Soft Prompts for Classification in Low-Resource Domains","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/switchprompt","path":"databuilding_script.py","file_url":"https://github.com/boschresearch/switchprompt/blob/HEAD/databuilding_script.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"code_sha256_prefix":"e0cfc6afa173334a","mcp_get_code":{"code_sha256":"e0cfc6afa173334a"}},{"arxiv_id":"2203.06304","paper":"/paper/misf-multi-level-interactive-siamese","title":"MISF: Multi-level Interactive Siamese Filtering for High-Fidelity Image Inpainting","date":"2022-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingqguo/misf","path":"src/misf.py","file_url":"https://github.com/tsingqguo/misf/blob/HEAD/src/misf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dc389a4987d62208","mcp_get_code":{"code_sha256":"dc389a4987d62208"}},{"arxiv_id":"2110.09958","paper":"/paper/the-cocktail-fork-problem-three-stem-audio","title":"The Cocktail Fork Problem: Three-Stem Audio Separation for Real-World Soundtracks","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"darius522/dnr-utils","path":"utils.py","file_url":"https://github.com/darius522/dnr-utils/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8bc10e8fdd10cfe6","mcp_get_code":{"code_sha256":"8bc10e8fdd10cfe6"}},{"arxiv_id":"2104.07689","paper":"/paper/dual-contrastive-learning-for-unsupervised","title":"Dual Contrastive Learning for Unsupervised Image-to-Image Translation","date":"2021-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Deopoler/DCLGAN-Keras","path":"utils.py","file_url":"https://github.com/Deopoler/DCLGAN-Keras/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff8a46b5b4b20261","mcp_get_code":{"code_sha256":"ff8a46b5b4b20261"}},{"arxiv_id":"2006.10201","paper":"/paper/on-the-role-of-sparsity-and-dag-constraints","title":"On the Role of Sparsity and DAG Constraints for Learning Linear DAGs","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignavier/golem","path":"src/utils/dir.py","file_url":"https://github.com/ignavier/golem/blob/HEAD/src/utils/dir.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":"dcfefca3872144bb","mcp_get_code":{"code_sha256":"dcfefca3872144bb"}},{"arxiv_id":"1906.02613","paper":"/paper/bad-global-minima-exist-and-sgd-can-reach","title":"Bad Global Minima Exist and SGD Can Reach Them","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chao1224/BadGlobalMinima","path":"cifar10/adversarial_init_main.py","file_url":"https://github.com/chao1224/BadGlobalMinima/blob/HEAD/cifar10/adversarial_init_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cd3e31dc10d45d99","mcp_get_code":{"code_sha256":"cd3e31dc10d45d99"}},{"arxiv_id":"1906.02613","paper":"/paper/bad-global-minima-exist-and-sgd-can-reach","title":"Bad Global Minima Exist and SGD Can Reach Them","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chao1224/BadGlobalMinima","path":"cifar10/random_init_main.py","file_url":"https://github.com/chao1224/BadGlobalMinima/blob/HEAD/cifar10/random_init_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"942fa58cf1a2f02d","mcp_get_code":{"code_sha256":"942fa58cf1a2f02d"}}]}