{"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/antibenford-subgraphs-unsupervised-anomaly","title":"AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks","arxiv_id":"2205.13426","date":"2022-05-26","proceeding":null,"authors":["Tianyi Chen","Charalampos E. Tsourakakis"],"abstract":"Benford's law describes the distribution of the first digit of numbers appearing in a wide variety of numerical data, including tax records, and election outcomes, and has been used to raise \"red flags\" about potential anomalies in the data such as tax evasion. In this work, we ask the following novel question: given a large transaction or financial graph, how do we find a set of nodes that perform many transactions among each other that also deviate significantly from Benford's law? We propose the AntiBenford subgraph framework that is founded on well-established statistical principles. Furthermore, we design an efficient algorithm that finds AntiBenford subgraphs in near-linear time on real data. We evaluate our framework on both real and synthetic data against a variety of competitors. We show empirically that our proposed framework enables the detection of anomalous subgraphs in cryptocurrency transaction networks that go undetected by state-of-the-art graph-based anomaly detection methods. Our empirical findings show that our \\ab framework is able to mine anomalous subgraphs, and provide novel insights into financial transaction data. The code and the datasets are available at \\url{https://github.com/tsourakakis-lab/antibenford-subgraphs}.","url_abs":"https://arxiv.org/abs/2205.13426v1","url_pdf":"https://arxiv.org/pdf/2205.13426v1.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":"antibenford-subgraphs-unsupervised-anomaly","repo_url":"https://github.com/tsourakakis-lab/antibenford-subgraphs","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=2205.13426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13426"}},"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/tsourakakis-lab/antibenford-subgraphs","reach":null}],"summary":{"ran_draft_wrong":2},"by_repo_kind":{"official":{"samples":2,"ran":2,"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":2,"samples":[{"code_sha256_prefix":"ba88d9a3495c0b27","entry":"count_occ","repo":"tsourakakis-lab/antibenford-subgraphs","repo_kind":"official","path":"peel_by_motif.py","file_url":"https://github.com/tsourakakis-lab/antibenford-subgraphs/blob/HEAD/peel_by_motif.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ba88d9a3495c0b27"}},{"code_sha256_prefix":"2a928081ff378ce7","entry":"peel_by_motif","repo":"tsourakakis-lab/antibenford-subgraphs","repo_kind":"official","path":"peel_by_motif.py","file_url":"https://github.com/tsourakakis-lab/antibenford-subgraphs/blob/HEAD/peel_by_motif.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":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2a928081ff378ce7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}