{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X7DQ27KDIWEJDT5NDFUCYXAKE5","short_pith_number":"pith:X7DQ27KD","schema_version":"1.0","canonical_sha256":"bfc70d7d43458891cfad19682c5c0a2770767ea9603b28227f5aa7ad4d49b92a","source":{"kind":"arxiv","id":"1611.08480","version":2},"attestation_state":"computed","paper":{"title":"Distributed Optimization of Multi-Class SVMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Julian Zimmert, Marius Kloft, Maximilian Alber, Urun Dogan","submitted_at":"2016-11-25T15:07:06Z","abstract_excerpt":"Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a quadratic program of size quadratically in the number of classes. We develop distributed algorithms for two all-in-one SVM formulations (Lee et al. and Weston and Watkins) that parallelize the computation evenly over the number of classes. This allows us to compare these models t"},"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":"1611.08480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-25T15:07:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3ea7c8593eeb8c8af7ce84a54adf0acc9f86ba49163588ef21ecec5cb80d019c","abstract_canon_sha256":"cd5eb8894173493b64f787e9c441bdd7d31f2503a63dc4a2f2d09fa605763652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:01.270485Z","signature_b64":"JggnsTsUzM1Rbv1+Tby4fni/osbAUhMTAfovsdbZCBWbz0fXgBAqgKppxsep7zFV9dQIOUncIlTwXXoPZhqGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfc70d7d43458891cfad19682c5c0a2770767ea9603b28227f5aa7ad4d49b92a","last_reissued_at":"2026-05-18T00:41:01.269897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:01.269897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Optimization of Multi-Class SVMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Julian Zimmert, Marius Kloft, Maximilian Alber, Urun Dogan","submitted_at":"2016-11-25T15:07:06Z","abstract_excerpt":"Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a quadratic program of size quadratically in the number of classes. We develop distributed algorithms for two all-in-one SVM formulations (Lee et al. and Weston and Watkins) that parallelize the computation evenly over the number of classes. This allows us to compare these models t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08480","kind":"arxiv","version":2},"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":"1611.08480","created_at":"2026-05-18T00:41:01.269973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08480v2","created_at":"2026-05-18T00:41:01.269973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08480","created_at":"2026-05-18T00:41:01.269973+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7DQ27KDIWEJ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7DQ27KDIWEJDT5N","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7DQ27KD","created_at":"2026-05-18T12:30:51.357362+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/X7DQ27KDIWEJDT5NDFUCYXAKE5","json":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5.json","graph_json":"https://pith.science/api/pith-number/X7DQ27KDIWEJDT5NDFUCYXAKE5/graph.json","events_json":"https://pith.science/api/pith-number/X7DQ27KDIWEJDT5NDFUCYXAKE5/events.json","paper":"https://pith.science/paper/X7DQ27KD"},"agent_actions":{"view_html":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5","download_json":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5.json","view_paper":"https://pith.science/paper/X7DQ27KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08480&json=true","fetch_graph":"https://pith.science/api/pith-number/X7DQ27KDIWEJDT5NDFUCYXAKE5/graph.json","fetch_events":"https://pith.science/api/pith-number/X7DQ27KDIWEJDT5NDFUCYXAKE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5/action/storage_attestation","attest_author":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5/action/author_attestation","sign_citation":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5/action/citation_signature","submit_replication":"https://pith.science/pith/X7DQ27KDIWEJDT5NDFUCYXAKE5/action/replication_record"}},"created_at":"2026-05-18T00:41:01.269973+00:00","updated_at":"2026-05-18T00:41:01.269973+00:00"}