{"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":"/paper/efficient-attention-branch-network-with","title":"Efficient Attention Branch Network with Combined Loss Function for Automatic Speaker Verification Spoof Detection","arxiv_id":"2109.02051","date":"2021-09-05","proceeding":null,"authors":["Amir Mohammad Rostami","Mohammad Mehdi Homayounpour","Ahmad Nickabadi"],"abstract":"Many endeavors have sought to develop countermeasure techniques as enhancements on Automatic Speaker Verification (ASV) systems, in order to make them more robust against spoof attacks. As evidenced by the latest ASVspoof 2019 countermeasure challenge, models currently deployed for the task of ASV are, at their best, devoid of suitable degrees of generalization to unseen attacks. Upon further investigation of the proposed methods, it appears that a broader three-tiered view of the proposed systems. comprised of the classifier, feature extraction phase, and model loss function, may to some extent lessen the problem. Accordingly, the present study proposes the Efficient Attention Branch Network (EABN) modular architecture with a combined loss function to address the generalization problem...","url_abs":"https://arxiv.org/abs/2109.02051v2","url_pdf":"https://arxiv.org/pdf/2109.02051v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"efficient-attention-branch-network-with","repo_url":"https://github.com/AmirmohammadRostami/ASV-anti-spoofing-with-EABN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"speaker-verification","task_name":"Speaker Verification"},{"task_slug":"spoof-detection","task_name":"Spoof Detection"},{"task_slug":"voice-anti-spoofing","task_name":"Voice Anti-spoofing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/spoof-detection-on-asvspoof-2019-la","task":"Spoof Detection","dataset":"ASVspoof 2019 - LA","model":"Proposed: LFCC+SE-ResABNet+CombLoss","rank_in_archive_order":1,"of":1,"metrics":{"EER":"1.89","t-DCF":"0.0507"},"uses_additional_data":false},{"leaderboard":"/sota/spoof-detection-on-asvspoof-2019-pa","task":"Spoof Detection","dataset":"ASVspoof 2019 - PA","model":"Proposed: logPowSpec+EABNet+CombLoss","rank_in_archive_order":1,"of":1,"metrics":{"EER":"0.86","t-DCF":"0.0239"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"AmirmohammadRostami/ASV-anti-spoofing-with-EABN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.05441"],"harvested_for_calls":[{"arxiv_id":"1904.05441","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.05441"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.05441\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0767c8a20f9f77df3ae520927a1afe861e57110742aaf115c1c5c59412f967f8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}