{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IE24NNDVVQ5ZLLAQHIM4RXMWQE","short_pith_number":"pith:IE24NNDV","canonical_record":{"source":{"id":"1605.05223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T16:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"80941cf9d1b3bcb767614ca9b5ae1b96adb04d7091f974c878363a1c5168e780","abstract_canon_sha256":"50ae039e04b84fe77d7e04ddd6522ce35e3f32bf3a9116e3f83871c78036e7bc"},"schema_version":"1.0"},"canonical_sha256":"4135c6b475ac3b95ac103a19c8dd968127628b04875131b2379ebd8bf7532713","source":{"kind":"arxiv","id":"1605.05223","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05223","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05223v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05223","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"IE24NNDVVQ5Z","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IE24NNDVVQ5ZLLAQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IE24NNDV","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IE24NNDVVQ5ZLLAQHIM4RXMWQE","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T16:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"80941cf9d1b3bcb767614ca9b5ae1b96adb04d7091f974c878363a1c5168e780","abstract_canon_sha256":"50ae039e04b84fe77d7e04ddd6522ce35e3f32bf3a9116e3f83871c78036e7bc"},"schema_version":"1.0"},"canonical_sha256":"4135c6b475ac3b95ac103a19c8dd968127628b04875131b2379ebd8bf7532713","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.032223Z","signature_b64":"RtWNrbBC4Dd44JgkFT0uXDxYiscBXUPwQ+FrNlRCfdHl2gbDl1QTADqunVnRA7hr2H09IBFsZXq9w8qc0ajYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4135c6b475ac3b95ac103a19c8dd968127628b04875131b2379ebd8bf7532713","last_reissued_at":"2026-05-18T01:14:37.031433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.031433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05223","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-18T01:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xwybZwTKPoxQ/HjPgXNZ3/wYwEzvLf8HMN1igTMxOZpnsIaW4kZzCUfEkvpWOBEAOutXhiS+0Kg903Vl3vNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:20:46.559266Z"},"content_sha256":"ee42dade08b844f05839861217600aa4273a950d1a079edb0bba00ba7ae04b6c","schema_version":"1.0","event_id":"sha256:ee42dade08b844f05839861217600aa4273a950d1a079edb0bba00ba7ae04b6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IE24NNDVVQ5ZLLAQHIM4RXMWQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the boosting ability of top-down decision tree learning algorithm for multiclass classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, Krzysztof Choromanski, Mariusz Bojarski","submitted_at":"2016-05-17T16:11:36Z","abstract_excerpt":"We analyze the performance of the top-down multiclass classification algorithm for decision tree learning called LOMtree, recently proposed in the literature Choromanska and Langford (2014) for solving efficiently classification problems with very large number of classes. The algorithm online optimizes the objective function which simultaneously controls the depth of the tree and its statistical accuracy. We prove important properties of this objective and explore its connection to three well-known entropy-based decision tree objectives, i.e. Shannon entropy, Gini-entropy and its modified vers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05223","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-18T01:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ico7SKhsuGysjAs9NOw0L80+I66W9pu1wHPdAJ8ouJ/HYOVUS1Gn4lKFhpwSfyCp6HuGoOUm2G1+GjaEZTeaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:20:46.559980Z"},"content_sha256":"8599b0c8d86271e80f9b36429cfa12863e73ec890c97c13243183dbe376ea605","schema_version":"1.0","event_id":"sha256:8599b0c8d86271e80f9b36429cfa12863e73ec890c97c13243183dbe376ea605"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE/bundle.json","state_url":"https://pith.science/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE/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-26T06:20:46Z","links":{"resolver":"https://pith.science/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE","bundle":"https://pith.science/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE/bundle.json","state":"https://pith.science/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IE24NNDVVQ5ZLLAQHIM4RXMWQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IE24NNDVVQ5ZLLAQHIM4RXMWQE","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":"50ae039e04b84fe77d7e04ddd6522ce35e3f32bf3a9116e3f83871c78036e7bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T16:11:36Z","title_canon_sha256":"80941cf9d1b3bcb767614ca9b5ae1b96adb04d7091f974c878363a1c5168e780"},"schema_version":"1.0","source":{"id":"1605.05223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05223","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05223v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05223","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"IE24NNDVVQ5Z","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IE24NNDVVQ5ZLLAQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IE24NNDV","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:8599b0c8d86271e80f9b36429cfa12863e73ec890c97c13243183dbe376ea605","target":"graph","created_at":"2026-05-18T01:14: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"},"paper":{"abstract_excerpt":"We analyze the performance of the top-down multiclass classification algorithm for decision tree learning called LOMtree, recently proposed in the literature Choromanska and Langford (2014) for solving efficiently classification problems with very large number of classes. The algorithm online optimizes the objective function which simultaneously controls the depth of the tree and its statistical accuracy. We prove important properties of this objective and explore its connection to three well-known entropy-based decision tree objectives, i.e. Shannon entropy, Gini-entropy and its modified vers","authors_text":"Anna Choromanska, Krzysztof Choromanski, Mariusz Bojarski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T16:11:36Z","title":"On the boosting ability of top-down decision tree learning algorithm for multiclass classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05223","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:ee42dade08b844f05839861217600aa4273a950d1a079edb0bba00ba7ae04b6c","target":"record","created_at":"2026-05-18T01:14: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":"50ae039e04b84fe77d7e04ddd6522ce35e3f32bf3a9116e3f83871c78036e7bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T16:11:36Z","title_canon_sha256":"80941cf9d1b3bcb767614ca9b5ae1b96adb04d7091f974c878363a1c5168e780"},"schema_version":"1.0","source":{"id":"1605.05223","kind":"arxiv","version":1}},"canonical_sha256":"4135c6b475ac3b95ac103a19c8dd968127628b04875131b2379ebd8bf7532713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4135c6b475ac3b95ac103a19c8dd968127628b04875131b2379ebd8bf7532713","first_computed_at":"2026-05-18T01:14:37.031433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:37.031433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RtWNrbBC4Dd44JgkFT0uXDxYiscBXUPwQ+FrNlRCfdHl2gbDl1QTADqunVnRA7hr2H09IBFsZXq9w8qc0ajYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:37.032223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee42dade08b844f05839861217600aa4273a950d1a079edb0bba00ba7ae04b6c","sha256:8599b0c8d86271e80f9b36429cfa12863e73ec890c97c13243183dbe376ea605"],"state_sha256":"96cc14427a5a9411983fabb7182741d55093e1126818e5b96f9f131ba3393cd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3q+cdD+bQJiSAWVKTOgTIZGtnfpLv3QPoUJyztk4Bo1n0qIVnGjGc8wW6huhWBSgXjYrIn+5vYX22Dcm6GFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:20:46.563988Z","bundle_sha256":"f3787f79c56634cccaba71abc623e6c9389edbd4d126cba456aa8faf86642c64"}}