{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X2NPEOC6QRLIIJ7ABQ36QHPQD6","short_pith_number":"pith:X2NPEOC6","schema_version":"1.0","canonical_sha256":"be9af2385e84568427e00c37e81df01fa5745d4093bc0df987a53e3dddc3d71d","source":{"kind":"arxiv","id":"1511.06683","version":1},"attestation_state":"computed","paper":{"title":"Top-k Multiclass SVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernt Schiele, Maksim Lapin, Matthias Hein","submitted_at":"2015-11-20T16:49:33Z","abstract_excerpt":"Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the top-k error instead of the standard zero-one loss. We propose top-k multiclass SVM as a direct method to optimize for top-k performance. Our generalization of the well-known multiclass SVM is based on a tight convex upper bound of the top-k error. We propose a fast optimization scheme based on an efficient projection onto the top-k simplex, which is of its own interest. Experiments on five"},"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":"1511.06683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-20T16:49:33Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"98c36d83e93dde701cbbaa5aaa3bf5cfccd735d69bbe53c522e8749ced1f9b74","abstract_canon_sha256":"5190a365d21af0059a47cfc6147bf9f26c06cb7f70f48fe4cbc7566cb728c843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.057283Z","signature_b64":"6F6AeWKUGWdVeHrrzRVgB3BRl5zOGKiGKZRdwB6u1bN/m9/x3Bmelsynw9NQAiQdU/4hgW7K1SYB4ZnvDnXrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be9af2385e84568427e00c37e81df01fa5745d4093bc0df987a53e3dddc3d71d","last_reissued_at":"2026-05-18T01:26:24.056667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.056667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-k Multiclass SVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernt Schiele, Maksim Lapin, Matthias Hein","submitted_at":"2015-11-20T16:49:33Z","abstract_excerpt":"Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the top-k error instead of the standard zero-one loss. We propose top-k multiclass SVM as a direct method to optimize for top-k performance. Our generalization of the well-known multiclass SVM is based on a tight convex upper bound of the top-k error. We propose a fast optimization scheme based on an efficient projection onto the top-k simplex, which is of its own interest. Experiments on five"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06683","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":"1511.06683","created_at":"2026-05-18T01:26:24.056772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06683v1","created_at":"2026-05-18T01:26:24.056772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06683","created_at":"2026-05-18T01:26:24.056772+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2NPEOC6QRLI","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2NPEOC6QRLIIJ7A","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2NPEOC6","created_at":"2026-05-18T12:29:47.479230+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/X2NPEOC6QRLIIJ7ABQ36QHPQD6","json":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6.json","graph_json":"https://pith.science/api/pith-number/X2NPEOC6QRLIIJ7ABQ36QHPQD6/graph.json","events_json":"https://pith.science/api/pith-number/X2NPEOC6QRLIIJ7ABQ36QHPQD6/events.json","paper":"https://pith.science/paper/X2NPEOC6"},"agent_actions":{"view_html":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6","download_json":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6.json","view_paper":"https://pith.science/paper/X2NPEOC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06683&json=true","fetch_graph":"https://pith.science/api/pith-number/X2NPEOC6QRLIIJ7ABQ36QHPQD6/graph.json","fetch_events":"https://pith.science/api/pith-number/X2NPEOC6QRLIIJ7ABQ36QHPQD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6/action/storage_attestation","attest_author":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6/action/author_attestation","sign_citation":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6/action/citation_signature","submit_replication":"https://pith.science/pith/X2NPEOC6QRLIIJ7ABQ36QHPQD6/action/replication_record"}},"created_at":"2026-05-18T01:26:24.056772+00:00","updated_at":"2026-05-18T01:26:24.056772+00:00"}