{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IUE7SNBWMPUIYBQYDMSTF3VHUM","short_pith_number":"pith:IUE7SNBW","schema_version":"1.0","canonical_sha256":"4509f9343663e88c06181b2532eea7a33d43cd014a0cc9f38aa27042b8ce1c6a","source":{"kind":"arxiv","id":"1501.03669","version":5},"attestation_state":"computed","paper":{"title":"A Proximal Approach for Sparse Multiclass SVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"B. Pesquet-Popescu, G. Chierchia, Jean-Christophe Pesquet, Nelly Pustelnik","submitted_at":"2015-01-15T13:23:14Z","abstract_excerpt":"Sparsity-inducing penalties are useful tools to design multiclass support vector machines (SVMs). In this paper, we propose a convex optimization approach for efficiently and exactly solving the multiclass SVM learning problem involving a sparse regularization and the multiclass hinge loss formulated by Crammer and Singer. We provide two algorithms: the first one dealing with the hinge loss as a penalty term, and the other one addressing the case when the hinge loss is enforced through a constraint. The related convex optimization problems can be efficiently solved thanks to the flexibility of"},"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":"1501.03669","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-15T13:23:14Z","cross_cats_sorted":[],"title_canon_sha256":"65110d73909cb2b5886fa63c0b9ef2bf08aa814158cfb2ec209f12c92bae2cec","abstract_canon_sha256":"4e7b6d5cd3b73c37f06b1797750018ea0f8fb9aaca9e51e0111e4db2683b6f3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:30.455042Z","signature_b64":"IyoCOClV6g+ZFrVdpNIH2WtqDidFYt7j50/T/lC+CpQiExoBqZqgjBRdhAbDEgD94yp1mGcEk8qgzu55ewnaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4509f9343663e88c06181b2532eea7a33d43cd014a0cc9f38aa27042b8ce1c6a","last_reissued_at":"2026-05-18T01:24:30.454560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:30.454560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proximal Approach for Sparse Multiclass SVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"B. Pesquet-Popescu, G. Chierchia, Jean-Christophe Pesquet, Nelly Pustelnik","submitted_at":"2015-01-15T13:23:14Z","abstract_excerpt":"Sparsity-inducing penalties are useful tools to design multiclass support vector machines (SVMs). In this paper, we propose a convex optimization approach for efficiently and exactly solving the multiclass SVM learning problem involving a sparse regularization and the multiclass hinge loss formulated by Crammer and Singer. We provide two algorithms: the first one dealing with the hinge loss as a penalty term, and the other one addressing the case when the hinge loss is enforced through a constraint. The related convex optimization problems can be efficiently solved thanks to the flexibility of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03669","kind":"arxiv","version":5},"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":"1501.03669","created_at":"2026-05-18T01:24:30.454632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03669v5","created_at":"2026-05-18T01:24:30.454632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03669","created_at":"2026-05-18T01:24:30.454632+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUE7SNBWMPUI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUE7SNBWMPUIYBQY","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUE7SNBW","created_at":"2026-05-18T12:29:25.134429+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/IUE7SNBWMPUIYBQYDMSTF3VHUM","json":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM.json","graph_json":"https://pith.science/api/pith-number/IUE7SNBWMPUIYBQYDMSTF3VHUM/graph.json","events_json":"https://pith.science/api/pith-number/IUE7SNBWMPUIYBQYDMSTF3VHUM/events.json","paper":"https://pith.science/paper/IUE7SNBW"},"agent_actions":{"view_html":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM","download_json":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM.json","view_paper":"https://pith.science/paper/IUE7SNBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03669&json=true","fetch_graph":"https://pith.science/api/pith-number/IUE7SNBWMPUIYBQYDMSTF3VHUM/graph.json","fetch_events":"https://pith.science/api/pith-number/IUE7SNBWMPUIYBQYDMSTF3VHUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/action/storage_attestation","attest_author":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/action/author_attestation","sign_citation":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/action/citation_signature","submit_replication":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/action/replication_record"}},"created_at":"2026-05-18T01:24:30.454632+00:00","updated_at":"2026-05-18T01:24:30.454632+00:00"}