{"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":"/paper/on-the-formalization-of-asynchronous-first","title":"On the formalization of Asynchronous First Passage Algorithms","arxiv_id":"1903.06040","date":"2019-03-14","proceeding":null,"authors":["Luigi Sbailò","Luigi Delle Site"],"abstract":"The formalization of First Passage schemes is revisited and the emerging of a conceptual contradiction is underlined. We then show why, despite such a contradiction, the numerical results are not explicitly affected. Through a different formalization of the problem, we recast the current principles of the algorithm in a more solid conceptual framework, and numerical evidence gives further justification to our claims.","url_abs":"http://arxiv.org/abs/1903.06040v1","url_pdf":"http://arxiv.org/pdf/1903.06040v1.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"on-the-formalization-of-asynchronous-first","repo_url":"https://github.com/luigisbailo/paper_formalization_first_passage","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}