{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7EHWQ6E46KULWY5KGEXSWTFWTF","short_pith_number":"pith:7EHWQ6E4","canonical_record":{"source":{"id":"2009.11218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-23T15:30:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4402ccf98debdcd19ce2bad0bb4892aed3e5054f8c52b354c39b5a43d5b23ee3","abstract_canon_sha256":"7b846131f4c49b70469638854db55fed257ac6cb2b34f8fd660bb24aecf2ab4d"},"schema_version":"1.0"},"canonical_sha256":"f90f68789cf2a8bb63aa312f2b4cb6994b49fb034fd4e19491ee72b9718540d3","source":{"kind":"arxiv","id":"2009.11218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11218","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11218v1","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11218","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"7EHWQ6E46KUL","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"pith_short_16","alias_value":"7EHWQ6E46KULWY5K","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"pith_short_8","alias_value":"7EHWQ6E4","created_at":"2026-07-05T01:37:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7EHWQ6E46KULWY5KGEXSWTFWTF","target":"record","payload":{"canonical_record":{"source":{"id":"2009.11218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-23T15:30:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4402ccf98debdcd19ce2bad0bb4892aed3e5054f8c52b354c39b5a43d5b23ee3","abstract_canon_sha256":"7b846131f4c49b70469638854db55fed257ac6cb2b34f8fd660bb24aecf2ab4d"},"schema_version":"1.0"},"canonical_sha256":"f90f68789cf2a8bb63aa312f2b4cb6994b49fb034fd4e19491ee72b9718540d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:37.215791Z","signature_b64":"n7tbbQfK4HLgHBzPkuaI3qXoNA6/hJd3tzDQ6/2S8xzOn1o4zUXNW4bxynlkHO9TnSY+/+2t2GTEBD36c6cUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f90f68789cf2a8bb63aa312f2b4cb6994b49fb034fd4e19491ee72b9718540d3","last_reissued_at":"2026-07-05T01:37:37.215309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:37.215309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.11218","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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOzL+psF0URNl7xC6jcuDv3eihwHIJxbOFVqZ+RCbHn/ZwJQVLI+/fqd57hQ0spI8z3eKdgg+aYnu+kzhK0GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:14:12.877866Z"},"content_sha256":"ed21f5be69b807c4088396bfd8f482c995e244098d8b1a5cc1383c86218f498c","schema_version":"1.0","event_id":"sha256:ed21f5be69b807c4088396bfd8f482c995e244098d8b1a5cc1383c86218f498c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7EHWQ6E46KULWY5KGEXSWTFWTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Label Trees for 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-Kobus, Krzysztof Dembczynski, Marek Wydmuch, Mikhail Kuznetsov, Robert Busa-Fekete","submitted_at":"2020-09-23T15:30:00Z","abstract_excerpt":"Extreme multi-label classification (XMLC) is a learning task of tagging instances with a small subset of relevant labels chosen from an extremely large pool of possible labels. Problems of this scale can be efficiently handled by organizing labels as a tree, like in hierarchical softmax used for multi-class problems. In this paper, we thoroughly investigate probabilistic label trees (PLTs) which can be treated as a generalization of hierarchical softmax for multi-label problems. We first introduce the PLT model and discuss training and inference procedures and their computational costs. Next, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11218","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/2009.11218/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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAqoNYm7SWiCH3fKcA+91O3inNpbR+P19O4azI2RpU1dQi2kg2oxIGTC/3tHYgtzBA5d9iSbLnjqSX0BxUU7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:14:12.878421Z"},"content_sha256":"6e7c603a60361ddda83a29586b48b59561fadc5c7daa65352647958626f36193","schema_version":"1.0","event_id":"sha256:6e7c603a60361ddda83a29586b48b59561fadc5c7daa65352647958626f36193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EHWQ6E46KULWY5KGEXSWTFWTF/bundle.json","state_url":"https://pith.science/pith/7EHWQ6E46KULWY5KGEXSWTFWTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EHWQ6E46KULWY5KGEXSWTFWTF/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-08-03T17:14:12Z","links":{"resolver":"https://pith.science/pith/7EHWQ6E46KULWY5KGEXSWTFWTF","bundle":"https://pith.science/pith/7EHWQ6E46KULWY5KGEXSWTFWTF/bundle.json","state":"https://pith.science/pith/7EHWQ6E46KULWY5KGEXSWTFWTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EHWQ6E46KULWY5KGEXSWTFWTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7EHWQ6E46KULWY5KGEXSWTFWTF","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":"7b846131f4c49b70469638854db55fed257ac6cb2b34f8fd660bb24aecf2ab4d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-23T15:30:00Z","title_canon_sha256":"4402ccf98debdcd19ce2bad0bb4892aed3e5054f8c52b354c39b5a43d5b23ee3"},"schema_version":"1.0","source":{"id":"2009.11218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11218","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11218v1","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11218","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"7EHWQ6E46KUL","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"pith_short_16","alias_value":"7EHWQ6E46KULWY5K","created_at":"2026-07-05T01:37:37Z"},{"alias_kind":"pith_short_8","alias_value":"7EHWQ6E4","created_at":"2026-07-05T01:37:37Z"}],"graph_snapshots":[{"event_id":"sha256:6e7c603a60361ddda83a29586b48b59561fadc5c7daa65352647958626f36193","target":"graph","created_at":"2026-07-05T01:37:37Z","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/2009.11218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Extreme multi-label classification (XMLC) is a learning task of tagging instances with a small subset of relevant labels chosen from an extremely large pool of possible labels. Problems of this scale can be efficiently handled by organizing labels as a tree, like in hierarchical softmax used for multi-class problems. In this paper, we thoroughly investigate probabilistic label trees (PLTs) which can be treated as a generalization of hierarchical softmax for multi-label problems. We first introduce the PLT model and discuss training and inference procedures and their computational costs. Next, ","authors_text":"Kalina Jasinska-Kobus, Krzysztof Dembczynski, Marek Wydmuch, Mikhail Kuznetsov, Robert Busa-Fekete","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-23T15:30:00Z","title":"Probabilistic Label Trees for Extreme Multi-label Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11218","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:ed21f5be69b807c4088396bfd8f482c995e244098d8b1a5cc1383c86218f498c","target":"record","created_at":"2026-07-05T01:37:37Z","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":"7b846131f4c49b70469638854db55fed257ac6cb2b34f8fd660bb24aecf2ab4d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-23T15:30:00Z","title_canon_sha256":"4402ccf98debdcd19ce2bad0bb4892aed3e5054f8c52b354c39b5a43d5b23ee3"},"schema_version":"1.0","source":{"id":"2009.11218","kind":"arxiv","version":1}},"canonical_sha256":"f90f68789cf2a8bb63aa312f2b4cb6994b49fb034fd4e19491ee72b9718540d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f90f68789cf2a8bb63aa312f2b4cb6994b49fb034fd4e19491ee72b9718540d3","first_computed_at":"2026-07-05T01:37:37.215309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:37.215309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n7tbbQfK4HLgHBzPkuaI3qXoNA6/hJd3tzDQ6/2S8xzOn1o4zUXNW4bxynlkHO9TnSY+/+2t2GTEBD36c6cUAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:37.215791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed21f5be69b807c4088396bfd8f482c995e244098d8b1a5cc1383c86218f498c","sha256:6e7c603a60361ddda83a29586b48b59561fadc5c7daa65352647958626f36193"],"state_sha256":"450d0ba6a5cfa26ba357e2d6d447f7aff457405a6f9659491457f82983436240"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtLNWvMzf/60Znqfy1UrNvcXQFzO91oTy7SQ1RjlJxZjqVgymLjGG1WKh5xoV6d49e89c8dP63uPuO4ZarrUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:14:12.881993Z","bundle_sha256":"7a7dbc2b986cb24cd2b376c390fbd7c49c559bce8987739c2971cdb3e0a569c2"}}