Metraipolis › archive › dc_5749d493cfdc
KONTOGRAPH: Verified Point-in-Time Feature Consistency and Amortised Explanation for Real-Time Anti-Money Laundering under a 200 ms Decision Budget — arXiv:2608.22389
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22389
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T07:44:50.623Z
- SHA-256 of the archived text
fc7d80d294b9f1eed81b89852a5725e07a59b1ba468d0beae4571ba133656831- Stable URL of this page
https://metraipolis.com/documento/dc_5749d493cfdc
How to cite
KONTOGRAPH: Verified Point-in-Time Feature Consistency and Amortised Explanation for Real-Time Anti-Money Laundering under a 200 ms Decision Budget — arXiv:2608.22389 — arXiv (en), https://arxiv.org/abs/2608.22389 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5749d493cfdc (Metraipolis archive dc_5749d493cfdc, sha256 fc7d80d294b9f1eed81b89852a5725e07a59b1ba468d0beae4571ba133656831)
BibTeX
@misc{dc5749d493cfdc,
title = {KONTOGRAPH: Verified Point-in-Time Feature Consistency and Amortised Explanation for Real-Time Anti-Money Laundering under a 200 ms Decision Budget — arXiv:2608.22389},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22389},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5749d493cfdc; sha256 fc7d80d294b9f1eed81b89852a5725e07a59b1ba468d0beae4571ba133656831},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22389. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Regulation (EU) 2024/886 obliges European payment service providers to settle euro credit transfers in under ten seconds, around the clock. This removes both the overnight batch window in which anti-money-laundering (AML) analytics traditionally ran and the settlement delay that made recovery possible, forcing detection, explanation and decision inside a single-digit-second envelope. We present KONTOGRAPH, an end-to-end AML pipeline for the SEPA Instant rail built under a self-imposed 200 ms 99th-percentile budget, and report an empirical study on 1,562,860 simulated payments with injected typologies and deliberately incomplete labels. Three findings are of interest beyond the system itself. First, a temporal graph network with per-node memory improves PR-AUC over a gradient-boosted tabular baseline from 0.0053 to 0.1717, a paired day-blocked bootstrap difference of +0.166 with 95% CI [0.105, 0.241]; per-node memory alone more than doubles the score. Second, expressing each feature once and compiling it to three execution backends, with equivalence enforced by property-based tests that perturb the future, surfaced three point-in-time violations that code review had passed--each of which would have inflated reported performance. Third, and most consequential for practice, exporting the deployed tree ensemble to ONNX changed only $7.4 \times 10^{-8}$ in mean score yet altered 0.26% of decisions and inflated the alert volume by 12%, because 32-bit accumulation perturbs scores across a cost-optimal threshold of $3.98 \times 10^{-4}$. We argue that a serving-format conversion must be treated as a model change until measured, and that fidelity metrics for subgraph explainers can be vacuous when candidate neighbourhoods are small--a null result we report in full.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-25 in cs.AI).
Categorie arXiv: Cryptography and Security (cs.CR) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2608.22389 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T07:37:52.877Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).