{"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/overlap-and-add","entry":"overlap_and_add","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-25T09:33:49+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":8,"n_papers_ran":7,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":1},"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":"2603.14889","paper":"/paper/arxiv-2603-14889","title":"SDiaReward: Modeling and Benchmarking Spoken Dialogue Rewards with Modality and Colloquialness","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Anjok07/ultimatevocalremovergui","path":"demucs/tasnet.py","file_url":"https://github.com/Anjok07/ultimatevocalremovergui/blob/HEAD/demucs/tasnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6fc6cdb0729e7905","mcp_get_code":{"code_sha256":"6fc6cdb0729e7905"}},{"arxiv_id":"2211.08553","paper":"/paper/hybrid-transformers-for-music-source","title":"Hybrid Transformers for Music Source Separation","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaozhipeng1997/demucs_ascend910_pytorch","path":"demucs/tasnet.py","file_url":"https://github.com/zhaozhipeng1997/demucs_ascend910_pytorch/blob/HEAD/demucs/tasnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"6fc6cdb0729e7905","mcp_get_code":{"code_sha256":"6fc6cdb0729e7905"}},{"arxiv_id":"2204.04288","paper":"/paper/unsupervised-uncertainty-measures-of","title":"Unsupervised Uncertainty Measures of Automatic Speech Recognition for Non-intrusive Speech Intelligibility Prediction","date":"2022-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"claritychallenge/clarity","path":"clarity/enhancer/dnn/mc_conv_tasnet.py","file_url":"https://github.com/claritychallenge/clarity/blob/HEAD/clarity/enhancer/dnn/mc_conv_tasnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"50c02c7ebbb9d3b0","mcp_get_code":{"code_sha256":"50c02c7ebbb9d3b0"}},{"arxiv_id":"2103.00819","paper":"/paper/sandglasset-a-light-multi-granularity-self","title":"Sandglasset: A Light Multi-Granularity Self-attentive Network For Time-Domain Speech Separation","date":"2021-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SoulProficiency/speechseparation-Sandglasset","path":"Sandglasset.py","file_url":"https://github.com/SoulProficiency/speechseparation-Sandglasset/blob/HEAD/Sandglasset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a65ff6d7fe19c9c8","mcp_get_code":{"code_sha256":"a65ff6d7fe19c9c8"}},{"arxiv_id":"2101.05014","paper":"/paper/effective-low-cost-time-domain-audio","title":"Effective Low-Cost Time-Domain Audio Separation Using Globally Attentive Locally Recurrent Networks","date":"2021-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"a65ff6d7fe19c9c8","mcp_get_code":{"code_sha256":"a65ff6d7fe19c9c8"}},{"arxiv_id":"2007.06833","paper":"/paper/sudo-rm-rf-efficient-networks-for-universal","title":"Sudo rm -rf: Efficient Networks for Universal Audio Source Separation","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"etzinis/sudo_rm_rf","path":"sudo_rm_rf/dnn/models/dprnn.py","file_url":"https://github.com/etzinis/sudo_rm_rf/blob/HEAD/sudo_rm_rf/dnn/models/dprnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7f1cfe9c1b6a1aa","mcp_get_code":{"code_sha256":"e7f1cfe9c1b6a1aa"}},{"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":"muhammad-ahmed-ghani/svoice_demo","path":"svoice/models/swave.py","file_url":"https://github.com/muhammad-ahmed-ghani/svoice_demo/blob/HEAD/svoice/models/swave.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"9c926905c0e7a1c7","mcp_get_code":{"code_sha256":"9c926905c0e7a1c7"}},{"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":"IliasDG/Demucs_Project","path":"demucs/tasnet.py","file_url":"https://github.com/IliasDG/Demucs_Project/blob/HEAD/demucs/tasnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"6fc6cdb0729e7905","mcp_get_code":{"code_sha256":"6fc6cdb0729e7905"}}]}