{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B2DXKVQ2XL65TCKHWIBX4MJOKL","short_pith_number":"pith:B2DXKVQ2","schema_version":"1.0","canonical_sha256":"0e8775561abafdd98947b2037e312e52f3df974ed8ecd4943ed27856f9b9dda1","source":{"kind":"arxiv","id":"2605.27557","version":1},"attestation_state":"computed","paper":{"title":"The Fundamental Limits of Fraud Detection in Card Payment Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gaurav Dhama","submitted_at":"2026-05-26T18:24:50Z","abstract_excerpt":"Card payment fraud detection is usually framed as a supervised classification problem. Although this approach has generated practical progress, improvement has remained incremental despite major advances in model architecture. We argue that this is not mainly a failure of function approximation or optimization, but a consequence of structural information impairments inherent to the payment ecosystem.\n  We formalize card authorization as a sequential decision problem with delayed, censored, corrupted, and counterfactually missing feedback. We derive a minimax regret lower bound showing that the"},"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":"2605.27557","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-26T18:24:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3b5abf5434fdeb7a1018e2ea0f064e7b34d3ec247be42458b06bb9dbb8ef6e19","abstract_canon_sha256":"0e7245382f15c492d8d7b98dfd3e79668c1381fcf16fad737cf8a05375c56225"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:15.778071Z","signature_b64":"LCj12U2h7Be83/Pyb56nynMkLfYoAFACNPO84mCEtUBmWNqZ80exTTRE1S2Mskc94/Fz9dLDoZSUZH/XrtVECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e8775561abafdd98947b2037e312e52f3df974ed8ecd4943ed27856f9b9dda1","last_reissued_at":"2026-05-28T01:04:15.777581Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:15.777581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fundamental Limits of Fraud Detection in Card Payment Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gaurav Dhama","submitted_at":"2026-05-26T18:24:50Z","abstract_excerpt":"Card payment fraud detection is usually framed as a supervised classification problem. Although this approach has generated practical progress, improvement has remained incremental despite major advances in model architecture. We argue that this is not mainly a failure of function approximation or optimization, but a consequence of structural information impairments inherent to the payment ecosystem.\n  We formalize card authorization as a sequential decision problem with delayed, censored, corrupted, and counterfactually missing feedback. We derive a minimax regret lower bound showing that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27557","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/2605.27557/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":"2605.27557","created_at":"2026-05-28T01:04:15.777648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27557v1","created_at":"2026-05-28T01:04:15.777648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27557","created_at":"2026-05-28T01:04:15.777648+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2DXKVQ2XL65","created_at":"2026-05-28T01:04:15.777648+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2DXKVQ2XL65TCKH","created_at":"2026-05-28T01:04:15.777648+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2DXKVQ2","created_at":"2026-05-28T01:04:15.777648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.29272","citing_title":"Causal Label Recovery in Payment Networks","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.31257","citing_title":"Fraud Type Decomposition and the Observation-Mechanism Taxonomy:Class-Specific Detection Limits in Payment Networks","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL","json":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL.json","graph_json":"https://pith.science/api/pith-number/B2DXKVQ2XL65TCKHWIBX4MJOKL/graph.json","events_json":"https://pith.science/api/pith-number/B2DXKVQ2XL65TCKHWIBX4MJOKL/events.json","paper":"https://pith.science/paper/B2DXKVQ2"},"agent_actions":{"view_html":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL","download_json":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL.json","view_paper":"https://pith.science/paper/B2DXKVQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27557&json=true","fetch_graph":"https://pith.science/api/pith-number/B2DXKVQ2XL65TCKHWIBX4MJOKL/graph.json","fetch_events":"https://pith.science/api/pith-number/B2DXKVQ2XL65TCKHWIBX4MJOKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL/action/storage_attestation","attest_author":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL/action/author_attestation","sign_citation":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL/action/citation_signature","submit_replication":"https://pith.science/pith/B2DXKVQ2XL65TCKHWIBX4MJOKL/action/replication_record"}},"created_at":"2026-05-28T01:04:15.777648+00:00","updated_at":"2026-05-28T01:04:15.777648+00:00"}