{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:A56FAJIO3RP2VPHGGKYBCOY3IX","short_pith_number":"pith:A56FAJIO","schema_version":"1.0","canonical_sha256":"077c50250edc5faabce632b0113b1b45d26ff2e386861adc562b6c65b337def4","source":{"kind":"arxiv","id":"1909.04904","version":1},"attestation_state":"computed","paper":{"title":"Factorized MultiClass Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anton Ermilov, Igor E. Kuralenok, Ruslan Solovev, Yurii Rebryk","submitted_at":"2019-09-11T08:18:16Z","abstract_excerpt":"In this paper, we introduce a new approach to multiclass classification problem. We decompose the problem into a series of regression tasks, that are solved with CART trees. The proposed method works significantly faster than state-of-the-art solutions while giving the same level of model quality. The algorithm is also robust to imbalanced datasets, allowing to reach high-quality results in significantly less time without class re-balancing."},"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":"1909.04904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-11T08:18:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ceb8c7a9eaf9d2ebcb8627a33535791b6ad829a6e37ba42cff223480c508ae8c","abstract_canon_sha256":"3df0ad80f81090c7c691572f08e553bd7e34cbbb733f0d429070f0c2fdeb2733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:01.411304Z","signature_b64":"PksIV1jwDdiNz3gNxJeUlHIe5vbs1a6AEofNRHDRlsqv2FTlqyUMAlD120bqJU48DdMFVLxEvZZS1WE+7bUgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"077c50250edc5faabce632b0113b1b45d26ff2e386861adc562b6c65b337def4","last_reissued_at":"2026-07-05T00:04:01.410956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:01.410956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorized MultiClass Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anton Ermilov, Igor E. Kuralenok, Ruslan Solovev, Yurii Rebryk","submitted_at":"2019-09-11T08:18:16Z","abstract_excerpt":"In this paper, we introduce a new approach to multiclass classification problem. We decompose the problem into a series of regression tasks, that are solved with CART trees. The proposed method works significantly faster than state-of-the-art solutions while giving the same level of model quality. The algorithm is also robust to imbalanced datasets, allowing to reach high-quality results in significantly less time without class re-balancing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.04904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.04904","created_at":"2026-07-05T00:04:01.411019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04904v1","created_at":"2026-07-05T00:04:01.411019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04904","created_at":"2026-07-05T00:04:01.411019+00:00"},{"alias_kind":"pith_short_12","alias_value":"A56FAJIO3RP2","created_at":"2026-07-05T00:04:01.411019+00:00"},{"alias_kind":"pith_short_16","alias_value":"A56FAJIO3RP2VPHG","created_at":"2026-07-05T00:04:01.411019+00:00"},{"alias_kind":"pith_short_8","alias_value":"A56FAJIO","created_at":"2026-07-05T00:04:01.411019+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/A56FAJIO3RP2VPHGGKYBCOY3IX","json":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX.json","graph_json":"https://pith.science/api/pith-number/A56FAJIO3RP2VPHGGKYBCOY3IX/graph.json","events_json":"https://pith.science/api/pith-number/A56FAJIO3RP2VPHGGKYBCOY3IX/events.json","paper":"https://pith.science/paper/A56FAJIO"},"agent_actions":{"view_html":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX","download_json":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX.json","view_paper":"https://pith.science/paper/A56FAJIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04904&json=true","fetch_graph":"https://pith.science/api/pith-number/A56FAJIO3RP2VPHGGKYBCOY3IX/graph.json","fetch_events":"https://pith.science/api/pith-number/A56FAJIO3RP2VPHGGKYBCOY3IX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX/action/storage_attestation","attest_author":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX/action/author_attestation","sign_citation":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX/action/citation_signature","submit_replication":"https://pith.science/pith/A56FAJIO3RP2VPHGGKYBCOY3IX/action/replication_record"}},"created_at":"2026-07-05T00:04:01.411019+00:00","updated_at":"2026-07-05T00:04:01.411019+00:00"}