{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JVDT2CHZOSOL3Q7OSO5UXRRTOI","short_pith_number":"pith:JVDT2CHZ","schema_version":"1.0","canonical_sha256":"4d473d08f9749cbdc3ee93bb4bc6337217b9ba29820af94b46cd77444dcb42ea","source":{"kind":"arxiv","id":"1505.04137","version":1},"attestation_state":"computed","paper":{"title":"Consistent Algorithms for Multiclass Classification with a Reject Option","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Harish G. Ramaswamy, Shivani Agarwal","submitted_at":"2015-05-15T17:49:47Z","abstract_excerpt":"We consider the problem of $n$-class classification ($n\\geq 2$), where the classifier can choose to abstain from making predictions at a given cost, say, a factor $\\alpha$ of the cost of misclassification. Designing consistent algorithms for such $n$-class classification problems with a `reject option' is the main goal of this paper, thereby extending and generalizing previously known results for $n=2$. We show that the Crammer-Singer surrogate and the one vs all hinge loss, albeit with a different predictor than the standard argmax, yield consistent algorithms for this problem when $\\alpha=\\f"},"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":"1505.04137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-15T17:49:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"660a13b00168c7ca9f31709883b0a168f324efa31f28c66d20498cd6e172db52","abstract_canon_sha256":"121a192e7e7c5f15223d22b755c1f7bb47522670139eb0465914046ceea9ddcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:39.985449Z","signature_b64":"helaKSZRoq0Sz6QMlQaywJsFksClmmam9cVRz3knUJA2aMJyYBrJGJEAuGBDAtAnCNC7ji1vp3ENWzPC4x7/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d473d08f9749cbdc3ee93bb4bc6337217b9ba29820af94b46cd77444dcb42ea","last_reissued_at":"2026-05-18T02:09:39.984648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:39.984648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistent Algorithms for Multiclass Classification with a Reject Option","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Harish G. Ramaswamy, Shivani Agarwal","submitted_at":"2015-05-15T17:49:47Z","abstract_excerpt":"We consider the problem of $n$-class classification ($n\\geq 2$), where the classifier can choose to abstain from making predictions at a given cost, say, a factor $\\alpha$ of the cost of misclassification. Designing consistent algorithms for such $n$-class classification problems with a `reject option' is the main goal of this paper, thereby extending and generalizing previously known results for $n=2$. We show that the Crammer-Singer surrogate and the one vs all hinge loss, albeit with a different predictor than the standard argmax, yield consistent algorithms for this problem when $\\alpha=\\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04137","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":"1505.04137","created_at":"2026-05-18T02:09:39.984795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04137v1","created_at":"2026-05-18T02:09:39.984795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04137","created_at":"2026-05-18T02:09:39.984795+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVDT2CHZOSOL","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVDT2CHZOSOL3Q7O","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVDT2CHZ","created_at":"2026-05-18T12:29:27.538025+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/JVDT2CHZOSOL3Q7OSO5UXRRTOI","json":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI.json","graph_json":"https://pith.science/api/pith-number/JVDT2CHZOSOL3Q7OSO5UXRRTOI/graph.json","events_json":"https://pith.science/api/pith-number/JVDT2CHZOSOL3Q7OSO5UXRRTOI/events.json","paper":"https://pith.science/paper/JVDT2CHZ"},"agent_actions":{"view_html":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI","download_json":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI.json","view_paper":"https://pith.science/paper/JVDT2CHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04137&json=true","fetch_graph":"https://pith.science/api/pith-number/JVDT2CHZOSOL3Q7OSO5UXRRTOI/graph.json","fetch_events":"https://pith.science/api/pith-number/JVDT2CHZOSOL3Q7OSO5UXRRTOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI/action/storage_attestation","attest_author":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI/action/author_attestation","sign_citation":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI/action/citation_signature","submit_replication":"https://pith.science/pith/JVDT2CHZOSOL3Q7OSO5UXRRTOI/action/replication_record"}},"created_at":"2026-05-18T02:09:39.984795+00:00","updated_at":"2026-05-18T02:09:39.984795+00:00"}