{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KDI56UNCFTIRPALCF3YFSOWKSI","short_pith_number":"pith:KDI56UNC","schema_version":"1.0","canonical_sha256":"50d1df51a22cd11781622ef0593aca923f5d977e44572c4bccb5deddf12fda09","source":{"kind":"arxiv","id":"2412.14916","version":2},"attestation_state":"computed","paper":{"title":"From Point to probabilistic gradient boosting for claim frequency and severity prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dominik Chevalier, Marie-Pier C\\^ot\\'e","submitted_at":"2024-12-19T14:50:10Z","abstract_excerpt":"Gradient boosting for decision tree algorithms are increasingly used in actuarial applications as they show superior predictive performance over traditional generalised linear models. Many enhancements to the first gradient boosting machine algorithm exist. We present in a unified notation, and contrast, all the existing point and probabilistic gradient boosting for decision tree algorithms: GBM, XGBoost, DART, LightGBM, CatBoost, EGBM, PGBM, XGBoostLSS, cyclic GBM, and NGBoost. In this comprehensive numerical study, we compare their performance on five publicly available datasets for claim fr"},"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":"2412.14916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-12-19T14:50:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"45e86f3b169f5f1aeac404c21d764009d9677eb8745cabe9cb74789a9c3b01a1","abstract_canon_sha256":"0fb883dbe67efe91dda01e321e3b6630f3835fa4c63e51f95bd6a9ee41e1d2a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:59.155287Z","signature_b64":"wql1uicCpBmOU4yD7CQvZWr9Z4y2ZaZ6h7vBcafNwwMttgTQ+TeMgtxh9MQAWrfGtG13GAC+BmC494ftq3OFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50d1df51a22cd11781622ef0593aca923f5d977e44572c4bccb5deddf12fda09","last_reissued_at":"2026-07-05T11:47:59.154758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:59.154758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Point to probabilistic gradient boosting for claim frequency and severity prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dominik Chevalier, Marie-Pier C\\^ot\\'e","submitted_at":"2024-12-19T14:50:10Z","abstract_excerpt":"Gradient boosting for decision tree algorithms are increasingly used in actuarial applications as they show superior predictive performance over traditional generalised linear models. Many enhancements to the first gradient boosting machine algorithm exist. We present in a unified notation, and contrast, all the existing point and probabilistic gradient boosting for decision tree algorithms: GBM, XGBoost, DART, LightGBM, CatBoost, EGBM, PGBM, XGBoostLSS, cyclic GBM, and NGBoost. In this comprehensive numerical study, we compare their performance on five publicly available datasets for claim fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14916","kind":"arxiv","version":2},"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/2412.14916/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":"2412.14916","created_at":"2026-07-05T11:47:59.154821+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14916v2","created_at":"2026-07-05T11:47:59.154821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14916","created_at":"2026-07-05T11:47:59.154821+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDI56UNCFTIR","created_at":"2026-07-05T11:47:59.154821+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDI56UNCFTIRPALC","created_at":"2026-07-05T11:47:59.154821+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDI56UNC","created_at":"2026-07-05T11:47:59.154821+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/KDI56UNCFTIRPALCF3YFSOWKSI","json":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI.json","graph_json":"https://pith.science/api/pith-number/KDI56UNCFTIRPALCF3YFSOWKSI/graph.json","events_json":"https://pith.science/api/pith-number/KDI56UNCFTIRPALCF3YFSOWKSI/events.json","paper":"https://pith.science/paper/KDI56UNC"},"agent_actions":{"view_html":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI","download_json":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI.json","view_paper":"https://pith.science/paper/KDI56UNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14916&json=true","fetch_graph":"https://pith.science/api/pith-number/KDI56UNCFTIRPALCF3YFSOWKSI/graph.json","fetch_events":"https://pith.science/api/pith-number/KDI56UNCFTIRPALCF3YFSOWKSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI/action/storage_attestation","attest_author":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI/action/author_attestation","sign_citation":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI/action/citation_signature","submit_replication":"https://pith.science/pith/KDI56UNCFTIRPALCF3YFSOWKSI/action/replication_record"}},"created_at":"2026-07-05T11:47:59.154821+00:00","updated_at":"2026-07-05T11:47:59.154821+00:00"}