{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B4O7OYF35SMQV25U2ZV5ZG3A7V","short_pith_number":"pith:B4O7OYF3","schema_version":"1.0","canonical_sha256":"0f1df760bbec990aebb4d66bdc9b60fd4add8144b4e9cd50d595bc2a834f85eb","source":{"kind":"arxiv","id":"1312.6086","version":1},"attestation_state":"computed","paper":{"title":"The return of AdaBoost.MH: multi-class Hamming trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bal\\'azs K\\'egl","submitted_at":"2013-12-20T19:33:26Z","abstract_excerpt":"Within the framework of AdaBoost.MH, we propose to train vector-valued decision trees to optimize the multi-class edge without reducing the multi-class problem to $K$ binary one-against-all classifications. The key element of the method is a vector-valued decision stump, factorized into an input-independent vector of length $K$ and label-independent scalar classifier. At inner tree nodes, the label-dependent vector is discarded and the binary classifier can be used for partitioning the input space into two regions. The algorithm retains the conceptual elegance, power, and computational efficie"},"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":"1312.6086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-20T19:33:26Z","cross_cats_sorted":[],"title_canon_sha256":"ea53adf1b774cbdad016d31d9cd4247b5975a30fbb78698d0d3b87bccf835fe3","abstract_canon_sha256":"721121e8a72f542d923031c2793a015e012d664995dd21082c2900c57bf9ba0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.180877Z","signature_b64":"D/FKN3a0hH7Vv2htVLFmLsdgJ/brvnGI+Hj63N7mxZ0DVU/w8R1JullW9EwZ42cvS32d2xq7l9Ohn4ux7CY8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1df760bbec990aebb4d66bdc9b60fd4add8144b4e9cd50d595bc2a834f85eb","last_reissued_at":"2026-05-18T03:04:07.180238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.180238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The return of AdaBoost.MH: multi-class Hamming trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bal\\'azs K\\'egl","submitted_at":"2013-12-20T19:33:26Z","abstract_excerpt":"Within the framework of AdaBoost.MH, we propose to train vector-valued decision trees to optimize the multi-class edge without reducing the multi-class problem to $K$ binary one-against-all classifications. The key element of the method is a vector-valued decision stump, factorized into an input-independent vector of length $K$ and label-independent scalar classifier. At inner tree nodes, the label-dependent vector is discarded and the binary classifier can be used for partitioning the input space into two regions. The algorithm retains the conceptual elegance, power, and computational efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6086","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":"1312.6086","created_at":"2026-05-18T03:04:07.180332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6086v1","created_at":"2026-05-18T03:04:07.180332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6086","created_at":"2026-05-18T03:04:07.180332+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4O7OYF35SMQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4O7OYF35SMQV25U","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4O7OYF3","created_at":"2026-05-18T12:27:38.830355+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/B4O7OYF35SMQV25U2ZV5ZG3A7V","json":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V.json","graph_json":"https://pith.science/api/pith-number/B4O7OYF35SMQV25U2ZV5ZG3A7V/graph.json","events_json":"https://pith.science/api/pith-number/B4O7OYF35SMQV25U2ZV5ZG3A7V/events.json","paper":"https://pith.science/paper/B4O7OYF3"},"agent_actions":{"view_html":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V","download_json":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V.json","view_paper":"https://pith.science/paper/B4O7OYF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6086&json=true","fetch_graph":"https://pith.science/api/pith-number/B4O7OYF35SMQV25U2ZV5ZG3A7V/graph.json","fetch_events":"https://pith.science/api/pith-number/B4O7OYF35SMQV25U2ZV5ZG3A7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V/action/storage_attestation","attest_author":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V/action/author_attestation","sign_citation":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V/action/citation_signature","submit_replication":"https://pith.science/pith/B4O7OYF35SMQV25U2ZV5ZG3A7V/action/replication_record"}},"created_at":"2026-05-18T03:04:07.180332+00:00","updated_at":"2026-05-18T03:04:07.180332+00:00"}