{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XOKHQYLJXZPP3UZO2TKEHOW2IM","short_pith_number":"pith:XOKHQYLJ","canonical_record":{"source":{"id":"1710.08079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T03:19:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8b9ae4beadda8328a4d32a707fb308fcc8769b6e3ac94b4be95bcdc40362a418","abstract_canon_sha256":"c331c4762f0fae0d3ebfe12e3b20af98db51ba7c8b435739770f6994c154ff4c"},"schema_version":"1.0"},"canonical_sha256":"bb94786169be5efdd32ed4d443bada431b8df8a5e9fbe44b5a02dbb4a8101bbf","source":{"kind":"arxiv","id":"1710.08079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08079","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08079v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08079","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"XOKHQYLJXZPP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XOKHQYLJXZPP3UZO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XOKHQYLJ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XOKHQYLJXZPP3UZO2TKEHOW2IM","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T03:19:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8b9ae4beadda8328a4d32a707fb308fcc8769b6e3ac94b4be95bcdc40362a418","abstract_canon_sha256":"c331c4762f0fae0d3ebfe12e3b20af98db51ba7c8b435739770f6994c154ff4c"},"schema_version":"1.0"},"canonical_sha256":"bb94786169be5efdd32ed4d443bada431b8df8a5e9fbe44b5a02dbb4a8101bbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.352280Z","signature_b64":"U2mrbJPpVaH78NufC5R9hYAwKJ+BPJAsuprmy1CiVTleDbU5vyE+YLzBTIX0o3sEQinnVcSlps7JE8VOseUeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb94786169be5efdd32ed4d443bada431b8df8a5e9fbe44b5a02dbb4a8101bbf","last_reissued_at":"2026-05-18T00:22:39.351938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.351938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08079","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-05-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4/OqoWuVJYEKH53gihTxNZjE2ZABLk82G3T9nKFEIPj7l4GRQ/w/yjyIyyPkJIX/n0CIlW7IFBMd6SlA7fUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:37:57.216098Z"},"content_sha256":"ecb51c41c4f365c3e227bb8bfeea5d6795fd261544c08143aaf0e8698149feac","schema_version":"1.0","event_id":"sha256:ecb51c41c4f365c3e227bb8bfeea5d6795fd261544c08143aaf0e8698149feac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XOKHQYLJXZPP3UZO2TKEHOW2IM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Boosting Algorithms for Multi-label Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Young Hun Jung","submitted_at":"2017-10-23T03:19:58Z","abstract_excerpt":"We consider the multi-label ranking approach to multi-label learning. Boosting is a natural method for multi-label ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for multi-label ranking. We show that our first algorithm is optimal in terms of the number of learners required to attain a desired accuracy, but it requires knowledge of the edge of the weak learners. We also design an adaptive algorithm that does not require this knowledge and is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08079","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":""},"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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZH1652cEJAyIAo3DLAZD7Azo6Ek3jKXyDHBWIanVbMxag661lcLbrhiUYVwSYnJY+P1zOcihysj9W/HbwxfsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:37:57.216924Z"},"content_sha256":"ee5e6cda4db84840af590b422d1a1c8cd60af8a2353b479f2425cb9dc9943d72","schema_version":"1.0","event_id":"sha256:ee5e6cda4db84840af590b422d1a1c8cd60af8a2353b479f2425cb9dc9943d72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM/bundle.json","state_url":"https://pith.science/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM/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-31T19:37:57Z","links":{"resolver":"https://pith.science/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM","bundle":"https://pith.science/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM/bundle.json","state":"https://pith.science/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOKHQYLJXZPP3UZO2TKEHOW2IM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XOKHQYLJXZPP3UZO2TKEHOW2IM","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":"c331c4762f0fae0d3ebfe12e3b20af98db51ba7c8b435739770f6994c154ff4c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T03:19:58Z","title_canon_sha256":"8b9ae4beadda8328a4d32a707fb308fcc8769b6e3ac94b4be95bcdc40362a418"},"schema_version":"1.0","source":{"id":"1710.08079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08079","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08079v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08079","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"XOKHQYLJXZPP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XOKHQYLJXZPP3UZO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XOKHQYLJ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:ee5e6cda4db84840af590b422d1a1c8cd60af8a2353b479f2425cb9dc9943d72","target":"graph","created_at":"2026-05-18T00:22:39Z","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":"We consider the multi-label ranking approach to multi-label learning. Boosting is a natural method for multi-label ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for multi-label ranking. We show that our first algorithm is optimal in terms of the number of learners required to attain a desired accuracy, but it requires knowledge of the edge of the weak learners. We also design an adaptive algorithm that does not require this knowledge and is","authors_text":"Ambuj Tewari, Young Hun Jung","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T03:19:58Z","title":"Online Boosting Algorithms for Multi-label Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08079","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:ecb51c41c4f365c3e227bb8bfeea5d6795fd261544c08143aaf0e8698149feac","target":"record","created_at":"2026-05-18T00:22:39Z","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":"c331c4762f0fae0d3ebfe12e3b20af98db51ba7c8b435739770f6994c154ff4c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T03:19:58Z","title_canon_sha256":"8b9ae4beadda8328a4d32a707fb308fcc8769b6e3ac94b4be95bcdc40362a418"},"schema_version":"1.0","source":{"id":"1710.08079","kind":"arxiv","version":2}},"canonical_sha256":"bb94786169be5efdd32ed4d443bada431b8df8a5e9fbe44b5a02dbb4a8101bbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb94786169be5efdd32ed4d443bada431b8df8a5e9fbe44b5a02dbb4a8101bbf","first_computed_at":"2026-05-18T00:22:39.351938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.351938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U2mrbJPpVaH78NufC5R9hYAwKJ+BPJAsuprmy1CiVTleDbU5vyE+YLzBTIX0o3sEQinnVcSlps7JE8VOseUeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.352280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecb51c41c4f365c3e227bb8bfeea5d6795fd261544c08143aaf0e8698149feac","sha256:ee5e6cda4db84840af590b422d1a1c8cd60af8a2353b479f2425cb9dc9943d72"],"state_sha256":"f1eccb7e08018263765bebb20114826b5120f999123c1d778698e9447b4eba5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AsI6gk3PymyYnxAuLPVobcBuqurAb0XMxIhMl2dm3RuQCLWi4BPm5vjhvHPH2xfrI5C4ABW5TAlHpXVK4b7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:37:57.223228Z","bundle_sha256":"667407478919f4a1d74356a8e887d1fde4b27b0c3bfb639acb0f2368d49ff3cd"}}