{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:D5JMM6XZSWN5U63BZ4PR7A735S","short_pith_number":"pith:D5JMM6XZ","canonical_record":{"source":{"id":"1202.3770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b0a81f0d4c0ad77cb5e9cfed732624dc2a40dcaa7814ad3eb6c435414cdccdd9","abstract_canon_sha256":"b0bb9afb871c55b84e04a39aa5c47b012dc51682d7f9c72589cce168c685a9af"},"schema_version":"1.0"},"canonical_sha256":"1f52c67af9959bda7b61cf1f1f83fbec99df73ff7610f8bc5f896c7ff3e3c8ea","source":{"kind":"arxiv","id":"1202.3770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3770","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3770v1","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3770","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"D5JMM6XZSWN5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"D5JMM6XZSWN5U63B","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"D5JMM6XZ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:D5JMM6XZSWN5U63BZ4PR7A735S","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b0a81f0d4c0ad77cb5e9cfed732624dc2a40dcaa7814ad3eb6c435414cdccdd9","abstract_canon_sha256":"b0bb9afb871c55b84e04a39aa5c47b012dc51682d7f9c72589cce168c685a9af"},"schema_version":"1.0"},"canonical_sha256":"1f52c67af9959bda7b61cf1f1f83fbec99df73ff7610f8bc5f896c7ff3e3c8ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:02.880647Z","signature_b64":"vtOInFa2QKoDLpzUTWThR/ugnsz0mEkpDBJPtLAlqUH9gZ1DcQ/dKj5MUKk1zWLP8icV8G4Jb53DCHh7FYSODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f52c67af9959bda7b61cf1f1f83fbec99df73ff7610f8bc5f896c7ff3e3c8ea","last_reissued_at":"2026-05-18T04:02:02.879935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:02.879935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3770","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-18T04:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6Mh3MJKWKFmGUEU6B9BOJPwQ7EirUwVRvtb03W35GufuVUcpR0f4xXTDCQekVTzuP2ewBqyJtit111HVt4fDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:50:10.438020Z"},"content_sha256":"04019864ebebea9dd8a3404f25d2b9b839e09e00b4b0e4ec6ea2e53a8f3abbce","schema_version":"1.0","event_id":"sha256:04019864ebebea9dd8a3404f25d2b9b839e09e00b4b0e4ec6ea2e53a8f3abbce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:D5JMM6XZSWN5U63BZ4PR7A735S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Maximum Margin Learning for Multi-Class Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ivor W. Tsang, Jian-Bo Yang","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class classification problems. The class structure is assumed to be a binary hierarchical tree. To learn such a tree, we propose a maximum separating margin method to determine the child nodes of any internal node. The proposed method ensures that two classgroups represented by any two sib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3770","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-18T04:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rs4KGD/hkkoZZ/RRLS6lBosyV5EOgEKbXeWk+o81BM65p0emihcxC7oKekw8Hz++IZCLVpoM11z3Q0bNWkGSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:50:10.438714Z"},"content_sha256":"c45f287e50fc8da4468699754da6ed4eb427246bddb3603bd1a502bd13172142","schema_version":"1.0","event_id":"sha256:c45f287e50fc8da4468699754da6ed4eb427246bddb3603bd1a502bd13172142"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/bundle.json","state_url":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5JMM6XZSWN5U63BZ4PR7A735S/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-08T01:50:10Z","links":{"resolver":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S","bundle":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/bundle.json","state":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5JMM6XZSWN5U63BZ4PR7A735S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:D5JMM6XZSWN5U63BZ4PR7A735S","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":"b0bb9afb871c55b84e04a39aa5c47b012dc51682d7f9c72589cce168c685a9af","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"b0a81f0d4c0ad77cb5e9cfed732624dc2a40dcaa7814ad3eb6c435414cdccdd9"},"schema_version":"1.0","source":{"id":"1202.3770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3770","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3770v1","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3770","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"D5JMM6XZSWN5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"D5JMM6XZSWN5U63B","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"D5JMM6XZ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c45f287e50fc8da4468699754da6ed4eb427246bddb3603bd1a502bd13172142","target":"graph","created_at":"2026-05-18T04:02:02Z","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":"Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class classification problems. The class structure is assumed to be a binary hierarchical tree. To learn such a tree, we propose a maximum separating margin method to determine the child nodes of any internal node. The proposed method ensures that two classgroups represented by any two sib","authors_text":"Ivor W. Tsang, Jian-Bo Yang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title":"Hierarchical Maximum Margin Learning for Multi-Class Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3770","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:04019864ebebea9dd8a3404f25d2b9b839e09e00b4b0e4ec6ea2e53a8f3abbce","target":"record","created_at":"2026-05-18T04:02:02Z","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":"b0bb9afb871c55b84e04a39aa5c47b012dc51682d7f9c72589cce168c685a9af","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"b0a81f0d4c0ad77cb5e9cfed732624dc2a40dcaa7814ad3eb6c435414cdccdd9"},"schema_version":"1.0","source":{"id":"1202.3770","kind":"arxiv","version":1}},"canonical_sha256":"1f52c67af9959bda7b61cf1f1f83fbec99df73ff7610f8bc5f896c7ff3e3c8ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f52c67af9959bda7b61cf1f1f83fbec99df73ff7610f8bc5f896c7ff3e3c8ea","first_computed_at":"2026-05-18T04:02:02.879935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:02.879935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vtOInFa2QKoDLpzUTWThR/ugnsz0mEkpDBJPtLAlqUH9gZ1DcQ/dKj5MUKk1zWLP8icV8G4Jb53DCHh7FYSODA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:02.880647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04019864ebebea9dd8a3404f25d2b9b839e09e00b4b0e4ec6ea2e53a8f3abbce","sha256:c45f287e50fc8da4468699754da6ed4eb427246bddb3603bd1a502bd13172142"],"state_sha256":"d619716e511624918a8b3c0e3af9136e551b66b1d4858509a2d286a0c66042df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbxDjSPT1cH659SnhgBK2+XYv4WNPJY9xd3cYuyt4wAm0e5FafBSMOxLUriKNjpI8WEEhMROxA+PzMI4lCGDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:50:10.443836Z","bundle_sha256":"88f99e11be0cfec01580887882eb5f1767bcc3c264d160e460b85aeabd6ab8b8"}}