{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4PTPJDP5JZUY7ZUV6UI6KBYFYB","short_pith_number":"pith:4PTPJDP5","canonical_record":{"source":{"id":"1707.05023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-17T07:44:26Z","cross_cats_sorted":["cs.LG","stat.TH"],"title_canon_sha256":"32bb26b9d68bfb5fab2a357bbc5f6393ccb4bb07ce7016b1e39cbd94b1484bb7","abstract_canon_sha256":"63f299f1a47b8d933ba8e5cdc06e3c7628e3b9000f8287d90481f7cdacd4debc"},"schema_version":"1.0"},"canonical_sha256":"e3e6f48dfd4e698fe695f511e50705c04b57ffacce6c513f2174eb7b14fc1ddd","source":{"kind":"arxiv","id":"1707.05023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05023","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05023v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05023","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"4PTPJDP5JZUY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4PTPJDP5JZUY7ZUV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4PTPJDP5","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4PTPJDP5JZUY7ZUV6UI6KBYFYB","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-17T07:44:26Z","cross_cats_sorted":["cs.LG","stat.TH"],"title_canon_sha256":"32bb26b9d68bfb5fab2a357bbc5f6393ccb4bb07ce7016b1e39cbd94b1484bb7","abstract_canon_sha256":"63f299f1a47b8d933ba8e5cdc06e3c7628e3b9000f8287d90481f7cdacd4debc"},"schema_version":"1.0"},"canonical_sha256":"e3e6f48dfd4e698fe695f511e50705c04b57ffacce6c513f2174eb7b14fc1ddd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.581286Z","signature_b64":"BFAm07zVb6HNAplE8mhrMwASAHw7inSgd3urrgrXMjl2ZgkWufMHQDQnN/zAsEwXNt1l1sucDPX6AjJjIvxaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3e6f48dfd4e698fe695f511e50705c04b57ffacce6c513f2174eb7b14fc1ddd","last_reissued_at":"2026-05-18T00:40:11.580695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.580695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05023","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8JDcgWDrItsmq/jOtMPSf+SK3i2z0E6Jxu1YYsFuUxpRPA7UxMMHRS+JPjxu8QwW57SMXVi12N8mCpJDdh1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:18:46.567671Z"},"content_sha256":"155a9b5d33c17a4f7c8e4f35426242364ba46e49682fa517ee438292bbcfa81b","schema_version":"1.0","event_id":"sha256:155a9b5d33c17a4f7c8e4f35426242364ba46e49682fa517ee438292bbcfa81b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4PTPJDP5JZUY7ZUV6UI6KBYFYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization by gradient boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.TH"],"primary_cat":"math.ST","authors_text":"Beno\\^it Cadre (ENS Rennes, G\\'erard Biau (LSTA, IRMAR), LPMA)","submitted_at":"2017-07-17T07:44:26Z","abstract_excerpt":"Gradient boosting is a state-of-the-art prediction technique that sequentially produces a model in the form of linear combinations of simple predictors---typically decision trees---by solving an infinite-dimensional convex optimization problem. We provide in the present paper a thorough analysis of two widespread versions of gradient boosting, and introduce a general framework for studying these algorithms from the point of view of functional optimization. We prove their convergence as the number of iterations tends to infinity and highlight the importance of having a strongly convex risk func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05023","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZU6vVL6dCevkJj4Otky5zrxlQnwjHYejVbZTgIAjBIcj50Vdikm1h/BJVHS2Ou4jfpYyGH+/oeYxwg0fdR71AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:18:46.568026Z"},"content_sha256":"5d22820bd14e7f16401b4466db1a91eb5c44aea97d75f416aa024311985a5b6b","schema_version":"1.0","event_id":"sha256:5d22820bd14e7f16401b4466db1a91eb5c44aea97d75f416aa024311985a5b6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB/bundle.json","state_url":"https://pith.science/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB/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-05-26T12:18:46Z","links":{"resolver":"https://pith.science/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB","bundle":"https://pith.science/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB/bundle.json","state":"https://pith.science/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PTPJDP5JZUY7ZUV6UI6KBYFYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4PTPJDP5JZUY7ZUV6UI6KBYFYB","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":"63f299f1a47b8d933ba8e5cdc06e3c7628e3b9000f8287d90481f7cdacd4debc","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-17T07:44:26Z","title_canon_sha256":"32bb26b9d68bfb5fab2a357bbc5f6393ccb4bb07ce7016b1e39cbd94b1484bb7"},"schema_version":"1.0","source":{"id":"1707.05023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05023","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05023v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05023","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"4PTPJDP5JZUY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4PTPJDP5JZUY7ZUV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4PTPJDP5","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5d22820bd14e7f16401b4466db1a91eb5c44aea97d75f416aa024311985a5b6b","target":"graph","created_at":"2026-05-18T00:40:11Z","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":"Gradient boosting is a state-of-the-art prediction technique that sequentially produces a model in the form of linear combinations of simple predictors---typically decision trees---by solving an infinite-dimensional convex optimization problem. We provide in the present paper a thorough analysis of two widespread versions of gradient boosting, and introduce a general framework for studying these algorithms from the point of view of functional optimization. We prove their convergence as the number of iterations tends to infinity and highlight the importance of having a strongly convex risk func","authors_text":"Beno\\^it Cadre (ENS Rennes, G\\'erard Biau (LSTA, IRMAR), LPMA)","cross_cats":["cs.LG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-17T07:44:26Z","title":"Optimization by gradient boosting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05023","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:155a9b5d33c17a4f7c8e4f35426242364ba46e49682fa517ee438292bbcfa81b","target":"record","created_at":"2026-05-18T00:40:11Z","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":"63f299f1a47b8d933ba8e5cdc06e3c7628e3b9000f8287d90481f7cdacd4debc","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-17T07:44:26Z","title_canon_sha256":"32bb26b9d68bfb5fab2a357bbc5f6393ccb4bb07ce7016b1e39cbd94b1484bb7"},"schema_version":"1.0","source":{"id":"1707.05023","kind":"arxiv","version":1}},"canonical_sha256":"e3e6f48dfd4e698fe695f511e50705c04b57ffacce6c513f2174eb7b14fc1ddd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3e6f48dfd4e698fe695f511e50705c04b57ffacce6c513f2174eb7b14fc1ddd","first_computed_at":"2026-05-18T00:40:11.580695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.580695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BFAm07zVb6HNAplE8mhrMwASAHw7inSgd3urrgrXMjl2ZgkWufMHQDQnN/zAsEwXNt1l1sucDPX6AjJjIvxaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.581286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:155a9b5d33c17a4f7c8e4f35426242364ba46e49682fa517ee438292bbcfa81b","sha256:5d22820bd14e7f16401b4466db1a91eb5c44aea97d75f416aa024311985a5b6b"],"state_sha256":"503c08ee414df4c94676b920798c06555f006ff4bf4745ea4ce0d823f0084cdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2dnwoEQt7x/Jj5n+qgECUN6HMMJoM44uZ3ABUZRUKysnrnfWkuA8at3iVYaqH3RkiovLwoRzjJfQ+0FiuU8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:18:46.571968Z","bundle_sha256":"c1a8241fabc3e3524c41335a1ff9dbdeff9e45eb96828ea472792fcf62977777"}}