{"paper_id":"2309.13662","title":"Topology-Agnostic Detection of Temporal Money Laundering Flows in Billion-Scale Transactions","authors":["Haseeb Tariq","Marwan Hassani"],"paper_date":"2023-09-24","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2309.13662v1","page_url":"https://thequant.space/flowcharts/topology-agnostic-detection-of-temporal-money-laundering-flo/","scores":{"empirical_rigor":8.5,"math_complexity":6.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes FaSTMAN, a framework that builds a temporal graph of sequential transactions with a novel weighting method to detect suspicious money flows.","quote":"We propose a framework (called FaSTMAN), adapted for domain-specific constraints, to efficiently construct a temporal graph of sequential transactions.","summary":"Money launderers exploit the weaknesses in detection systems by purposefully placing their ill-gotten money into multiple accounts, at different banks. That money is then layered and moved around among mule accounts to obscure the origin and the flow of transactions. Consequently, the money is…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Adding the time dimension to the transaction graph could explode the space complexity.","type":"model","stated":"explicit","quote":"We show that adding the time dimension to the transaction graph could explode the space complexity."},{"assumption":"Higher‑order (beyond 2nd) graph representations are not considered.","type":"model","stated":"explicit","quote":"For our experiments, we did not consider higher (than 2nd) order (3rd, 4th, ..., nth); or multi-order representations."},{"assumption":"The framework can generate the temporal graph in a distributed manner and instantly jump to a point in time.","type":"execution","stated":"explicit","quote":"FaSTM∀N enables us to generate the temporal graph in a distributed manner; and to instantly jump to a point in time in the graph."},{"assumption":"FlowScope can produce all flows detected by FaSTM∀N if run multiple times with different k values.","type":"other","stated":"explicit","quote":"We will assume that it can produce all the flows detected by FaSTM∀N, after running it multiple times with different values of k."},{"assumption":"Filtering out the top 0.0001% most highly‑connected accounts does not remove critical suspicious flows.","type":"data","stated":"explicit","quote":"We only do that for the top 0.0001% accounts. This results in a reduction of the actual dataset of 1.1 billion transactions, to around 510 million transactions."}]},"datasets":{"status":"available","items":[{"name":"1.1 billion transactions from 5 large Dutch banks","provider":"5 large Dutch banks","kind":"alternative","access":"proprietary","period":null,"universe":null,"quote":"Our dataset includes around 1.1 billion transactions from 5 large Dutch banks."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"forecast-accuracy","findings":[{"finding":"FaSTM∀N outperforms two state‑of‑the‑art AML approaches in both scalability and effectiveness.","kind":"performance","quote":"Extensive experimental evaluation with two state-of-the-art AML approaches have proved the superiority of FaSTM∀N in terms of scalability and effectiveness."},{"finding":"Filtering to the top 0.0001% highly‑connected accounts reduces the dataset from 1.1 billion to about 510 million transactions.","kind":"other","quote":"We only do that for the top 0.0001% accounts. This results in a reduction of the actual dataset of 1.1 billion transactions, to around 510 million transactions."}],"reported_performance":null,"out_of_sample":{"method":"unclear","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":10,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/mhaseebtariq/fastman","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:21:39Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}