{"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/select-norm","entry":"select_norm","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":0,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1,"ran":0,"unverified":0},"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":"2502.16611","arxiv_id_is_arxiv":true,"paper":"/paper/target-speaker-extraction-through-comparing","title":"Target Speaker Extraction through Comparing Noisy Positive and Negative Audio Enrollments","date":"2025-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZBang/USEF-TSE","path":"models/model_USEF_SepFormer.py","file_url":"https://github.com/ZBang/USEF-TSE/blob/HEAD/models/model_USEF_SepFormer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","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, ZBang/USEF-TSE (NOASSERTION)","code_sha256":"d2378f0385cb8d5c","code_sha256_prefix":"d2378f0385cb8d5c","mcp_get_code":{"code_sha256":"d2378f0385cb8d5c"}},{"arxiv_id":"2312.11825","arxiv_id_is_arxiv":true,"paper":"/paper/mossformer2-combining-transformer-and-rnn-1","title":"MossFormer2: Combining Transformer and RNN-Free Recurrent Network for Enhanced Time-Domain Monaural Speech Separation","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"modelscope/ClearerVoice-Studio","path":"clearvoice/clearvoice/models/mossformer2_se/mossformer2.py","file_url":"https://github.com/modelscope/ClearerVoice-Studio/blob/HEAD/clearvoice/clearvoice/models/mossformer2_se/mossformer2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f09be5e5c3deb5d","code_sha256_prefix":"7f09be5e5c3deb5d","mcp_get_code":{"code_sha256":"7f09be5e5c3deb5d"}},{"arxiv_id":"2302.11824","arxiv_id_is_arxiv":true,"paper":"/paper/mossformer-pushing-the-performance-limit-of","title":"MossFormer: Pushing the Performance Limit of Monaural Speech Separation using Gated Single-Head Transformer with Convolution-Augmented Joint Self-Attentions","date":"2023-02-23","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":"7f09be5e5c3deb5d","code_sha256_prefix":"7f09be5e5c3deb5d","mcp_get_code":{"code_sha256":"7f09be5e5c3deb5d"}},{"arxiv_id":"2002.08688","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-conv-tasnet","title":"An empirical study of Conv-TasNet","date":"2020-02-20","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":"fd365b69d72fe0c9","code_sha256_prefix":"fd365b69d72fe0c9","mcp_get_code":{"code_sha256":"fd365b69d72fe0c9"}},{"arxiv_id":"1910.06379","arxiv_id_is_arxiv":true,"paper":"/paper/dual-path-rnn-efficient-long-sequence","title":"Dual-path RNN: efficient long sequence modeling for time-domain single-channel speech separation","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JusperLee/Dual-Path-RNN-Pytorch","path":"model/model_rnn.py","file_url":"https://github.com/JusperLee/Dual-Path-RNN-Pytorch/blob/HEAD/model/model_rnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7a32d1e19ee3c3c","code_sha256_prefix":"d7a32d1e19ee3c3c","mcp_get_code":{"code_sha256":"d7a32d1e19ee3c3c"}},{"arxiv_id":"1809.07454","arxiv_id_is_arxiv":true,"paper":"/paper/tasnet-surpassing-ideal-time-frequency","title":"Conv-TasNet: Surpassing Ideal Time-Frequency Magnitude Masking for Speech Separation","date":"2018-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JusperLee/Conv-TasNet","path":"Conv_TasNet_Pytorch/Conv_TasNet.py","file_url":"https://github.com/JusperLee/Conv-TasNet/blob/HEAD/Conv_TasNet_Pytorch/Conv_TasNet.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, JusperLee/Conv-TasNet when it was checked","code_sha256":"fd365b69d72fe0c9","code_sha256_prefix":"fd365b69d72fe0c9","mcp_get_code":{"code_sha256":"fd365b69d72fe0c9"}}],"record_sha256":"b09811b6e5a932a4ab497fea79b6cf53966a22c506b508d5d6ad75b492559ebb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}