{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K62DXFIZPKMLYQVYQSRIHITJNZ","short_pith_number":"pith:K62DXFIZ","schema_version":"1.0","canonical_sha256":"57b43b95197a98bc42b884a283a2696e433ece9fd70838932157439d0bdedcbe","source":{"kind":"arxiv","id":"1307.5497","version":1},"attestation_state":"computed","paper":{"title":"A scalable stage-wise approach to large-margin multi-class loss based boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Chunhua Shen, Sakrapee Paisitkriangkrai","submitted_at":"2013-07-21T06:06:13Z","abstract_excerpt":"We present a scalable and effective classification model to train multi-class boosting for multi-class classification problems. Shen and Hao introduced a direct formulation of multi- class boosting in the sense that it directly maximizes the multi- class margin [C. Shen and Z. Hao, \"A direct formulation for totally-corrective multi- class boosting\", in Proc. IEEE Conf. Comp. Vis. Patt. Recogn., 2011]. The major problem of their approach is its high computational complexity for training, which hampers its application on real-world problems. In this work, we propose a scalable and simple stage-w"},"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":"1307.5497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-21T06:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"2d52e3a37416f0d1444cf366c187881045a62fb3ac341e259b1186bed206924d","abstract_canon_sha256":"152f4bd33a935e085ba4b8542f7f55b2f1b741d17d41cc2292f92281a6c1990a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.522937Z","signature_b64":"+qWptsKdoBFsLCR7ikv32EqkJ0bRvg8wKUBKD/HjXNSpjHq+Db1NnT1Fhbs8Bn1zIHywsS/E8A3zu1a9g03LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57b43b95197a98bc42b884a283a2696e433ece9fd70838932157439d0bdedcbe","last_reissued_at":"2026-05-18T03:17:55.522097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.522097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A scalable stage-wise approach to large-margin multi-class loss based boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Chunhua Shen, Sakrapee Paisitkriangkrai","submitted_at":"2013-07-21T06:06:13Z","abstract_excerpt":"We present a scalable and effective classification model to train multi-class boosting for multi-class classification problems. Shen and Hao introduced a direct formulation of multi- class boosting in the sense that it directly maximizes the multi- class margin [C. Shen and Z. Hao, \"A direct formulation for totally-corrective multi- class boosting\", in Proc. IEEE Conf. Comp. Vis. Patt. Recogn., 2011]. The major problem of their approach is its high computational complexity for training, which hampers its application on real-world problems. In this work, we propose a scalable and simple stage-w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5497","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":"1307.5497","created_at":"2026-05-18T03:17:55.522226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5497v1","created_at":"2026-05-18T03:17:55.522226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5497","created_at":"2026-05-18T03:17:55.522226+00:00"},{"alias_kind":"pith_short_12","alias_value":"K62DXFIZPKML","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K62DXFIZPKMLYQVY","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K62DXFIZ","created_at":"2026-05-18T12:27:49.015174+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/K62DXFIZPKMLYQVYQSRIHITJNZ","json":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ.json","graph_json":"https://pith.science/api/pith-number/K62DXFIZPKMLYQVYQSRIHITJNZ/graph.json","events_json":"https://pith.science/api/pith-number/K62DXFIZPKMLYQVYQSRIHITJNZ/events.json","paper":"https://pith.science/paper/K62DXFIZ"},"agent_actions":{"view_html":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ","download_json":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ.json","view_paper":"https://pith.science/paper/K62DXFIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5497&json=true","fetch_graph":"https://pith.science/api/pith-number/K62DXFIZPKMLYQVYQSRIHITJNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/K62DXFIZPKMLYQVYQSRIHITJNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ/action/storage_attestation","attest_author":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ/action/author_attestation","sign_citation":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ/action/citation_signature","submit_replication":"https://pith.science/pith/K62DXFIZPKMLYQVYQSRIHITJNZ/action/replication_record"}},"created_at":"2026-05-18T03:17:55.522226+00:00","updated_at":"2026-05-18T03:17:55.522226+00:00"}