{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DWEFBYDG6D7WM3DTMZW6LGH6P2","short_pith_number":"pith:DWEFBYDG","canonical_record":{"source":{"id":"1712.08101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T17:31:58Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"db6cc27d6df0cd54afea9a0b4d5a404b5708fbf0cf45aef67caee266f94a3dad","abstract_canon_sha256":"db81063bf5870d0b11154cbc295a8761f31e4bf21fb3e3fc290d19ae4ae48683"},"schema_version":"1.0"},"canonical_sha256":"1d8850e066f0ff666c73666de598fe7e9398b57083ab8dd6c85d901bbe6e5183","source":{"kind":"arxiv","id":"1712.08101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08101","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08101v1","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08101","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"DWEFBYDG6D7W","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWEFBYDG6D7WM3DT","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWEFBYDG","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DWEFBYDG6D7WM3DTMZW6LGH6P2","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T17:31:58Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"db6cc27d6df0cd54afea9a0b4d5a404b5708fbf0cf45aef67caee266f94a3dad","abstract_canon_sha256":"db81063bf5870d0b11154cbc295a8761f31e4bf21fb3e3fc290d19ae4ae48683"},"schema_version":"1.0"},"canonical_sha256":"1d8850e066f0ff666c73666de598fe7e9398b57083ab8dd6c85d901bbe6e5183","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:28.785072Z","signature_b64":"SwisJXpPgYBWyQuQ1mFubltKAbYq5WNkeVnLKJGt7glQaf5MkbPoSusBrqKvGyXrC1RWSAl5DV9MzQ9vl+BdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d8850e066f0ff666c73666de598fe7e9398b57083ab8dd6c85d901bbe6e5183","last_reissued_at":"2026-05-18T00:27:28.784238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:28.784238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08101","source_version":1,"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-05-18T00:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIh3RIXCr+fsLumDEIAfttMiBwPaDdKQ9JqNpJAxtbNsN82lcRHugGODaj9WVoxK3Qhc0nFfkFTz2WSbw/3qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:34:47.684690Z"},"content_sha256":"673c0b71abcd2eb99b96d1251a19a16c83275035da3b190acc33b6a0878c985d","schema_version":"1.0","event_id":"sha256:673c0b71abcd2eb99b96d1251a19a16c83275035da3b190acc33b6a0878c985d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DWEFBYDG6D7WM3DTMZW6LGH6P2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profit Driven Decision Trees for Churn Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"stat.ML","authors_text":"Bart Baesens, Eugen Stripling, Sebastiaan H\\\"oppner, Seppe vanden Broucke, Tim Verdonck","submitted_at":"2017-12-21T17:31:58Z","abstract_excerpt":"Customer retention campaigns increasingly rely on predictive models to detect potential churners in a vast customer base. From the perspective of machine learning, the task of predicting customer churn can be presented as a binary classification problem. Using data on historic behavior, classification algorithms are built with the purpose of accurately predicting the probability of a customer defecting. The predictive churn models are then commonly selected based on accuracy related performance measures such as the area under the ROC curve (AUC). However, these models are often not well aligne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08101","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcPp6e+dnRXjoT3yeKAPL4cXqisZ0gMDUR+ofHBsjf//5WPXajR481QoDFSeVI41XkJhQTrS9rtumFiXB3UnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:34:47.685464Z"},"content_sha256":"83f33ff4cb1d95dd1f36168e9d24edf3a42b4b93603d1e0dac71a4cae64ad5fc","schema_version":"1.0","event_id":"sha256:83f33ff4cb1d95dd1f36168e9d24edf3a42b4b93603d1e0dac71a4cae64ad5fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2/bundle.json","state_url":"https://pith.science/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2/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-06-09T19:34:47Z","links":{"resolver":"https://pith.science/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2","bundle":"https://pith.science/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2/bundle.json","state":"https://pith.science/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWEFBYDG6D7WM3DTMZW6LGH6P2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DWEFBYDG6D7WM3DTMZW6LGH6P2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"db81063bf5870d0b11154cbc295a8761f31e4bf21fb3e3fc290d19ae4ae48683","cross_cats_sorted":["cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T17:31:58Z","title_canon_sha256":"db6cc27d6df0cd54afea9a0b4d5a404b5708fbf0cf45aef67caee266f94a3dad"},"schema_version":"1.0","source":{"id":"1712.08101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08101","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08101v1","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08101","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"DWEFBYDG6D7W","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWEFBYDG6D7WM3DT","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWEFBYDG","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:83f33ff4cb1d95dd1f36168e9d24edf3a42b4b93603d1e0dac71a4cae64ad5fc","target":"graph","created_at":"2026-05-18T00:27:28Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Customer retention campaigns increasingly rely on predictive models to detect potential churners in a vast customer base. From the perspective of machine learning, the task of predicting customer churn can be presented as a binary classification problem. Using data on historic behavior, classification algorithms are built with the purpose of accurately predicting the probability of a customer defecting. The predictive churn models are then commonly selected based on accuracy related performance measures such as the area under the ROC curve (AUC). However, these models are often not well aligne","authors_text":"Bart Baesens, Eugen Stripling, Sebastiaan H\\\"oppner, Seppe vanden Broucke, Tim Verdonck","cross_cats":["cs.LG","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T17:31:58Z","title":"Profit Driven Decision Trees for Churn Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08101","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:673c0b71abcd2eb99b96d1251a19a16c83275035da3b190acc33b6a0878c985d","target":"record","created_at":"2026-05-18T00:27:28Z","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":"db81063bf5870d0b11154cbc295a8761f31e4bf21fb3e3fc290d19ae4ae48683","cross_cats_sorted":["cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T17:31:58Z","title_canon_sha256":"db6cc27d6df0cd54afea9a0b4d5a404b5708fbf0cf45aef67caee266f94a3dad"},"schema_version":"1.0","source":{"id":"1712.08101","kind":"arxiv","version":1}},"canonical_sha256":"1d8850e066f0ff666c73666de598fe7e9398b57083ab8dd6c85d901bbe6e5183","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d8850e066f0ff666c73666de598fe7e9398b57083ab8dd6c85d901bbe6e5183","first_computed_at":"2026-05-18T00:27:28.784238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:28.784238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SwisJXpPgYBWyQuQ1mFubltKAbYq5WNkeVnLKJGt7glQaf5MkbPoSusBrqKvGyXrC1RWSAl5DV9MzQ9vl+BdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:28.785072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:673c0b71abcd2eb99b96d1251a19a16c83275035da3b190acc33b6a0878c985d","sha256:83f33ff4cb1d95dd1f36168e9d24edf3a42b4b93603d1e0dac71a4cae64ad5fc"],"state_sha256":"e03c236d3ce7f03a4fd36d6a21200bc8c01f83c1f39be7fabbd52e31fc13afb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzos87CzxTuE3y+2D/t6CkMFKqAgG33rBtu6SFGMFkGBlYiv328giTLqbZ74C3Z2OSrXQkFsW72XHPd32vWxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:34:47.689024Z","bundle_sha256":"ef46c359970329179bf6ee9c956203eb5861d554a6474fe0399a16024618ccd6"}}