{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D5JMM6XZSWN5U63BZ4PR7A735S","short_pith_number":"pith:D5JMM6XZ","schema_version":"1.0","canonical_sha256":"1f52c67af9959bda7b61cf1f1f83fbec99df73ff7610f8bc5f896c7ff3e3c8ea","source":{"kind":"arxiv","id":"1202.3770","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.3770","created_at":"2026-05-18T04:02:02.880058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3770v1","created_at":"2026-05-18T04:02:02.880058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3770","created_at":"2026-05-18T04:02:02.880058+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5JMM6XZSWN5","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5JMM6XZSWN5U63B","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5JMM6XZ","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S","json":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S.json","graph_json":"https://pith.science/api/pith-number/D5JMM6XZSWN5U63BZ4PR7A735S/graph.json","events_json":"https://pith.science/api/pith-number/D5JMM6XZSWN5U63BZ4PR7A735S/events.json","paper":"https://pith.science/paper/D5JMM6XZ"},"agent_actions":{"view_html":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S","download_json":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S.json","view_paper":"https://pith.science/paper/D5JMM6XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3770&json=true","fetch_graph":"https://pith.science/api/pith-number/D5JMM6XZSWN5U63BZ4PR7A735S/graph.json","fetch_events":"https://pith.science/api/pith-number/D5JMM6XZSWN5U63BZ4PR7A735S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/action/storage_attestation","attest_author":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/action/author_attestation","sign_citation":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/action/citation_signature","submit_replication":"https://pith.science/pith/D5JMM6XZSWN5U63BZ4PR7A735S/action/replication_record"}},"created_at":"2026-05-18T04:02:02.880058+00:00","updated_at":"2026-05-18T04:02:02.880058+00:00"}