{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3UB7SA6QFEHSQKKV7IL5XWTKAF","short_pith_number":"pith:3UB7SA6Q","schema_version":"1.0","canonical_sha256":"dd03f903d0290f282955fa17dbda6a0167b79daa22f8539bda6d132c7811f925","source":{"kind":"arxiv","id":"2307.13787","version":1},"attestation_state":"computed","paper":{"title":"The GANfather: Controllable generation of malicious activity to improve defence systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"David Apar\\'icio, Jacopo Bono, Jo\\~ao Tiago Ascens\\~ao, Pedro Bizarro, Pedro Ribeiro, Ricardo Ribeiro Pereira","submitted_at":"2023-07-25T19:45:46Z","abstract_excerpt":"Machine learning methods to aid defence systems in detecting malicious activity typically rely on labelled data. In some domains, such labelled data is unavailable or incomplete. In practice this can lead to low detection rates and high false positive rates, which characterise for example anti-money laundering systems. In fact, it is estimated that 1.7--4 trillion euros are laundered annually and go undetected. We propose The GANfather, a method to generate samples with properties of malicious activity, without label requirements. We propose to reward the generation of malicious samples by int"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2307.13787","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-07-25T19:45:46Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"de4ecd820b68e31403bb4f84f578f07a5a7617e0d52ee437e6c64cf0963da7b6","abstract_canon_sha256":"d31fe84c57c1506840fba414a5accc7ad043da2d4dc0cda20e2ad3e583e33a68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:52.609054Z","signature_b64":"Et14Rpz16BUgcWtycAosy2e3Oa/LTQLVAP0LISRWhRYkIqwz/a4j+vykqNtTZEbo4PJOsDW3IFhZ9enMKKIHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd03f903d0290f282955fa17dbda6a0167b79daa22f8539bda6d132c7811f925","last_reissued_at":"2026-07-05T06:34:52.608592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:52.608592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The GANfather: Controllable generation of malicious activity to improve defence systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"David Apar\\'icio, Jacopo Bono, Jo\\~ao Tiago Ascens\\~ao, Pedro Bizarro, Pedro Ribeiro, Ricardo Ribeiro Pereira","submitted_at":"2023-07-25T19:45:46Z","abstract_excerpt":"Machine learning methods to aid defence systems in detecting malicious activity typically rely on labelled data. In some domains, such labelled data is unavailable or incomplete. In practice this can lead to low detection rates and high false positive rates, which characterise for example anti-money laundering systems. In fact, it is estimated that 1.7--4 trillion euros are laundered annually and go undetected. We propose The GANfather, a method to generate samples with properties of malicious activity, without label requirements. We propose to reward the generation of malicious samples by int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13787","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.13787/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.13787","created_at":"2026-07-05T06:34:52.608661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13787v1","created_at":"2026-07-05T06:34:52.608661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13787","created_at":"2026-07-05T06:34:52.608661+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UB7SA6QFEHS","created_at":"2026-07-05T06:34:52.608661+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UB7SA6QFEHSQKKV","created_at":"2026-07-05T06:34:52.608661+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UB7SA6Q","created_at":"2026-07-05T06:34:52.608661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06473","citing_title":"MICA: Multivariate Infini Compressive Attention for Time Series Forecasting","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06473","citing_title":"MICA: Multivariate Infini Compressive Attention for Time Series Forecasting","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF","json":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF.json","graph_json":"https://pith.science/api/pith-number/3UB7SA6QFEHSQKKV7IL5XWTKAF/graph.json","events_json":"https://pith.science/api/pith-number/3UB7SA6QFEHSQKKV7IL5XWTKAF/events.json","paper":"https://pith.science/paper/3UB7SA6Q"},"agent_actions":{"view_html":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF","download_json":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF.json","view_paper":"https://pith.science/paper/3UB7SA6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13787&json=true","fetch_graph":"https://pith.science/api/pith-number/3UB7SA6QFEHSQKKV7IL5XWTKAF/graph.json","fetch_events":"https://pith.science/api/pith-number/3UB7SA6QFEHSQKKV7IL5XWTKAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF/action/storage_attestation","attest_author":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF/action/author_attestation","sign_citation":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF/action/citation_signature","submit_replication":"https://pith.science/pith/3UB7SA6QFEHSQKKV7IL5XWTKAF/action/replication_record"}},"created_at":"2026-07-05T06:34:52.608661+00:00","updated_at":"2026-07-05T06:34:52.608661+00:00"}