{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","short_pith_number":"pith:S55G6T7X","canonical_record":{"source":{"id":"2605.10522","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-11T13:09:33Z","cross_cats_sorted":[],"title_canon_sha256":"a17435da6baa5136be10095816e4e23ef75a652fdadf40acf2414c3fffd44e5c","abstract_canon_sha256":"87aeff40428ef66c26a4f3b1bfeba6a720fc7a96a6ae67eef8e1576e2c075e41"},"schema_version":"1.0"},"canonical_sha256":"977a6f4ff7538db2d3114fc8127232b43a74466108d9cc6ed9ad06dfc2114eed","source":{"kind":"arxiv","id":"2605.10522","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10522","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10522v2","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10522","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"S55G6T7XKOG3","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"pith_short_16","alias_value":"S55G6T7XKOG3FUYR","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"pith_short_8","alias_value":"S55G6T7X","created_at":"2026-07-03T01:17:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.10522","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-11T13:09:33Z","cross_cats_sorted":[],"title_canon_sha256":"a17435da6baa5136be10095816e4e23ef75a652fdadf40acf2414c3fffd44e5c","abstract_canon_sha256":"87aeff40428ef66c26a4f3b1bfeba6a720fc7a96a6ae67eef8e1576e2c075e41"},"schema_version":"1.0"},"canonical_sha256":"977a6f4ff7538db2d3114fc8127232b43a74466108d9cc6ed9ad06dfc2114eed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:21.334992Z","signature_b64":"irYq4ExhsIHlmBGezXulLDF8mYjyv9n3j3Rsw7NbBRjvpNGkgbf0HdB9/fX4FIfNya0cH2emKXsKsNG+TFjWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977a6f4ff7538db2d3114fc8127232b43a74466108d9cc6ed9ad06dfc2114eed","last_reissued_at":"2026-07-03T01:17:21.334523Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:21.334523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.10522","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T01:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usC8npFXMj1XYojAaKDvOailv9WNGRY/2/3huKQRFyAVX4Vwg2lTCNuk9CpZ26kPExGjfpPxkQfw7UJxsjbTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:29:24.624521Z"},"content_sha256":"3f71b72c9a77ccda76a7518bd122300ea8279c02da927507afd40607b4ebed3f","schema_version":"1.0","event_id":"sha256:3f71b72c9a77ccda76a7518bd122300ea8279c02da927507afd40607b4ebed3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Balance between Nuance and Clarity: Decluttering Tabular Sequential Graphs to Counter Money Laundering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Grouping transactions by amount and timing reduces clutter in sequential graphs used for money laundering analysis, with a user study showing that simpler reductions are not always the most useful.","cross_cats":[],"primary_cat":"cs.HC","authors_text":"Louise Fallon, Pedro Bizarro, Rita Costa, Salom\\'e Esteves","submitted_at":"2026-05-11T13:09:33Z","abstract_excerpt":"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 p"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the three proposed grouping methods preserve enough transaction nuance to support accurate money laundering detection while the expert opinions in the user study reflect real operational needs and generalize beyond the study participants.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Tabular sequential graphs with amount-based, time-based, and combined grouping reduce nodes and edges for AML analysis, but expert users found a trade-off where stronger node reduction was not always preferred for insight.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Grouping transactions by amount and timing reduces clutter in sequential graphs used for money laundering analysis, with a user study showing that simpler reductions are not always the most useful.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"291aa943ba85d4b1528cbefcd296bcbc82236dc5650b6f67f25c9f6fb6d5ab08"},"source":{"id":"2605.10522","kind":"arxiv","version":2},"verdict":{"id":"4f4ffee1-f275-4b3f-9b79-af9bb4768d1c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T04:58:49.108356Z","strongest_claim":"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.","one_line_summary":"Tabular sequential graphs with amount-based, time-based, and combined grouping reduce nodes and edges for AML analysis, but expert users found a trade-off where stronger node reduction was not always preferred for insight.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the three proposed grouping methods preserve enough transaction nuance to support accurate money laundering detection while the expert opinions in the user study reflect real operational needs and generalize beyond the study participants.","pith_extraction_headline":"Grouping transactions by amount and timing reduces clutter in sequential graphs used for money laundering analysis, with a user study showing that simpler reductions are not always the most useful."},"integrity":{"clean":false,"summary":{"advisory":4,"critical":0,"by_detector":{"doi_compliance":{"total":4,"advisory":4,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.10522/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/ICCICC46617.2019.91460982) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":23,"audited_at":"2026-05-19T09:13:20.371426Z","detected_doi":"10.1109/ICCICC46617.2019.91460982","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TVCG.2016.25989582) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":4,"audited_at":"2026-05-19T09:13:20.371426Z","detected_doi":"10.1109/TVCG.2016.25989582","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/BigData.2018.86225212) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":10,"audited_at":"2026-05-19T09:13:20.371426Z","detected_doi":"10.1109/BigData.2018.86225212","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1111/cgf.147942) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":12,"audited_at":"2026-05-19T09:13:20.371426Z","detected_doi":"10.1111/cgf.147942","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T05:42:01.007746Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T14:42:16.516054Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T11:01:17.882640Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T09:13:20.371426Z","status":"completed","version":"1.0.0","findings_count":4}],"snapshot_sha256":"57304f272af08575676b7b1d5754a70c323e0bcd0ce6d52f427812aa3d2e7e55"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"4f4ffee1-f275-4b3f-9b79-af9bb4768d1c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T01:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7uWAW3masTxSBtIsQTozllAU7LYjfL8ZHaDUrcjwvild415kX0YysDq5x60K9zDHhoD9C3V6D+k9sEc+CRcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:29:24.626252Z"},"content_sha256":"eacecc97fddad6b6d0a2ff6de11a15927c038e5b1084e99318d5c19a7325504b","schema_version":"1.0","event_id":"sha256:eacecc97fddad6b6d0a2ff6de11a15927c038e5b1084e99318d5c19a7325504b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/ICCICC46617.2019.91460982) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"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.110","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":23,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"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.110","reconstructed_doi":"10.1109/ICCICC46617.2019.91460982"},"severity":"advisory","ref_index":23,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/ICCICC46617.2019.91460982","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"079023cad028e2e72e2ad5393985044b0aa45c0a3de8c460a370ad120012f2e8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":594,"payload_sha256":"e1ab63006ea6f1f19bf6e5db28c850182a8a722e0d575bb58f26a9de4d0e811b","signature_b64":"gNEgy463645lk/c4aDq/Y1ofnXSsTf2nzIrDGLivGZWG3HSAc/KrP14apjr2YL94U3Gwqp85IQo7xQl1lj5GCw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T09:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avdKVssoU24dlrSe+7NLyjyX7GEoA9LMK5GuFy9Lm8NBED0YMwfRM2zxNI+n9V/Uj46i52XN45jovoScLHGUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:29:24.683603Z"},"content_sha256":"9b2161ecffb7163f55ca3474c68df4d040d2698b616533b77d179d6637bc87d1","schema_version":"1.0","event_id":"sha256:9b2161ecffb7163f55ca3474c68df4d040d2698b616533b77d179d6637bc87d1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1111/cgf.147942) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"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","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"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","reconstructed_doi":"10.1111/cgf.147942"},"severity":"advisory","ref_index":12,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1111/cgf.147942","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0af8d18042f672169eccf680eb0b9c97f8dc4378435805326fb95b9910563d27","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":593,"payload_sha256":"f5f1a6952e720d33d3668ce9ae79dd336db88be32fea79eef411747bf4fe11d4","signature_b64":"ZmyBCXq4QtelqEf4w6orDyYd1dbRoMUAtYZiRwfhbiIuTeGt1N8BsbSB/w5IasDH386c35768ERtqOMA+ZboAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T09:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q07FDqkavPEcfc4UAZSqHfU15M/KzJIQlEJcC4TfU9T4p1fSkQgCffw8YHHAXdrQbLwf7u+6SvnldsRjOl82CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:29:24.684345Z"},"content_sha256":"db0b09ff537c596bcb66c6c5c0c99021e0163e6f9e59e923e861b7c440ef49e3","schema_version":"1.0","event_id":"sha256:db0b09ff537c596bcb66c6c5c0c99021e0163e6f9e59e923e861b7c440ef49e3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/BigData.2018.86225212) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"IEEE, Seattle, W A, USA, Dec. 2018. doi: 10.1109/BigData. 2018.8622521 2","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":10,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"IEEE, Seattle, W A, USA, Dec. 2018. doi: 10.1109/BigData. 2018.8622521 2","reconstructed_doi":"10.1109/BigData.2018.86225212"},"severity":"advisory","ref_index":10,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/BigData.2018.86225212","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6aed936ed29403ac259a44bd7e546c3be6808755fd83921b609309efab62b558","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":592,"payload_sha256":"c0aefb854cb67c6b19db9e869e2b3072a94d94f5e134e5303147591107ad25f7","signature_b64":"GcLi5inXvlR0WhW6hB+tKQbwpUcUb12VuD9C5+oL1JKiYw/NM1iO7uo1C8c9ugMTYPEl/TtBRZZ8G5N+2ZGkAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T09:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjOyyDJYNm++MbDb4f4mr4617EPMT6NzusjZAlKvEt8iN6cei8KotCCaWvbA9sicEY4BU22e+U8sT2ES+wawCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:29:24.685031Z"},"content_sha256":"b352137d706871982049dbb6c974f9a763e0692a4f9c077be0a7d098b3c666ae","schema_version":"1.0","event_id":"sha256:b352137d706871982049dbb6c974f9a763e0692a4f9c077be0a7d098b3c666ae"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TVCG.2016.25989582) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"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. ","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"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. ","reconstructed_doi":"10.1109/TVCG.2016.25989582"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TVCG.2016.25989582","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6319c52600d39a52a041785d89d18e706dec5ec855515fdf1b3c9ac1e2cc1f54","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":591,"payload_sha256":"7d1417a9ad6d085241de1bd01508fefc8fd75b8383cc5e21dd3ac1aaee003987","signature_b64":"LZJiEkIt8dd3oewPm/67r7qjeIbqub1DUbz2cE0wjf8qO7cqEYTP5cLhpP9OmUUtAu7LIUIprSR8D+iiYi16DA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T09:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPWTfSJOroOGnwPmQKsQAdHVsv92i+f22++h/Z9nnd9pgy6G7zum712I3Gq/NzTQ4Y7UviKSo/jmzGG362OFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:29:24.685532Z"},"content_sha256":"dedb3cd270eec342628d15e62f4ea2cb66866ad49c9773b57f06c54ce543a8a5","schema_version":"1.0","event_id":"sha256:dedb3cd270eec342628d15e62f4ea2cb66866ad49c9773b57f06c54ce543a8a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ/bundle.json","state_url":"https://pith.science/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T17:29:24Z","links":{"resolver":"https://pith.science/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ","bundle":"https://pith.science/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ/bundle.json","state":"https://pith.science/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S55G6T7XKOG3FUYRJ7EBE4RSWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S55G6T7XKOG3FUYRJ7EBE4RSWQ","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"87aeff40428ef66c26a4f3b1bfeba6a720fc7a96a6ae67eef8e1576e2c075e41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-11T13:09:33Z","title_canon_sha256":"a17435da6baa5136be10095816e4e23ef75a652fdadf40acf2414c3fffd44e5c"},"schema_version":"1.0","source":{"id":"2605.10522","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10522","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10522v2","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10522","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"S55G6T7XKOG3","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"pith_short_16","alias_value":"S55G6T7XKOG3FUYR","created_at":"2026-07-03T01:17:21Z"},{"alias_kind":"pith_short_8","alias_value":"S55G6T7X","created_at":"2026-07-03T01:17:21Z"}],"graph_snapshots":[{"event_id":"sha256:eacecc97fddad6b6d0a2ff6de11a15927c038e5b1084e99318d5c19a7325504b","target":"graph","created_at":"2026-07-03T01:17:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the three proposed grouping methods preserve enough transaction nuance to support accurate money laundering detection while the expert opinions in the user study reflect real operational needs and generalize beyond the study participants."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Tabular sequential graphs with amount-based, time-based, and combined grouping reduce nodes and edges for AML analysis, but expert users found a trade-off where stronger node reduction was not always preferred for insight."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Grouping transactions by amount and timing reduces clutter in sequential graphs used for money laundering analysis, with a user study showing that simpler reductions are not always the most useful."}],"snapshot_sha256":"291aa943ba85d4b1528cbefcd296bcbc82236dc5650b6f67f25c9f6fb6d5ab08"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T05:42:01.007746Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T14:42:16.516054Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T11:01:17.882640Z","status":"completed","version":"1.0.0"},{"findings_count":4,"name":"doi_compliance","ran_at":"2026-05-19T09:13:20.371426Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.10522/integrity.json","findings":[{"audited_at":"2026-05-19T09:13:20.371426Z","detected_arxiv_id":null,"detected_doi":"10.1109/ICCICC46617.2019.91460982","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/ICCICC46617.2019.91460982) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":23,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T09:13:20.371426Z","detected_arxiv_id":null,"detected_doi":"10.1109/TVCG.2016.25989582","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TVCG.2016.25989582) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":4,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T09:13:20.371426Z","detected_arxiv_id":null,"detected_doi":"10.1109/BigData.2018.86225212","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/BigData.2018.86225212) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":10,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T09:13:20.371426Z","detected_arxiv_id":null,"detected_doi":"10.1111/cgf.147942","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1111/cgf.147942) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":12,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"57304f272af08575676b7b1d5754a70c323e0bcd0ce6d52f427812aa3d2e7e55","summary":{"advisory":4,"by_detector":{"doi_compliance":{"advisory":4,"critical":0,"informational":0,"total":4}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"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 p","authors_text":"Louise Fallon, Pedro Bizarro, Rita Costa, Salom\\'e Esteves","cross_cats":[],"headline":"Grouping transactions by amount and timing reduces clutter in sequential graphs used for money laundering analysis, with a user study showing that simpler reductions are not always the most useful.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-11T13:09:33Z","title":"The Balance between Nuance and Clarity: Decluttering Tabular Sequential Graphs to Counter Money Laundering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.10522","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T04:58:49.108356Z","id":"4f4ffee1-f275-4b3f-9b79-af9bb4768d1c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Tabular sequential graphs with amount-based, time-based, and combined grouping reduce nodes and edges for AML analysis, but expert users found a trade-off where stronger node reduction was not always preferred for insight.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Grouping transactions by amount and timing reduces clutter in sequential graphs used for money laundering analysis, with a user study showing that simpler reductions are not always the most useful.","strongest_claim":"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.","weakest_assumption":"That the three proposed grouping methods preserve enough transaction nuance to support accurate money laundering detection while the expert opinions in the user study reflect real operational needs and generalize beyond the study participants."}},"verdict_id":"4f4ffee1-f275-4b3f-9b79-af9bb4768d1c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3f71b72c9a77ccda76a7518bd122300ea8279c02da927507afd40607b4ebed3f","target":"record","created_at":"2026-07-03T01:17:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"87aeff40428ef66c26a4f3b1bfeba6a720fc7a96a6ae67eef8e1576e2c075e41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-11T13:09:33Z","title_canon_sha256":"a17435da6baa5136be10095816e4e23ef75a652fdadf40acf2414c3fffd44e5c"},"schema_version":"1.0","source":{"id":"2605.10522","kind":"arxiv","version":2}},"canonical_sha256":"977a6f4ff7538db2d3114fc8127232b43a74466108d9cc6ed9ad06dfc2114eed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"977a6f4ff7538db2d3114fc8127232b43a74466108d9cc6ed9ad06dfc2114eed","first_computed_at":"2026-07-03T01:17:21.334523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:21.334523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irYq4ExhsIHlmBGezXulLDF8mYjyv9n3j3Rsw7NbBRjvpNGkgbf0HdB9/fX4FIfNya0cH2emKXsKsNG+TFjWBg==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:21.334992Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.10522","source_kind":"arxiv","source_version":2}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:9b2161ecffb7163f55ca3474c68df4d040d2698b616533b77d179d6637bc87d1","sha256:b352137d706871982049dbb6c974f9a763e0692a4f9c077be0a7d098b3c666ae","sha256:db0b09ff537c596bcb66c6c5c0c99021e0163e6f9e59e923e861b7c440ef49e3","sha256:dedb3cd270eec342628d15e62f4ea2cb66866ad49c9773b57f06c54ce543a8a5"]}],"invalid_events":[],"applied_event_ids":["sha256:3f71b72c9a77ccda76a7518bd122300ea8279c02da927507afd40607b4ebed3f","sha256:eacecc97fddad6b6d0a2ff6de11a15927c038e5b1084e99318d5c19a7325504b"],"state_sha256":"49bc653693721ab6929875d87452a7dbcc54a6ffee0ce898294c227b2c00840c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSNVUwq9frK8cifcQmVRMdvDVdLbogqyCNl0tDPMmubym6KobC9DrZWMrpBd0yFo2JeMC3z9648inYBQFBecAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:29:24.690470Z","bundle_sha256":"7815e7ba48b1467b0b75f32e3558936ebd52ea4b29c2e73bae9753138648d7ee"}}