{"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/create-model-and-transforms","entry":"create_model_and_transforms","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":8,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"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":0,"ran_fixture":0,"ran":0,"unverified":7},"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.30107","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30107","title":"Dial HEALTHDIAL for Advice: A Multilingual and Multi-Parallel Spoken Dialogue Dataset for Knowledge-Grounded Information Seeking","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"LAION-AI/CLAP","path":"src/laion_clap/clap_module/factory.py","file_url":"https://github.com/LAION-AI/CLAP/blob/HEAD/src/laion_clap/clap_module/factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a7b593a493f3ce9","code_sha256_prefix":"9a7b593a493f3ce9","mcp_get_code":{"code_sha256":"9a7b593a493f3ce9"}},{"arxiv_id":"2409.12346","arxiv_id_is_arxiv":true,"paper":"/paper/simultaneous-music-separation-and-generation","title":"Simultaneous Music Separation and Generation Using Multi-Track Latent Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":"archive","repo":"karchkha/msg-ld","path":"src/clap/clap_module/factory.py","file_url":"https://github.com/karchkha/msg-ld/blob/HEAD/src/clap/clap_module/factory.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, karchkha/msg-ld when it was checked","code_sha256":"3b5ea3b8b68cead1","code_sha256_prefix":"3b5ea3b8b68cead1","mcp_get_code":{"code_sha256":"3b5ea3b8b68cead1"}},{"arxiv_id":"2405.18503","arxiv_id_is_arxiv":true,"paper":"/paper/soundctm-uniting-score-based-and-consistency","title":"SoundCTM: Unifying Score-based and Consistency Models for Full-band Text-to-Sound Generation","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/soundctm","path":"clap/clap_module/factory.py","file_url":"https://github.com/sony/soundctm/blob/HEAD/clap/clap_module/factory.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":"bfdd273dab42b860","code_sha256_prefix":"bfdd273dab42b860","mcp_get_code":{"code_sha256":"bfdd273dab42b860"}},{"arxiv_id":"2404.01740","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-audio-separation-via-bi","title":"Weakly-supervised Audio Separation via Bi-modal Semantic Similarity","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/BiModalAudioSeparation","path":"models/laion_clap/clap_module/factory.py","file_url":"https://github.com/microsoft/BiModalAudioSeparation/blob/HEAD/models/laion_clap/clap_module/factory.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":"ffdbb019791354d1","code_sha256_prefix":"ffdbb019791354d1","mcp_get_code":{"code_sha256":"ffdbb019791354d1"}},{"arxiv_id":"2311.08400","arxiv_id_is_arxiv":true,"paper":"/paper/towards-open-ended-visual-recognition-with","title":"Towards Open-Ended Visual Recognition with Large Language Model","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/omniscient-model","path":"modeling/factory.py","file_url":"https://github.com/bytedance/omniscient-model/blob/HEAD/modeling/factory.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":"fe4015e19e980ffa","code_sha256_prefix":"fe4015e19e980ffa","mcp_get_code":{"code_sha256":"fe4015e19e980ffa"}},{"arxiv_id":"2308.01546","arxiv_id_is_arxiv":true,"paper":"/paper/musicldm-enhancing-novelty-in-text-to-music","title":"MusicLDM: Enhancing Novelty in Text-to-Music Generation Using Beat-Synchronous Mixup Strategies","date":"2023-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"retrocirce/musicldm","path":"interface/src/clap/clap_module/factory.py","file_url":"https://github.com/retrocirce/musicldm/blob/HEAD/interface/src/clap/clap_module/factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, retrocirce/musicldm (NOASSERTION)","code_sha256":"9d666bfa7fed3edc","code_sha256_prefix":"9d666bfa7fed3edc","mcp_get_code":{"code_sha256":"9d666bfa7fed3edc"}},{"arxiv_id":"2305.04790","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-gpt-a-vision-and-language-model","title":"MultiModal-GPT: A Vision and Language Model for Dialogue with Humans","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-mmlab/multimodal-gpt","path":"mmgpt/models/builder.py","file_url":"https://github.com/open-mmlab/multimodal-gpt/blob/HEAD/mmgpt/models/builder.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":"313e8929699104dc","code_sha256_prefix":"313e8929699104dc","mcp_get_code":{"code_sha256":"313e8929699104dc"}},{"arxiv_id":"02233","arxiv_id_is_arxiv":false,"paper":null,"title":"id 02233 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bytedance/OmniScient-Model","path":"modeling/factory.py","file_url":"https://github.com/bytedance/OmniScient-Model/blob/HEAD/modeling/factory.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":"fe4015e19e980ffa","code_sha256_prefix":"fe4015e19e980ffa","mcp_get_code":{"code_sha256":"fe4015e19e980ffa"}}],"record_sha256":"16a19504165a6253461e1af6cae4f12aa08faa247d18774c720d687eec7dd4c6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}