{"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/cal-sisnri","entry":"cal_SISNRi","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":5,"n_papers_ran":5,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2007.13975","paper":"/paper/dual-path-transformer-network-direct-context-1","title":"Dual-Path Transformer Network: Direct Context-Aware Modeling for End-to-End Monaural Speech Separation","date":null,"month_inferred_from_arxiv_id":"2020-07","title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b19791aa06bb7b9b","mcp_get_code":{"code_sha256":"b19791aa06bb7b9b"}},{"arxiv_id":"2003.01531","paper":"/paper/voice-separation-with-an-unknown-number-of","title":"Voice Separation with an Unknown Number of Multiple Speakers","date":"2020-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mack189/gdprnn","path":"evaluate.py","file_url":"https://github.com/Mack189/gdprnn/blob/HEAD/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ca6c3339d98f2a2c","mcp_get_code":{"code_sha256":"ca6c3339d98f2a2c"}},{"arxiv_id":"1910.14104","paper":"/paper/end-to-end-microphone-permutation-and-number","title":"End-to-end Microphone Permutation and Number Invariant Multi-channel Speech Separation","date":"2019-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b19791aa06bb7b9b","mcp_get_code":{"code_sha256":"b19791aa06bb7b9b"}},{"arxiv_id":"1910.06379","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":"lyqcom/dprnn","path":"src/evaluate.py","file_url":"https://github.com/lyqcom/dprnn/blob/HEAD/src/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b19791aa06bb7b9b","mcp_get_code":{"code_sha256":"b19791aa06bb7b9b"}},{"arxiv_id":"1809.07454","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":"kaituoxu/Conv-TasNet","path":"src/evaluate.py","file_url":"https://github.com/kaituoxu/Conv-TasNet/blob/HEAD/src/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b19791aa06bb7b9b","mcp_get_code":{"code_sha256":"b19791aa06bb7b9b"}},{"arxiv_id":"1809.07454","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":"xiaolianggeitazgh/Conv-Tasnet","path":"evaluate.py","file_url":"https://github.com/xiaolianggeitazgh/Conv-Tasnet/blob/HEAD/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ca6c3339d98f2a2c","mcp_get_code":{"code_sha256":"ca6c3339d98f2a2c"}}]}