{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:534BJJ3TDRIWMSINFDA3RFZ7BQ","short_pith_number":"pith:534BJJ3T","schema_version":"1.0","canonical_sha256":"eef814a7731c5166490d28c1b8973f0c1bcdcc3a11d383ead3056be11d071091","source":{"kind":"arxiv","id":"1905.12568","version":1},"attestation_state":"computed","paper":{"title":"Predicting Sparse Clients' Actions with CPOPT-Net in the Banking Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean Hilger, Jeremy Charlier, Radu State","submitted_at":"2019-05-23T19:43:57Z","abstract_excerpt":"The digital revolution of the banking system with evolving European regulations have pushed the major banking actors to innovate by a newly use of their clients' digital information. Given highly sparse client activities, we propose CPOPT-Net, an algorithm that combines the CP canonical tensor decomposition, a multidimensional matrix decomposition that factorizes a tensor as the sum of rank-one tensors, and neural networks. CPOPT-Net removes efficiently sparse information with a gradient-based resolution while relying on neural networks for time series predictions. Our experiments show that CP"},"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":"1905.12568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T19:43:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a527609c8194a04f9feb562f3969673c7e6278be1dc62310bb584e549a71a041","abstract_canon_sha256":"ed57c3a40ab06c04bc6e49ed367d708dfb7957dc4f1a54d0fe8977c7e5db97ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.946804Z","signature_b64":"KXhmi/FieEY2hcT+3gVY2fBgLXMXkjZjx18YiFFkkZ51zip9FblcxUHCO8mDfgTY60D9iv8xUqSqgUPLE+qNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef814a7731c5166490d28c1b8973f0c1bcdcc3a11d383ead3056be11d071091","last_reissued_at":"2026-05-17T23:44:43.946166Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.946166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting Sparse Clients' Actions with CPOPT-Net in the Banking Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean Hilger, Jeremy Charlier, Radu State","submitted_at":"2019-05-23T19:43:57Z","abstract_excerpt":"The digital revolution of the banking system with evolving European regulations have pushed the major banking actors to innovate by a newly use of their clients' digital information. Given highly sparse client activities, we propose CPOPT-Net, an algorithm that combines the CP canonical tensor decomposition, a multidimensional matrix decomposition that factorizes a tensor as the sum of rank-one tensors, and neural networks. CPOPT-Net removes efficiently sparse information with a gradient-based resolution while relying on neural networks for time series predictions. Our experiments show that CP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12568","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":""},"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":"1905.12568","created_at":"2026-05-17T23:44:43.946264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12568v1","created_at":"2026-05-17T23:44:43.946264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12568","created_at":"2026-05-17T23:44:43.946264+00:00"},{"alias_kind":"pith_short_12","alias_value":"534BJJ3TDRIW","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"534BJJ3TDRIWMSIN","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"534BJJ3T","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ","json":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ.json","graph_json":"https://pith.science/api/pith-number/534BJJ3TDRIWMSINFDA3RFZ7BQ/graph.json","events_json":"https://pith.science/api/pith-number/534BJJ3TDRIWMSINFDA3RFZ7BQ/events.json","paper":"https://pith.science/paper/534BJJ3T"},"agent_actions":{"view_html":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ","download_json":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ.json","view_paper":"https://pith.science/paper/534BJJ3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12568&json=true","fetch_graph":"https://pith.science/api/pith-number/534BJJ3TDRIWMSINFDA3RFZ7BQ/graph.json","fetch_events":"https://pith.science/api/pith-number/534BJJ3TDRIWMSINFDA3RFZ7BQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ/action/storage_attestation","attest_author":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ/action/author_attestation","sign_citation":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ/action/citation_signature","submit_replication":"https://pith.science/pith/534BJJ3TDRIWMSINFDA3RFZ7BQ/action/replication_record"}},"created_at":"2026-05-17T23:44:43.946264+00:00","updated_at":"2026-05-17T23:44:43.946264+00:00"}