{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MTMCYVSOWC3G3BDTDANBGLNBWK","short_pith_number":"pith:MTMCYVSO","canonical_record":{"source":{"id":"1906.00294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T21:27:36Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"8a681362d8ad3a348ebc94a297fdd3e785248353fd12e7114004d67612cf5877","abstract_canon_sha256":"a2a56c0a0a04f747fc744ae0613e966d50fe4440391606779620252d35c15e6c"},"schema_version":"1.0"},"canonical_sha256":"64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206","source":{"kind":"arxiv","id":"1906.00294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00294","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00294v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00294","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"MTMCYVSOWC3G","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MTMCYVSOWC3G3BDT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MTMCYVSO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MTMCYVSOWC3G3BDTDANBGLNBWK","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T21:27:36Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"8a681362d8ad3a348ebc94a297fdd3e785248353fd12e7114004d67612cf5877","abstract_canon_sha256":"a2a56c0a0a04f747fc744ae0613e966d50fe4440391606779620252d35c15e6c"},"schema_version":"1.0"},"canonical_sha256":"64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:27.544918Z","signature_b64":"i0THw0zWWDgXH048kfAzPqzxRRRiGL0A6eHdiWlWa7CdPpVkhBuYbSbMdWinhFdfxn/85jmFzUN0hB6OqPe6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206","last_reissued_at":"2026-05-17T23:44:27.544265Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:27.544265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00294","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-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xfs/P/ASdtaGIrxTRKCWrt5BGde0SWalmHEJviulV0480YjCqqgOf5FFt9ADg7b6Ps6ye6WZgEdKZuE+hd+FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:29:59.926785Z"},"content_sha256":"fcc82b390034330837b965d1bbf691324f2208edd2de8955bfd6b397d42e7003","schema_version":"1.0","event_id":"sha256:fcc82b390034330837b965d1bbf691324f2208edd2de8955bfd6b397d42e7003"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MTMCYVSOWC3G3BDTDANBGLNBWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the computational complexity of the probabilistic label tree algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Golovnev, Chao Xu, Kalina Jasinska, Krzysztof Dembczynski, Maxim Sviridenko, Mikhail Kuznetsov, Robert Busa-Fekete","submitted_at":"2019-06-01T21:27:36Z","abstract_excerpt":"Label tree-based algorithms are widely used to tackle multi-class and multi-label problems with a large number of labels. We focus on a particular subclass of these algorithms that use probabilistic classifiers in the tree nodes. Examples of such algorithms are hierarchical softmax (HSM), designed for multi-class classification, and probabilistic label trees (PLTs) that generalize HSM to multi-label problems. If the tree structure is given, learning of PLT can be solved with provable regret guaranties [Wydmuch et.al. 2018]. However, to find a tree structure that results in a PLT with a low tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00294","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-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyGYprV7464vEzT5idoECav0hn13vXWHG9ypTEVpTFheTrnLUT0WW0yLdkLK0txKfsWvI5batuRPSb0M/54eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:29:59.927429Z"},"content_sha256":"894d023ee5825d98d2e1c4ba6f104c93e4348a099f6aaec54cb4f4a01a808c40","schema_version":"1.0","event_id":"sha256:894d023ee5825d98d2e1c4ba6f104c93e4348a099f6aaec54cb4f4a01a808c40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTMCYVSOWC3G3BDTDANBGLNBWK/bundle.json","state_url":"https://pith.science/pith/MTMCYVSOWC3G3BDTDANBGLNBWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTMCYVSOWC3G3BDTDANBGLNBWK/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-26T04:29:59Z","links":{"resolver":"https://pith.science/pith/MTMCYVSOWC3G3BDTDANBGLNBWK","bundle":"https://pith.science/pith/MTMCYVSOWC3G3BDTDANBGLNBWK/bundle.json","state":"https://pith.science/pith/MTMCYVSOWC3G3BDTDANBGLNBWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTMCYVSOWC3G3BDTDANBGLNBWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MTMCYVSOWC3G3BDTDANBGLNBWK","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":"a2a56c0a0a04f747fc744ae0613e966d50fe4440391606779620252d35c15e6c","cross_cats_sorted":["cs.CC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T21:27:36Z","title_canon_sha256":"8a681362d8ad3a348ebc94a297fdd3e785248353fd12e7114004d67612cf5877"},"schema_version":"1.0","source":{"id":"1906.00294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00294","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00294v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00294","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"MTMCYVSOWC3G","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MTMCYVSOWC3G3BDT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MTMCYVSO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:894d023ee5825d98d2e1c4ba6f104c93e4348a099f6aaec54cb4f4a01a808c40","target":"graph","created_at":"2026-05-17T23:44:27Z","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":"Label tree-based algorithms are widely used to tackle multi-class and multi-label problems with a large number of labels. We focus on a particular subclass of these algorithms that use probabilistic classifiers in the tree nodes. Examples of such algorithms are hierarchical softmax (HSM), designed for multi-class classification, and probabilistic label trees (PLTs) that generalize HSM to multi-label problems. If the tree structure is given, learning of PLT can be solved with provable regret guaranties [Wydmuch et.al. 2018]. However, to find a tree structure that results in a PLT with a low tra","authors_text":"Alexander Golovnev, Chao Xu, Kalina Jasinska, Krzysztof Dembczynski, Maxim Sviridenko, Mikhail Kuznetsov, Robert Busa-Fekete","cross_cats":["cs.CC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T21:27:36Z","title":"On the computational complexity of the probabilistic label tree algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00294","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:fcc82b390034330837b965d1bbf691324f2208edd2de8955bfd6b397d42e7003","target":"record","created_at":"2026-05-17T23:44:27Z","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":"a2a56c0a0a04f747fc744ae0613e966d50fe4440391606779620252d35c15e6c","cross_cats_sorted":["cs.CC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T21:27:36Z","title_canon_sha256":"8a681362d8ad3a348ebc94a297fdd3e785248353fd12e7114004d67612cf5877"},"schema_version":"1.0","source":{"id":"1906.00294","kind":"arxiv","version":1}},"canonical_sha256":"64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206","first_computed_at":"2026-05-17T23:44:27.544265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:27.544265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i0THw0zWWDgXH048kfAzPqzxRRRiGL0A6eHdiWlWa7CdPpVkhBuYbSbMdWinhFdfxn/85jmFzUN0hB6OqPe6BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:27.544918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcc82b390034330837b965d1bbf691324f2208edd2de8955bfd6b397d42e7003","sha256:894d023ee5825d98d2e1c4ba6f104c93e4348a099f6aaec54cb4f4a01a808c40"],"state_sha256":"a5e78c04b24cf5466cf7d1c37e9aaa775bbbeccf13f99ed06de7b777d21f7df1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFFJ/UrnNCyljAhaTg/O11WEzZZJvrkb6W7UZga3vnPe+biNGVXEmitpycGB6DqtmIHae8UYeSdvZmT1TpyqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:29:59.930302Z","bundle_sha256":"fde37de49035fad50cd591710b681715895c1016ecd97051e15e6ac923a06363"}}