The reviewed record of science sign in
Pith

arxiv: 2605.10522 · v2 · pith:S55G6T7X · submitted 2026-05-11 · cs.HC

The Balance between Nuance and Clarity: Decluttering Tabular Sequential Graphs to Counter Money Laundering

Salom\'e Esteves , Rita Costa , Louise Fallon , Pedro Bizarro This is my paper

Reviewed by Pith2026-07-04 01:39 UTCgrok-4.3pith:S55G6T7Xopen to challenge →

classification cs.HC
keywords money launderinggraph visualizationtabular sequential graphsnode reductionuser studyfinancial crime analysistransaction flowsdecluttering methods
0
0 comments X

The pith

Tabular sequential graphs for money laundering analysis can be decluttered using amount-based, time-based, or combined groupings, with a user study showing that maximal node reduction does not always yield the most useful views.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a tabular sequential graph visualization for money laundering investigations that arranges banks as rows, accounts as nodes, and transactions as edges, beginning from the victim account that triggered an alert. Three grouping methods are proposed to reduce nodes and edges: one based on transaction amounts, one on timing, and one that combines both factors while respecting sequence. A study with expert analysts found that the method achieving the largest reduction in nodes was not necessarily the most preferred for actual analysis tasks. The work identifies a practical trade-off where more detailed graphs demand extra manual effort but can sometimes support faster or more accurate interpretation.

Core claim

The authors propose structuring money laundering alerts as tabular sequential graphs with banks in rows and accounts linked by transaction edges, then apply three grouping techniques—amount-based aggregation, time-based aggregation, and a hybrid of the two—to simplify the display. Their expert user study reveals that while all three methods reduce visual complexity, the approach with the greatest node reduction does not always align with analysts' preferences for interpretability, underscoring the need to balance clarity from decluttering against the nuance retained in finer-grained representations.

What carries the argument

Tabular sequential graph: a row-per-bank layout with accounts as nodes and transactions as directed edges, reduced via amount-based, time-based, or combined grouping to preserve flow sequence while cutting node count.

If this is right

  • The three grouping methods each achieve measurable decreases in the number of nodes shown to analysts examining transaction sequences.
  • Analysts encounter a trade-off where higher-granularity graphs increase manual work but may reduce overall interpretation time in some cases.
  • The method producing the largest node reduction is not always rated highest for analytical interest by domain experts.
  • Combined amount-and-time grouping offers an intermediate option between the two single-criterion approaches.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Visualization tools for financial crime detection should measure success by analyst preference and task performance rather than node count alone.
  • The grouping approach could be tested on sequential data from related domains such as fraud chains or cross-border payment monitoring.
  • Embedding these decluttered graphs into existing alert systems might reduce analyst fatigue during daily review of mule-account patterns.

Load-bearing premise

The expert user study with a limited set of alerts serves as a reliable indicator of real-world analytical utility and the grouping methods will perform similarly on other money laundering data.

What would settle it

A follow-up study using different alerts or a larger analyst pool in which the highest-reduction grouping is consistently rated most useful with no noted trade-off in effort or interpretation time would undermine the reported balance between reduction and preference.

Figures

Figures reproduced from arXiv: 2605.10522 by Louise Fallon, Pedro Bizarro, Rita Costa, Salom\'e Esteves.

