{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XIAJDBXMQ4OIKQNPLWH67NVTOW","short_pith_number":"pith:XIAJDBXM","canonical_record":{"source":{"id":"1810.11671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-27T16:27:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dbef94d1cf3b41e7ffbea3fee8bc75c5cb604368eb719f7b7267d89567256cbf","abstract_canon_sha256":"6b53b59fe9123494c4aa76c22492895762fb9c2a5bbaab15e590302904f6d10e"},"schema_version":"1.0"},"canonical_sha256":"ba009186ec871c8541af5d8fefb6b375a8a7a357d50506e1564460f5f341aed2","source":{"kind":"arxiv","id":"1810.11671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11671","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11671v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11671","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"XIAJDBXMQ4OI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XIAJDBXMQ4OIKQNP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XIAJDBXM","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XIAJDBXMQ4OIKQNPLWH67NVTOW","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-27T16:27:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dbef94d1cf3b41e7ffbea3fee8bc75c5cb604368eb719f7b7267d89567256cbf","abstract_canon_sha256":"6b53b59fe9123494c4aa76c22492895762fb9c2a5bbaab15e590302904f6d10e"},"schema_version":"1.0"},"canonical_sha256":"ba009186ec871c8541af5d8fefb6b375a8a7a357d50506e1564460f5f341aed2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:07.807931Z","signature_b64":"+TaBCJKHwAEi9hdtgyM1wCkCH7uwlH7edPUrfIByhwsodbI5yNLbWE/vjbGX75E2rKABbVETMtXMQj4YE/gLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba009186ec871c8541af5d8fefb6b375a8a7a357d50506e1564460f5f341aed2","last_reissued_at":"2026-05-18T00:02:07.807240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:07.807240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11671","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-05-18T00:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDKtkV0ZOtT3qetP2Cqq7+4wgOiLRyTD1QNv6kU7iTO6egFWoriQQfIsWbZK4nVC4gpUnL7JfB3dYljiINwMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:04:20.555858Z"},"content_sha256":"b0b146225322727db53e47644080528f52def7bfca4f80ef6981edf0f9f563b1","schema_version":"1.0","event_id":"sha256:b0b146225322727db53e47644080528f52def7bfca4f80ef6981edf0f9f563b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XIAJDBXMQ4OIKQNPLWH67NVTOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A no-regret generalization of hierarchical softmax to extreme multi-label classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kalina Jasinska, Krzysztof Dembczy\\'nski, Marek Wydmuch, Mikhail Kuznetsov, R\\'obert Busa-Fekete","submitted_at":"2018-10-27T16:27:18Z","abstract_excerpt":"Extreme multi-label classification (XMLC) is a problem of tagging an instance with a small subset of relevant labels chosen from an extremely large pool of possible labels. Large label spaces can be efficiently handled by organizing labels as a tree, like in the hierarchical softmax (HSM) approach commonly used for multi-class problems. In this paper, we investigate probabilistic label trees (PLTs) that have been recently devised for tackling XMLC problems. We show that PLTs are a no-regret multi-label generalization of HSM when precision@k is used as a model evaluation metric. Critically, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11671","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":""},"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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwGDGIVmld/4nWjuFk578IJQOzMIa0v/sX+rUjRemLKzxAmekKlP4tmxKPrqHT4MLR5wMUpBYLvtZ22G1IVDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:04:20.556454Z"},"content_sha256":"34ef67565a3ba476a9ad97344c6cc68716fe006d8d995cd376335c1ff002a790","schema_version":"1.0","event_id":"sha256:34ef67565a3ba476a9ad97344c6cc68716fe006d8d995cd376335c1ff002a790"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW/bundle.json","state_url":"https://pith.science/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW/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-06-07T10:04:20Z","links":{"resolver":"https://pith.science/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW","bundle":"https://pith.science/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW/bundle.json","state":"https://pith.science/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIAJDBXMQ4OIKQNPLWH67NVTOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XIAJDBXMQ4OIKQNPLWH67NVTOW","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":"6b53b59fe9123494c4aa76c22492895762fb9c2a5bbaab15e590302904f6d10e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-27T16:27:18Z","title_canon_sha256":"dbef94d1cf3b41e7ffbea3fee8bc75c5cb604368eb719f7b7267d89567256cbf"},"schema_version":"1.0","source":{"id":"1810.11671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11671","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11671v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11671","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"XIAJDBXMQ4OI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XIAJDBXMQ4OIKQNP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XIAJDBXM","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:34ef67565a3ba476a9ad97344c6cc68716fe006d8d995cd376335c1ff002a790","target":"graph","created_at":"2026-05-18T00:02:07Z","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":"Extreme multi-label classification (XMLC) is a problem of tagging an instance with a small subset of relevant labels chosen from an extremely large pool of possible labels. Large label spaces can be efficiently handled by organizing labels as a tree, like in the hierarchical softmax (HSM) approach commonly used for multi-class problems. In this paper, we investigate probabilistic label trees (PLTs) that have been recently devised for tackling XMLC problems. We show that PLTs are a no-regret multi-label generalization of HSM when precision@k is used as a model evaluation metric. Critically, we ","authors_text":"Kalina Jasinska, Krzysztof Dembczy\\'nski, Marek Wydmuch, Mikhail Kuznetsov, R\\'obert Busa-Fekete","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-27T16:27:18Z","title":"A no-regret generalization of hierarchical softmax to extreme multi-label classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11671","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:b0b146225322727db53e47644080528f52def7bfca4f80ef6981edf0f9f563b1","target":"record","created_at":"2026-05-18T00:02:07Z","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":"6b53b59fe9123494c4aa76c22492895762fb9c2a5bbaab15e590302904f6d10e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-27T16:27:18Z","title_canon_sha256":"dbef94d1cf3b41e7ffbea3fee8bc75c5cb604368eb719f7b7267d89567256cbf"},"schema_version":"1.0","source":{"id":"1810.11671","kind":"arxiv","version":1}},"canonical_sha256":"ba009186ec871c8541af5d8fefb6b375a8a7a357d50506e1564460f5f341aed2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba009186ec871c8541af5d8fefb6b375a8a7a357d50506e1564460f5f341aed2","first_computed_at":"2026-05-18T00:02:07.807240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:07.807240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TaBCJKHwAEi9hdtgyM1wCkCH7uwlH7edPUrfIByhwsodbI5yNLbWE/vjbGX75E2rKABbVETMtXMQj4YE/gLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:07.807931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b146225322727db53e47644080528f52def7bfca4f80ef6981edf0f9f563b1","sha256:34ef67565a3ba476a9ad97344c6cc68716fe006d8d995cd376335c1ff002a790"],"state_sha256":"0a5884b56854589eb25118fe8ddfe29004ddd97dd11b5a078c5dfead072bc2e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn/Ku0Kp7ePdWXm8OO9MnpC6WE0MMDS9mBGlHJNLmL6zbFphtIgb+Exkc9+oUhWa97DybCDA6dEvl7wC/5WjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:04:20.559995Z","bundle_sha256":"85924abee38a74c5f045de723eae68245b8fcf421df0e3b61b4be39066c897b6"}}