{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VBXDZB6Y3QTYBIFC7NSPETKDTO","short_pith_number":"pith:VBXDZB6Y","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"},"canonical_sha256":"a86e3c87d8dc2780a0a2fb64f24d439bb83d912584d2ceb2fdb0fb79aa580af5","source":{"kind":"arxiv","id":"2001.07744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07744","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07744v1","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07744","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"VBXDZB6Y3QTY","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"VBXDZB6Y3QTYBIFC","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"VBXDZB6Y","created_at":"2026-07-05T01:37:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VBXDZB6Y3QTYBIFC7NSPETKDTO","target":"record","payload":{"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"},"canonical_sha256":"a86e3c87d8dc2780a0a2fb64f24d439bb83d912584d2ceb2fdb0fb79aa580af5","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"},"source_kind":"arxiv","source_id":"2001.07744","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-07-05T01:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iF9Y4Q9p4Ko5adDi7OJKvPBVF50w9kxfRjgxCCUEfZH90mTUFSehzfqDRq6vlgo3v8sdyniVWiie8Ic9BT5RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:02:49.895133Z"},"content_sha256":"d50efae2eba3a4ad2339bc4ace7a06dd6012f5cbcf8a82f17ddc0f76a1448d6f","schema_version":"1.0","event_id":"sha256:d50efae2eba3a4ad2339bc4ace7a06dd6012f5cbcf8a82f17ddc0f76a1448d6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VBXDZB6Y3QTYBIFC7NSPETKDTO","target":"graph","payload":{"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"},"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-05T01:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPTN4pRVRUFVRPXblhdavv48dUhSkcsbzcly/ZRyoZKMcp+qT5xklqK9q9+wvTsqbxZBEfyK9GsI1SNZo3BbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:02:49.895517Z"},"content_sha256":"dbc570edbf7f78aa8fc76159453dd23b9203d30f9382a97bebc626e82e4809e6","schema_version":"1.0","event_id":"sha256:dbc570edbf7f78aa8fc76159453dd23b9203d30f9382a97bebc626e82e4809e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/bundle.json","state_url":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/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-07-06T19:02:49Z","links":{"resolver":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO","bundle":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/bundle.json","state":"https://pith.science/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBXDZB6Y3QTYBIFC7NSPETKDTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VBXDZB6Y3QTYBIFC7NSPETKDTO","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":"d38e1908284b48ba45cc4d90d8b065ba3a8033f9c171894ca27f0f214fd32ec0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T19:16:11Z","title_canon_sha256":"87d0ad8ecf8eb8ffef82b4201eca64de43ebfd2ab7b93c90fbab18a89d8283b9"},"schema_version":"1.0","source":{"id":"2001.07744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07744","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07744v1","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07744","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"VBXDZB6Y3QTY","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"VBXDZB6Y3QTYBIFC","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"VBXDZB6Y","created_at":"2026-07-05T01:37:33Z"}],"graph_snapshots":[{"event_id":"sha256:dbc570edbf7f78aa8fc76159453dd23b9203d30f9382a97bebc626e82e4809e6","target":"graph","created_at":"2026-07-05T01:37:33Z","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/2001.07744/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Erez Shmueli, Lihi Dery","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T19:16:11Z","title":"Improving Label Ranking Ensembles using Boosting Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07744","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:d50efae2eba3a4ad2339bc4ace7a06dd6012f5cbcf8a82f17ddc0f76a1448d6f","target":"record","created_at":"2026-07-05T01:37:33Z","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":"d38e1908284b48ba45cc4d90d8b065ba3a8033f9c171894ca27f0f214fd32ec0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T19:16:11Z","title_canon_sha256":"87d0ad8ecf8eb8ffef82b4201eca64de43ebfd2ab7b93c90fbab18a89d8283b9"},"schema_version":"1.0","source":{"id":"2001.07744","kind":"arxiv","version":1}},"canonical_sha256":"a86e3c87d8dc2780a0a2fb64f24d439bb83d912584d2ceb2fdb0fb79aa580af5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a86e3c87d8dc2780a0a2fb64f24d439bb83d912584d2ceb2fdb0fb79aa580af5","first_computed_at":"2026-07-05T01:37:33.915674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:33.915674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RHHAWe++SrAB0LT7sc5HtnmCL/YRdWVuihV39Op7xcPMKq7iV8cWUQSCF8LMkQ7TtA4DVgRBBNKhMkaarjfFDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:33.916147Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.07744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d50efae2eba3a4ad2339bc4ace7a06dd6012f5cbcf8a82f17ddc0f76a1448d6f","sha256:dbc570edbf7f78aa8fc76159453dd23b9203d30f9382a97bebc626e82e4809e6"],"state_sha256":"54f27f3380ab1f0fd4fae26061a2da315f9386d94b0545d208bbb4fe07571742"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBAF4Yhxqf8D37v9PnV8Aw9F6FqJykZ8I1GqbXBwmKqItDInC6d+JPDvk0P0JorfrnMBfifBeB3bG3j96KOkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:02:49.897584Z","bundle_sha256":"501e00696842eda424037501674a591d9bd1906a2c72e0f4413f7064214135cd"}}