{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:C5DHO4LIAJ6X7OITJ3VBYA3MTH","short_pith_number":"pith:C5DHO4LI","schema_version":"1.0","canonical_sha256":"1746777168027d7fb9134eea1c036c99e0bb7ba86dd18eba4db6bbdab2665965","source":{"kind":"arxiv","id":"2006.13346","version":1},"attestation_state":"computed","paper":{"title":"Learning Gradient Boosted Multi-label Classification Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eneldo Loza Menc\\'ia, Eyke H\\\"ullermeier, Johannes F\\\"urnkranz, Michael Rapp, Vu-Linh Nguyen","submitted_at":"2020-06-23T21:39:23Z","abstract_excerpt":"In multi-label classification, where the evaluation of predictions is less straightforward than in single-label classification, various meaningful, though different, loss functions have been proposed. Ideally, the learning algorithm should be customizable towards a specific choice of the performance measure. Modern implementations of boosting, most prominently gradient boosted decision trees, appear to be appealing from this point of view. However, they are mostly limited to single-label classification, and hence not amenable to multi-label losses unless these are label-wise decomposable. In t"},"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":"2006.13346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-23T21:39:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3c9ec4712ed34e2b0d47478678ac59fc39a297f05bf34dd0b4e0a856524c7d44","abstract_canon_sha256":"1120d86afd965c234fce34760f1de6898f1efc6d22fa00ab68b75975c48cc468"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:14.866148Z","signature_b64":"qq4QyxkqnT0b3hKMd3XHdWC0vOXqSGdKgKl/qm+ArEjn5QbmYBCgHg+68j34AuRi6OoERgoy1pO4ONdkAUvFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1746777168027d7fb9134eea1c036c99e0bb7ba86dd18eba4db6bbdab2665965","last_reissued_at":"2026-07-05T01:13:14.865627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:14.865627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Gradient Boosted Multi-label Classification Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eneldo Loza Menc\\'ia, Eyke H\\\"ullermeier, Johannes F\\\"urnkranz, Michael Rapp, Vu-Linh Nguyen","submitted_at":"2020-06-23T21:39:23Z","abstract_excerpt":"In multi-label classification, where the evaluation of predictions is less straightforward than in single-label classification, various meaningful, though different, loss functions have been proposed. Ideally, the learning algorithm should be customizable towards a specific choice of the performance measure. Modern implementations of boosting, most prominently gradient boosted decision trees, appear to be appealing from this point of view. However, they are mostly limited to single-label classification, and hence not amenable to multi-label losses unless these are label-wise decomposable. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13346","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.13346/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":"2006.13346","created_at":"2026-07-05T01:13:14.865692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.13346v1","created_at":"2026-07-05T01:13:14.865692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13346","created_at":"2026-07-05T01:13:14.865692+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5DHO4LIAJ6X","created_at":"2026-07-05T01:13:14.865692+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5DHO4LIAJ6X7OIT","created_at":"2026-07-05T01:13:14.865692+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5DHO4LI","created_at":"2026-07-05T01:13:14.865692+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/C5DHO4LIAJ6X7OITJ3VBYA3MTH","json":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH.json","graph_json":"https://pith.science/api/pith-number/C5DHO4LIAJ6X7OITJ3VBYA3MTH/graph.json","events_json":"https://pith.science/api/pith-number/C5DHO4LIAJ6X7OITJ3VBYA3MTH/events.json","paper":"https://pith.science/paper/C5DHO4LI"},"agent_actions":{"view_html":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH","download_json":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH.json","view_paper":"https://pith.science/paper/C5DHO4LI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.13346&json=true","fetch_graph":"https://pith.science/api/pith-number/C5DHO4LIAJ6X7OITJ3VBYA3MTH/graph.json","fetch_events":"https://pith.science/api/pith-number/C5DHO4LIAJ6X7OITJ3VBYA3MTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH/action/storage_attestation","attest_author":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH/action/author_attestation","sign_citation":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH/action/citation_signature","submit_replication":"https://pith.science/pith/C5DHO4LIAJ6X7OITJ3VBYA3MTH/action/replication_record"}},"created_at":"2026-07-05T01:13:14.865692+00:00","updated_at":"2026-07-05T01:13:14.865692+00:00"}