{"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/autoaudit-mining-accounting-and-time-evolving","title":"AutoAudit: Mining Accounting and Time-Evolving Graphs","arxiv_id":"2011.00447","date":"2020-11-01","proceeding":null,"authors":["Meng-Chieh Lee","Yue Zhao","Aluna Wang","Pierre Jinghong Liang","Leman Akoglu","Vincent S. Tseng","Christos Faloutsos"],"abstract":"How can we spot money laundering in large-scale graph-like accounting datasets? How to identify the most suspicious period in a time-evolving accounting graph? What kind of accounts and events should practitioners prioritize under time constraints? To tackle these crucial challenges in accounting and auditing tasks, we propose a flexible system called AutoAudit, which can be valuable for auditors and risk management professionals. To sum up, there are four major advantages of the proposed system: (a) \"Smurfing\" Detection, spots nearly 100% of injected money laundering transactions automatically in real-world datasets. (b) Attention Routing, attends to the most suspicious part of time-evolving graphs and provides an intuitive interpretation. (c) Insight Discovery, identifies similar month-pair patterns proved by \"success stories\" and patterns following Power Laws in log-logistic scales. (d) Scalability and Generality, ensures AutoAudit scales linearly and can be easily extended to other real-world graph datasets. Experiments on various real-world datasets illustrate the effectiveness of our method. To facilitate reproducibility and accessibility, we make the code, figure, and results public at https://github.com/mengchillee/AutoAudit.","url_abs":"https://arxiv.org/abs/2011.00447v1","url_pdf":"https://arxiv.org/pdf/2011.00447v1.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":"autoaudit-mining-accounting-and-time-evolving","repo_url":"https://github.com/mengchillee/AutoAudit","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2011.00447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.00447"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mengchillee/AutoAudit","reach":null}],"summary":{"ran_draft_wrong":3,"ran_honours":2,"unverified":1},"by_repo_kind":{"official":{"samples":6,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"916af25d17cde7b2","entry":"compute_mdl","repo":"mengchillee/AutoAudit","repo_kind":"official","path":"AA-Smurf.py","file_url":"https://github.com/mengchillee/AutoAudit/blob/HEAD/AA-Smurf.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"916af25d17cde7b2"}},{"code_sha256_prefix":"622e802febd702f4","entry":"edgelist_to_matrix","repo":"mengchillee/AutoAudit","repo_kind":"official","path":"AA-Smurf.py","file_url":"https://github.com/mengchillee/AutoAudit/blob/HEAD/AA-Smurf.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"622e802febd702f4"}},{"code_sha256_prefix":"6e4acc6b5ee45520","entry":"generate_features","repo":"mengchillee/AutoAudit","repo_kind":"official","path":"AA-AR.py","file_url":"https://github.com/mengchillee/AutoAudit/blob/HEAD/AA-AR.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"6e4acc6b5ee45520"}},{"code_sha256_prefix":"bdf9e50f941385d9","entry":"log_star","repo":"mengchillee/AutoAudit","repo_kind":"official","path":"AA-Smurf.py","file_url":"https://github.com/mengchillee/AutoAudit/blob/HEAD/AA-Smurf.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"bdf9e50f941385d9"}},{"code_sha256_prefix":"b23eb380185ba45d","entry":"total_mean_median_variance","repo":"mengchillee/AutoAudit","repo_kind":"official","path":"AA-AR.py","file_url":"https://github.com/mengchillee/AutoAudit/blob/HEAD/AA-AR.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"b23eb380185ba45d"}},{"code_sha256_prefix":"69177b49c6b7a224","entry":"generate_isolation_forest","repo":"mengchillee/AutoAudit","repo_kind":"official","path":"AA-AR.py","file_url":"https://github.com/mengchillee/AutoAudit/blob/HEAD/AA-AR.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"69177b49c6b7a224"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}