{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VBXDZB6Y3QTYBIFC7NSPETKDTO","short_pith_number":"pith:VBXDZB6Y","schema_version":"1.0","canonical_sha256":"a86e3c87d8dc2780a0a2fb64f24d439bb83d912584d2ceb2fdb0fb79aa580af5","source":{"kind":"arxiv","id":"2001.07744","version":1},"attestation_state":"computed","paper":{"title":"Improving Label Ranking Ensembles using Boosting Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Erez Shmueli, Lihi Dery","submitted_at":"2020-01-21T19:16:11Z","abstract_excerpt":"Label ranking is a prediction task which deals with learning a mapping between an instance and a ranking (i.e., order) of labels from a finite set, representing their relevance to the instance. Boosting is a well-known and reliable ensemble technique that was shown to often outperform other learning algorithms. While boosting algorithms were developed for a multitude of machine learning tasks, label ranking tasks were overlooked. In this paper, we propose a boosting algorithm which was specifically designed for label ranking tasks. Extensive evaluation of the proposed algorithm on 24 semi-synt"},"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":"2001.07744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T19:16:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"87d0ad8ecf8eb8ffef82b4201eca64de43ebfd2ab7b93c90fbab18a89d8283b9","abstract_canon_sha256":"d38e1908284b48ba45cc4d90d8b065ba3a8033f9c171894ca27f0f214fd32ec0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:33.916147Z","signature_b64":"RHHAWe++SrAB0LT7sc5HtnmCL/YRdWVuihV39Op7xcPMKq7iV8cWUQSCF8LMkQ7TtA4DVgRBBNKhMkaarjfFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86e3c87d8dc2780a0a2fb64f24d439bb83d912584d2ceb2fdb0fb79aa580af5","last_reissued_at":"2026-07-05T01:37:33.915674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:33.915674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Label Ranking Ensembles using Boosting Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Erez Shmueli, Lihi Dery","submitted_at":"2020-01-21T19:16:11Z","abstract_excerpt":"Label ranking is a prediction task which deals with learning a mapping between an instance and a ranking (i.e., order) of labels from a finite set, representing their relevance to the instance. Boosting is a well-known and reliable ensemble technique that was shown to often outperform other learning algorithms. While boosting algorithms were developed for a multitude of machine learning tasks, label ranking tasks were overlooked. In this paper, we propose a boosting algorithm which was specifically designed for label ranking tasks. Extensive evaluation of the proposed algorithm on 24 semi-synt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07744","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/2001.07744/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":"2001.07744","created_at":"2026-07-05T01:37:33.915749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.07744v1","created_at":"2026-07-05T01:37:33.915749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07744","created_at":"2026-07-05T01:37:33.915749+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBXDZB6Y3QTY","created_at":"2026-07-05T01:37:33.915749+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBXDZB6Y3QTYBIFC","created_at":"2026-07-05T01:37:33.915749+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBXDZB6Y","created_at":"2026-07-05T01:37:33.915749+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/VBXDZB6Y3QTYBIFC7NSPETKDTO","json":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO.json","graph_json":"https://pith.science/api/pith-number/VBXDZB6Y3QTYBIFC7NSPETKDTO/graph.json","events_json":"https://pith.science/api/pith-number/VBXDZB6Y3QTYBIFC7NSPETKDTO/events.json","paper":"https://pith.science/paper/VBXDZB6Y"},"agent_actions":{"view_html":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO","download_json":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO.json","view_paper":"https://pith.science/paper/VBXDZB6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.07744&json=true","fetch_graph":"https://pith.science/api/pith-number/VBXDZB6Y3QTYBIFC7NSPETKDTO/graph.json","fetch_events":"https://pith.science/api/pith-number/VBXDZB6Y3QTYBIFC7NSPETKDTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/action/storage_attestation","attest_author":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/action/author_attestation","sign_citation":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/action/citation_signature","submit_replication":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/action/replication_record"}},"created_at":"2026-07-05T01:37:33.915749+00:00","updated_at":"2026-07-05T01:37:33.915749+00:00"}