{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IUE7SNBWMPUIYBQYDMSTF3VHUM","short_pith_number":"pith:IUE7SNBW","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"},"canonical_sha256":"4509f9343663e88c06181b2532eea7a33d43cd014a0cc9f38aa27042b8ce1c6a","source":{"kind":"arxiv","id":"1501.03669","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03669","created_at":"2026-05-18T01:24:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03669v5","created_at":"2026-05-18T01:24:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03669","created_at":"2026-05-18T01:24:30Z"},{"alias_kind":"pith_short_12","alias_value":"IUE7SNBWMPUI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IUE7SNBWMPUIYBQY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IUE7SNBW","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IUE7SNBWMPUIYBQYDMSTF3VHUM","target":"record","payload":{"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"},"canonical_sha256":"4509f9343663e88c06181b2532eea7a33d43cd014a0cc9f38aa27042b8ce1c6a","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"},"source_kind":"arxiv","source_id":"1501.03669","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Du1V6R0L9Re+PXvzsnwKFaDv6mwmSWLt8hPdAMKPKH3Yxp6G0nT0zvsv3JargGtffFGoA5HtslUnuSebur/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:41:43.573563Z"},"content_sha256":"fcb7ed201c780551d503ea9c6f31114b0b3198599de75689808742be6f227a31","schema_version":"1.0","event_id":"sha256:fcb7ed201c780551d503ea9c6f31114b0b3198599de75689808742be6f227a31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IUE7SNBWMPUIYBQYDMSTF3VHUM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOoHd3uzbOptNNBh/b7T0TXx9tz1onSMNi0DHiDrJH/0MpGvglVam4UlcE4z15seynHkSp5BWdiiPHSWu4k0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:41:43.573907Z"},"content_sha256":"4aebdb0681ec1242db9acd6206d81a3179cd693c339a1d31f8bb6fc33fd2f487","schema_version":"1.0","event_id":"sha256:4aebdb0681ec1242db9acd6206d81a3179cd693c339a1d31f8bb6fc33fd2f487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/bundle.json","state_url":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T13:41:43Z","links":{"resolver":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM","bundle":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/bundle.json","state":"https://pith.science/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUE7SNBWMPUIYBQYDMSTF3VHUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IUE7SNBWMPUIYBQYDMSTF3VHUM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4e7b6d5cd3b73c37f06b1797750018ea0f8fb9aaca9e51e0111e4db2683b6f3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-15T13:23:14Z","title_canon_sha256":"65110d73909cb2b5886fa63c0b9ef2bf08aa814158cfb2ec209f12c92bae2cec"},"schema_version":"1.0","source":{"id":"1501.03669","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03669","created_at":"2026-05-18T01:24:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03669v5","created_at":"2026-05-18T01:24:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03669","created_at":"2026-05-18T01:24:30Z"},{"alias_kind":"pith_short_12","alias_value":"IUE7SNBWMPUI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IUE7SNBWMPUIYBQY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IUE7SNBW","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:4aebdb0681ec1242db9acd6206d81a3179cd693c339a1d31f8bb6fc33fd2f487","target":"graph","created_at":"2026-05-18T01:24:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"B. Pesquet-Popescu, G. Chierchia, Jean-Christophe Pesquet, Nelly Pustelnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-15T13:23:14Z","title":"A Proximal Approach for Sparse Multiclass SVM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03669","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fcb7ed201c780551d503ea9c6f31114b0b3198599de75689808742be6f227a31","target":"record","created_at":"2026-05-18T01:24:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4e7b6d5cd3b73c37f06b1797750018ea0f8fb9aaca9e51e0111e4db2683b6f3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-15T13:23:14Z","title_canon_sha256":"65110d73909cb2b5886fa63c0b9ef2bf08aa814158cfb2ec209f12c92bae2cec"},"schema_version":"1.0","source":{"id":"1501.03669","kind":"arxiv","version":5}},"canonical_sha256":"4509f9343663e88c06181b2532eea7a33d43cd014a0cc9f38aa27042b8ce1c6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4509f9343663e88c06181b2532eea7a33d43cd014a0cc9f38aa27042b8ce1c6a","first_computed_at":"2026-05-18T01:24:30.454560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:30.454560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IyoCOClV6g+ZFrVdpNIH2WtqDidFYt7j50/T/lC+CpQiExoBqZqgjBRdhAbDEgD94yp1mGcEk8qgzu55ewnaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:30.455042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03669","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcb7ed201c780551d503ea9c6f31114b0b3198599de75689808742be6f227a31","sha256:4aebdb0681ec1242db9acd6206d81a3179cd693c339a1d31f8bb6fc33fd2f487"],"state_sha256":"8bdff3f1dd961ea9f766bb3bcbd5656122c734f2794c03618da5672c7a1b24eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THwUlx9lUcl64qtvKAkP+yF+JGiUU1s03F4AlePqtb4+csToXnm71e7lEJ525KhNMWZPG9DeaUXv0ZT9a+fOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:41:43.575965Z","bundle_sha256":"aa7dc110be6d7df10cb4ae049f08351eb5a550dfd274798f07003faa6f52ff5b"}}