Figure 1
Figure 1. Figure 1: Example of a tabular sequential graph visualization for a synthetic money laundering network before and after the [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The tabular sequential network of synthetic data of a case [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: A meta-node encoding a group of four accounts. [PITH_FULL_IMAGE:figures/full_fig_p003_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Combined node grouping in a synthetic network similar to [PITH_FULL_IMAGE:figures/full_fig_p003_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Time-based node grouping in a synthetic network similar to [PITH_FULL_IMAGE:figures/full_fig_p004_6.png] view at source ↗
read the original abstract

Money laundering is not only about moving illicit funds, but about hiding the money's origin and traces to complicate detection. Financial criminals resort to many methods to avoid regulators and legal thresholds. But analysts investigating alerts, dedicated to pin mule accounts and track suspicious transactions daily, also have theirs. Network visualizations can be key in countering adversarial money laundering activities, especially if they provide a clear overview of the money flows and a seamless analysis experience, but they are often not structured for this type of task. That is why we propose a tabular sequential graph visualization tailored to money laundering analysis - following transactions (edges) from the victim account that triggered an alert through multiple accounts (nodes) and banks (rows). To reduce the number of nodes and edges, we propose three methods for grouping these tabular sequential graphs: an amount-based approach, a time-based approach, and a combined solution that considers both the transaction amount and its order. A user study with experts revealed that the most effective method in node reduction was not necessarily the most interesting for analysis and that there is a trade-off between manual work and time for interpretation in more granular graphs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a tabular sequential graph visualization for money laundering alert analysis that follows transaction sequences from a victim account through accounts (nodes) and banks (rows). It introduces three grouping methods to reduce nodes and edges—an amount-based approach, a time-based approach, and a combined amount-and-order approach—and reports results from an expert user study indicating that the most effective node-reduction method is not necessarily the most analytically interesting, along with a trade-off between manual effort and interpretation time for more granular graphs.

Significance. If the empirical claims hold after proper validation, the work could inform visualization design for sequential financial data in high-stakes domains like AML, by explicitly addressing the nuance-clarity trade-off in analyst workflows. The design proposal itself is a concrete contribution to HCI applied to security.

major comments (2)
  1. [User Study] User Study section: the abstract (and thus the reported evidence) provides no participant count, recruitment criteria, task protocol, operational definitions or measurements of 'effective' versus 'interesting', time/error metrics, or statistical comparisons across the amount-based, time-based, and combined grouping methods. This makes it impossible to evaluate whether the central trade-off claims are supported or whether confounds were controlled.
  2. [Grouping Methods] Grouping Methods section: it is not shown whether the three grouping procedures preserve transaction-sequence semantics (e.g., ordering and connectivity after aggregation), which is load-bearing for the claim that the decluttered graphs remain useful for tracking mule accounts and suspicious flows.
minor comments (2)
  1. The abstract refers to 'tabular sequential graphs' without a concise definition or pointer to the first figure that illustrates the base representation before grouping.
  2. Clarify the exact input data characteristics (number of alerts, typical sequence lengths) used in both the design examples and the user study.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The two major comments identify areas where the current manuscript requires clarification and expansion to better support the claims. We address each point below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [User Study] User Study section: the abstract (and thus the reported evidence) provides no participant count, recruitment criteria, task protocol, operational definitions or measurements of 'effective' versus 'interesting', time/error metrics, or statistical comparisons across the amount-based, time-based, and combined grouping methods. This makes it impossible to evaluate whether the central trade-off claims are supported or whether confounds were controlled.

    Authors: We agree that the abstract omits these details due to length limits and that the User Study section would benefit from greater explicitness. In the revision we will expand the section to report the participant count and recruitment criteria, the complete task protocol, operational definitions and measurement procedures for 'effective' (node-reduction efficiency and flow-tracking accuracy) versus 'interesting' (analyst-rated analytical utility), time and error metrics, and the statistical comparisons performed across the three grouping methods. This will allow readers to evaluate the trade-off claims and assess potential confounds. revision: yes

  2. Referee: [Grouping Methods] Grouping Methods section: it is not shown whether the three grouping procedures preserve transaction-sequence semantics (e.g., ordering and connectivity after aggregation), which is load-bearing for the claim that the decluttered graphs remain useful for tracking mule accounts and suspicious flows.

    Authors: We acknowledge that explicit demonstration of semantic preservation is necessary. The amount-based, time-based, and combined grouping methods aggregate nodes while retaining the original transaction ordering and directed connectivity; paths from the victim account through mule accounts remain traceable because aggregation occurs only among temporally or amount-similar consecutive transactions within the same bank row. In the revised manuscript we will add a dedicated subsection with formal definitions of each procedure and concrete examples illustrating that ordering and connectivity are preserved post-aggregation. revision: yes

Circularity Check

0 steps flagged

No circularity: design proposal plus user study with no derivations or self-referential predictions

full rationale

The paper proposes three grouping methods (amount-based, time-based, combined) for tabular sequential graphs and reports results from an expert user study on node reduction effectiveness versus analytical interest. No equations, fitted parameters, predictions derived from inputs, or self-citations appear in the provided text or abstract. The central claims rest on the empirical user study rather than any derivation chain that reduces to its own inputs by construction. This matches the reader's assessment of zero circularity; the work is self-contained as a visualization design contribution without mathematical self-reference.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No mathematical model, free parameters, axioms, or invented entities are present; the contribution is a visualization design and qualitative user feedback.

pith-pipeline@v0.9.1-grok · 5736 in / 1101 out tokens · 32198 ms · 2026-07-04T01:39:26.726968+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Cambridge Intelligence: data visualization technology. 2

    work page

  2. [2]

    DataWalk: Graph and AI-enabled Analysis, Intelligence and Investi- gation Platform. 2

    work page

  3. [3]

    Neo4j Graph Intelligence Platform, Apr. 2026. 2

    work page 2026

  4. [4]

    B. Bach, N. H. Riche, C. Hurter, K. Marriott, and T. Dwyer. Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization.IEEE transactions on visualization and com- puter graphics, 23(1):541–550, Jan. 2017. doi: 10.1109/TVCG.2016. 2598958 2

    work page doi:10.1109/tvcg.2016 2017

  5. [5]

    Balzer and O

    M. Balzer and O. Deussen. Level-of-detail visualization of clustered graph layouts. In2007 6th International Asia-Pacific Symposium on Visualization, pp. 133–140. IEEE, Sydney, NSW, Feb. 2007. doi: 10. 1109/APVIS.2007.329288 2

    work page arXiv 2007

  6. [6]

    U. Brandes. Drawing on Physical Analogies. In G. Goos, J. Hart- manis, J. Van Leeuwen, M. Kaufmann, and D. Wagner, eds.,Draw- ing Graphs, vol. 2025, pp. 71–86. Springer Berlin Heidelberg, Berlin, Heidelberg, 2001. Series Title: Lecture Notes in Computer Science. doi: 10.1007/3-540-44969-8 4 1

    work page doi:10.1007/3-540-44969-8 2025

  7. [7]

    Contreras and E

    A. Contreras and E. Villa P ´erez. Strategic choices in money launder- ing: Smurfing, layering, and financial over-diversification.Journal of Economic Criminology, 11:100199, Mar. 2026. doi: 10.1016/j.jeconc .2025.100199 1

    work page doi:10.1016/j.jeconc 2026

  8. [8]

    W. Dong, X. Fu, G. Xu, and Y . Huang. An improved force-directed graph layout algorithm based on aesthetic criteria.Computing and Visualization in Science, 16(3):139–149, June 2013. doi: 10.1007/ s00791-014-0228-5 1

    work page 2013

  9. [9]

    D. Edge, J. Larson, M. Mobius, and C. White. Trimming the Hairball: Edge Cutting Strategies for Making Dense Graphs Usable. In2018 IEEE International Conference on Big Data (Big Data), pp. 3951–

    work page

  10. [10]

    IEEE, Seattle, W A, USA, Dec. 2018. doi: 10.1109/BigData. 2018.8622521 2

    work page doi:10.1109/bigdata 2018

  11. [11]

    B. E. Feliciano.Increasing Readability of Large Networks Visualiza- tions. PhD thesis, Instituto Superior T´ecnico, Universidade de Lisboa,

    work page

  12. [12]

    Filipov, A

    V . Filipov, A. Arleo, and S. Miksch. Are We There Yet? A Roadmap of Network Visualization from Surveys to Task Taxonomies.Com- puter Graphics Forum, 42(6):e14794, Sept. 2023. doi: 10.1111/cgf. 14794 2

    work page doi:10.1111/cgf 2023

  13. [13]

    P. M. Gilmour. Reexamining the anti-money-laundering framework: a legal critique and new approach to combating money laundering. Journal of Financial Crime, 30(1):35–47, Mar. 2022. doi: 10.1108/ JFC-02-2022-0041 1

    work page 2022

  14. [14]

    Halford, I

    E. Halford, I. Gibson, M. Newfield, and M. Dhanwala. Developing a scoring model for managing money laundering transactions using machine learning.Journal of Money Laundering Control, 28(7):30– 49, Mar. 2025. doi: 10.1108/JMLC-09-2024-0152 1

    work page doi:10.1108/jmlc-09-2024-0152 2025

  15. [15]

    Huang, P

    W. Huang, P. Eades, and S.-H. Hong. Measuring Effectiveness of Graph Visualizations: A Cognitive Load Perspective.Information Vi- sualization, 8(3):139–152, Sept. 2009. Publisher: SAGE Publications. doi: 10.1057/ivs.2009.10 1

    work page doi:10.1057/ivs.2009.10 2009

  16. [16]

    Huang, P

    W. Huang, P. Eades, S.-H. Hong, and C.-C. Lin. Improving multiple aesthetics produces better graph drawings.Journal of Visual Lan- guages & Computing, 24(4):262–272, Aug. 2013. doi: 10.1016/j.jvlc .2011.12.002 1

    work page doi:10.1016/j.jvlc 2013

  17. [17]

    H. C. Purchase, D. Carrington, and J.-A. Allder. Empirical Evaluation of Aesthetics-based Graph Layout.Empirical Software Engineering, 7(3):233–255, Sept. 2002. doi: 10.1023/A:1016344215610 2

    work page doi:10.1023/a:1016344215610 2002

  18. [18]

    Saket, P

    B. Saket, P. Simonetto, S. Kobourov, and K. B ¨orner. Node, Node- Link, and Node-Link-Group Diagrams: An Evaluation.IEEE Trans- actions on Visualization and Computer Graphics, 20(12):2231–2240, Dec. 2014. doi: 10.1109/TVCG.2014.2346422 2

    work page doi:10.1109/tvcg.2014.2346422 2014

  19. [19]

    Shadrooh and K

    S. Shadrooh and K. Nørv ˚ag. SMoTeF: Smurf money laundering de- tection using temporal order and flow analysis.Applied Intelligence, 54(15):7461–7478, Aug. 2024. doi: 10.1007/s10489-024-05545-4 1

    work page doi:10.1007/s10489-024-05545-4 2024

  20. [20]

    Shneiderman and C

    B. Shneiderman and C. Dunne. Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification. In W. Didimo and M. Patrignani, eds.,Graph Drawing, pp. 2–18. Springer, Berlin, Heidelberg, 2013. doi: 10.1007/978-3-642-36763 -2 2 2

    work page doi:10.1007/978-3-642-36763 2013

  21. [21]

    Teichmann

    F. Teichmann. Recent trends in money laundering.Crime, Law and Social Change, 73(2):237–247, Mar. 2020. doi: 10.1007/s10611-019 -09859-0 1

    work page doi:10.1007/s10611-019 2020

  22. [22]

    Vehlow, F

    C. Vehlow, F. Beck, and D. Weiskopf. Visualizing Group Structures in Graphs: A Survey.Computer Graphics Forum, 36(6):201–225, 2017. eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.12872. doi: 10.1111/cgf.12872 2

    work page doi:10.1111/cgf.12872 2017

  23. [23]

    Y . Wang, G. Baciu, and C. Li. Visualizing the Temporal Similarity Between Clusters of Dynamic Graphs. In2019 IEEE 18th Interna- tional Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), pp. 205–210, July 2019. doi: 10.1109/ICCICC46617. 2019.9146098 2

    work page doi:10.1109/iccicc46617 2019

  24. [24]

    Ware and R

    C. Ware and R. Bobrow. Motion to support rapid interactive queries on node–link diagrams.ACM Trans. Appl. Percept., 1(1):3–18, July

    work page

  25. [25]

    doi: 10.1145/1008722.1008724 1

    work page doi:10.1145/1008722.1008724