{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3GTZUA6M6Q7OBAGFALXAEZ537T","short_pith_number":"pith:3GTZUA6M","canonical_record":{"source":{"id":"1406.1822","kind":"arxiv","version":13},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T21:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"4d487f701b3523b34e66f278ee16caaecd4986438da9cc1f1027cb0187b7a97b","abstract_canon_sha256":"a9768bda14afdcfd370e359544da967cd9eb8c07bdd26d520e520c1efe52d464"},"schema_version":"1.0"},"canonical_sha256":"d9a79a03ccf43ee080c502ee0267bbfcd0a5289e16aaf6a81cc54ef0858c0494","source":{"kind":"arxiv","id":"1406.1822","version":13},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1822","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1822v13","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1822","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"3GTZUA6M6Q7O","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GTZUA6M6Q7OBAGF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GTZUA6M","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3GTZUA6M6Q7OBAGFALXAEZ537T","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1822","kind":"arxiv","version":13},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T21:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"4d487f701b3523b34e66f278ee16caaecd4986438da9cc1f1027cb0187b7a97b","abstract_canon_sha256":"a9768bda14afdcfd370e359544da967cd9eb8c07bdd26d520e520c1efe52d464"},"schema_version":"1.0"},"canonical_sha256":"d9a79a03ccf43ee080c502ee0267bbfcd0a5289e16aaf6a81cc54ef0858c0494","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.385601Z","signature_b64":"7ZJUEoRCTHep6CDMQjJaMGp1vEsfqRWEEsNdvSb6r++O/lEuCh/xArdM6kCAyOxttA+F3m6nRUQM1tfp7l+fAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a79a03ccf43ee080c502ee0267bbfcd0a5289e16aaf6a81cc54ef0858c0494","last_reissued_at":"2026-05-18T01:26:58.384936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.384936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1822","source_version":13,"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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0E0EdhG7SaTvZFA+RpyzQpGQej6Wl0SRHkRYpZrudFPxr76ahPxEXSIR+RsKoY6k7R9xA/FFAqm9RALILIsyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:18:24.932658Z"},"content_sha256":"d91f1415ffc5588f4c0cc3a264adcecbcb52ab54b81adf77f4f8c5ae2e50a90b","schema_version":"1.0","event_id":"sha256:d91f1415ffc5588f4c0cc3a264adcecbcb52ab54b81adf77f4f8c5ae2e50a90b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3GTZUA6M6Q7OBAGFALXAEZ537T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logarithmic Time Online Multiclass prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, John Langford","submitted_at":"2014-06-06T21:52:25Z","abstract_excerpt":"We study the problem of multiclass classification with an extremely large number of classes (k), with the goal of obtaining train and test time complexity logarithmic in the number of classes. We develop top-down tree construction approaches for constructing logarithmic depth trees. On the theoretical front, we formulate a new objective function, which is optimized at each node of the tree and creates dynamic partitions of the data which are both pure (in terms of class labels) and balanced. We demonstrate that under favorable conditions, we can construct logarithmic depth trees that have leav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1822","kind":"arxiv","version":13},"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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rwYBxnR1cvyXyYGYb2aqHwBNXJS5rpF//Fhz3TaU5Osr53odRBFKETLI8FAG+qQrNg1GjhEXWHpYnt9MNGjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:18:24.933337Z"},"content_sha256":"fa352b7baef5c4d8efacd4caed6edec6a63bda1726075eaf0dfb18a039c93b8c","schema_version":"1.0","event_id":"sha256:fa352b7baef5c4d8efacd4caed6edec6a63bda1726075eaf0dfb18a039c93b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GTZUA6M6Q7OBAGFALXAEZ537T/bundle.json","state_url":"https://pith.science/pith/3GTZUA6M6Q7OBAGFALXAEZ537T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GTZUA6M6Q7OBAGFALXAEZ537T/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-27T10:18:24Z","links":{"resolver":"https://pith.science/pith/3GTZUA6M6Q7OBAGFALXAEZ537T","bundle":"https://pith.science/pith/3GTZUA6M6Q7OBAGFALXAEZ537T/bundle.json","state":"https://pith.science/pith/3GTZUA6M6Q7OBAGFALXAEZ537T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GTZUA6M6Q7OBAGFALXAEZ537T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3GTZUA6M6Q7OBAGFALXAEZ537T","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":"a9768bda14afdcfd370e359544da967cd9eb8c07bdd26d520e520c1efe52d464","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T21:52:25Z","title_canon_sha256":"4d487f701b3523b34e66f278ee16caaecd4986438da9cc1f1027cb0187b7a97b"},"schema_version":"1.0","source":{"id":"1406.1822","kind":"arxiv","version":13}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1822","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1822v13","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1822","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"3GTZUA6M6Q7O","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GTZUA6M6Q7OBAGF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GTZUA6M","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:fa352b7baef5c4d8efacd4caed6edec6a63bda1726075eaf0dfb18a039c93b8c","target":"graph","created_at":"2026-05-18T01:26:58Z","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 study the problem of multiclass classification with an extremely large number of classes (k), with the goal of obtaining train and test time complexity logarithmic in the number of classes. We develop top-down tree construction approaches for constructing logarithmic depth trees. On the theoretical front, we formulate a new objective function, which is optimized at each node of the tree and creates dynamic partitions of the data which are both pure (in terms of class labels) and balanced. We demonstrate that under favorable conditions, we can construct logarithmic depth trees that have leav","authors_text":"Anna Choromanska, John Langford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T21:52:25Z","title":"Logarithmic Time Online Multiclass prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1822","kind":"arxiv","version":13},"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:d91f1415ffc5588f4c0cc3a264adcecbcb52ab54b81adf77f4f8c5ae2e50a90b","target":"record","created_at":"2026-05-18T01:26:58Z","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":"a9768bda14afdcfd370e359544da967cd9eb8c07bdd26d520e520c1efe52d464","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T21:52:25Z","title_canon_sha256":"4d487f701b3523b34e66f278ee16caaecd4986438da9cc1f1027cb0187b7a97b"},"schema_version":"1.0","source":{"id":"1406.1822","kind":"arxiv","version":13}},"canonical_sha256":"d9a79a03ccf43ee080c502ee0267bbfcd0a5289e16aaf6a81cc54ef0858c0494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9a79a03ccf43ee080c502ee0267bbfcd0a5289e16aaf6a81cc54ef0858c0494","first_computed_at":"2026-05-18T01:26:58.384936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:58.384936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZJUEoRCTHep6CDMQjJaMGp1vEsfqRWEEsNdvSb6r++O/lEuCh/xArdM6kCAyOxttA+F3m6nRUQM1tfp7l+fAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:58.385601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1822","source_kind":"arxiv","source_version":13}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d91f1415ffc5588f4c0cc3a264adcecbcb52ab54b81adf77f4f8c5ae2e50a90b","sha256:fa352b7baef5c4d8efacd4caed6edec6a63bda1726075eaf0dfb18a039c93b8c"],"state_sha256":"a555fb6d766a29d70110911f7d25e38f02322febaad5cddeb3af2eaff78ceacd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpffgPFWzyoHZTBCgpbdXW/3KCOaKEZnVUxmZ/ZpSx6Z5vuSltSNzO3v8lu9V0GAVM4Ol43B7NsCUwJMzS0rDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:18:24.936834Z","bundle_sha256":"be2a5235db5d89566df19a9015c1f21c3780010f6a1b1e9056a648e1710c69ee"}}