{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KMUO2XZWZDLFPJ6G3D64AKNBM5","short_pith_number":"pith:KMUO2XZW","canonical_record":{"source":{"id":"2211.14599","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-26T15:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"26d0f227ad115d876c34fe9dc7acc294c39e06cbc460fa5ade7a6df43eba56c8","abstract_canon_sha256":"c4cc3ac95979f965b7c28cb651a0468e4d9d7190c0481f2f4b5a0691eb521fbb"},"schema_version":"1.0"},"canonical_sha256":"5328ed5f36c8d657a7c6d8fdc029a16773ec3a4c67bf9e50359403b8343fe4ac","source":{"kind":"arxiv","id":"2211.14599","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14599","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14599v2","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14599","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"KMUO2XZWZDLF","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"pith_short_16","alias_value":"KMUO2XZWZDLFPJ6G","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"pith_short_8","alias_value":"KMUO2XZW","created_at":"2026-07-05T08:47:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KMUO2XZWZDLFPJ6G3D64AKNBM5","target":"record","payload":{"canonical_record":{"source":{"id":"2211.14599","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-26T15:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"26d0f227ad115d876c34fe9dc7acc294c39e06cbc460fa5ade7a6df43eba56c8","abstract_canon_sha256":"c4cc3ac95979f965b7c28cb651a0468e4d9d7190c0481f2f4b5a0691eb521fbb"},"schema_version":"1.0"},"canonical_sha256":"5328ed5f36c8d657a7c6d8fdc029a16773ec3a4c67bf9e50359403b8343fe4ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:44.778064Z","signature_b64":"PY0W6sTrdet9MSvQffKj0gpDOYDv0x7M7Et1qSYAoSsK50JufE/AAm8Mw/7ma/w1677We/m1na399+sopuIQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5328ed5f36c8d657a7c6d8fdc029a16773ec3a4c67bf9e50359403b8343fe4ac","last_reissued_at":"2026-07-05T08:47:44.777653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:44.777653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.14599","source_version":2,"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-07-05T08:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hn9L4JKIfEiVGvDPhN0T2eU+KVk9SsJcjMX0ywUVDgRg3bEtfvs4Vfb7jAraOyH0N+HfzqJY1pObR5BalAXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:10:08.009734Z"},"content_sha256":"10a1aa1498913cbfbb31fbb7524f67cd522722d4bd55cd75873d4f9a9d5370e6","schema_version":"1.0","event_id":"sha256:10a1aa1498913cbfbb31fbb7524f67cd522722d4bd55cd75873d4f9a9d5370e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KMUO2XZWZDLFPJ6G3D64AKNBM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Condensed Gradient Boosting","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gonzalo Mart\\'inez-Mu\\~noz, Seyedsaman Emami","submitted_at":"2022-11-26T15:53:19Z","abstract_excerpt":"This paper presents a computationally efficient variant of gradient boosting for multi-class classification and multi-output regression tasks. Standard gradient boosting uses a 1-vs-all strategy for classifications tasks with more than two classes. This strategy translates in that one tree per class and iteration has to be trained. In this work, we propose the use of multi-output regressors as base models to handle the multi-class problem as a single task. In addition, the proposed modification allows the model to learn multi-output regression problems. An extensive comparison with other multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14599","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/2211.14599/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"},"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-07-05T08:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtUiEg5lm262hreyR4iwIEj5TU+PuLdCtdeY5MXHeFz1yxF0tdTRWFdtSOk39+rP8a1WKcWKLUEsYiGamFglAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:10:08.010251Z"},"content_sha256":"26be61ad538356b7cfddd02124defcc292b346a2e33b9a60b025527af7bf36a5","schema_version":"1.0","event_id":"sha256:26be61ad538356b7cfddd02124defcc292b346a2e33b9a60b025527af7bf36a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5/bundle.json","state_url":"https://pith.science/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5/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-08-24T01:10:08Z","links":{"resolver":"https://pith.science/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5","bundle":"https://pith.science/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5/bundle.json","state":"https://pith.science/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMUO2XZWZDLFPJ6G3D64AKNBM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KMUO2XZWZDLFPJ6G3D64AKNBM5","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":"c4cc3ac95979f965b7c28cb651a0468e4d9d7190c0481f2f4b5a0691eb521fbb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-26T15:53:19Z","title_canon_sha256":"26d0f227ad115d876c34fe9dc7acc294c39e06cbc460fa5ade7a6df43eba56c8"},"schema_version":"1.0","source":{"id":"2211.14599","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14599","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14599v2","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14599","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"KMUO2XZWZDLF","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"pith_short_16","alias_value":"KMUO2XZWZDLFPJ6G","created_at":"2026-07-05T08:47:44Z"},{"alias_kind":"pith_short_8","alias_value":"KMUO2XZW","created_at":"2026-07-05T08:47:44Z"}],"graph_snapshots":[{"event_id":"sha256:26be61ad538356b7cfddd02124defcc292b346a2e33b9a60b025527af7bf36a5","target":"graph","created_at":"2026-07-05T08:47:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.14599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a computationally efficient variant of gradient boosting for multi-class classification and multi-output regression tasks. Standard gradient boosting uses a 1-vs-all strategy for classifications tasks with more than two classes. This strategy translates in that one tree per class and iteration has to be trained. In this work, we propose the use of multi-output regressors as base models to handle the multi-class problem as a single task. In addition, the proposed modification allows the model to learn multi-output regression problems. An extensive comparison with other multi","authors_text":"Gonzalo Mart\\'inez-Mu\\~noz, Seyedsaman Emami","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-26T15:53:19Z","title":"Condensed Gradient Boosting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14599","kind":"arxiv","version":2},"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:10a1aa1498913cbfbb31fbb7524f67cd522722d4bd55cd75873d4f9a9d5370e6","target":"record","created_at":"2026-07-05T08:47:44Z","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":"c4cc3ac95979f965b7c28cb651a0468e4d9d7190c0481f2f4b5a0691eb521fbb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-26T15:53:19Z","title_canon_sha256":"26d0f227ad115d876c34fe9dc7acc294c39e06cbc460fa5ade7a6df43eba56c8"},"schema_version":"1.0","source":{"id":"2211.14599","kind":"arxiv","version":2}},"canonical_sha256":"5328ed5f36c8d657a7c6d8fdc029a16773ec3a4c67bf9e50359403b8343fe4ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5328ed5f36c8d657a7c6d8fdc029a16773ec3a4c67bf9e50359403b8343fe4ac","first_computed_at":"2026-07-05T08:47:44.777653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:47:44.777653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PY0W6sTrdet9MSvQffKj0gpDOYDv0x7M7Et1qSYAoSsK50JufE/AAm8Mw/7ma/w1677We/m1na399+sopuIQCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:47:44.778064Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.14599","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a1aa1498913cbfbb31fbb7524f67cd522722d4bd55cd75873d4f9a9d5370e6","sha256:26be61ad538356b7cfddd02124defcc292b346a2e33b9a60b025527af7bf36a5"],"state_sha256":"70b3781f3beb3ec7fde8d22287bea7fccdbc30ad7242d3f2671df5d0a2eaf7b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"au7q9cFMR97NvLxa559Ug2TYqdNuIPbD7IpPVVnae+vBIA2GT8Xkobs0pM13izGOc+n+mP+c8V7dZgGf3ImoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T01:10:08.015527Z","bundle_sha256":"a1c0a2737ca8a2d9f49d431a7e975274ac71ded07423e0be688c31cccd22c167"}}