{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:35YAJDEADSPILHK72KUMCAJLNG","short_pith_number":"pith:35YAJDEA","canonical_record":{"source":{"id":"1802.04235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T18:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"8e62dcf3d8ca0020fd08d8a021ab6b0eb74f7d29a95a86ef93364c18926ed709","abstract_canon_sha256":"b342fc3504d9225671a7d6c33a5e7618e8c60e4deb66cd80e7c2c2a807e38fe7"},"schema_version":"1.0"},"canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","source":{"kind":"arxiv","id":"1802.04235","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04235","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04235v2","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04235","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"35YAJDEADSPI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35YAJDEADSPILHK7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35YAJDEA","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:35YAJDEADSPILHK72KUMCAJLNG","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T18:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"8e62dcf3d8ca0020fd08d8a021ab6b0eb74f7d29a95a86ef93364c18926ed709","abstract_canon_sha256":"b342fc3504d9225671a7d6c33a5e7618e8c60e4deb66cd80e7c2c2a807e38fe7"},"schema_version":"1.0"},"canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.822182Z","signature_b64":"jdnOHhtIFymaXK5M8fKSF4ltNWJMatGuQwFa0/FgmshZ1ueTOJ3HC1BZ6eZi7Hn0FlWMEVzWT+Jbkk4jYQcUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","last_reissued_at":"2026-05-17T23:50:42.821638Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.821638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04235","source_version":2,"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-17T23:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwU129YqRvCnQI5STJdzJ4ajmCMD9sS8OV12OQhONEcr4y48VonOldraHzodiubDSD8IgIbrnsxJxk1UppxYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:25:13.926425Z"},"content_sha256":"17917d42c9e0b64e79f4fea86051819fdaee3ae37b9bc4456d1f72201a28878c","schema_version":"1.0","event_id":"sha256:17917d42c9e0b64e79f4fea86051819fdaee3ae37b9bc4456d1f72201a28878c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:35YAJDEADSPILHK72KUMCAJLNG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Reject Option Classifier Using Successive Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kulin Shah, Naresh Manwani","submitted_at":"2018-02-12T18:38:26Z","abstract_excerpt":"In this paper, we propose an approach for learning sparse reject option classifiers using double ramp loss $L_{dr}$. We use DC programming to find the risk minimizer. The algorithm solves a sequence of linear programs to learn the reject option classifier. We show that the loss $L_{dr}$ is Fisher consistent. We also show that the excess risk of loss $L_d$ is upper bounded by the excess risk of $L_{dr}$. We derive the generalization error bounds for the proposed approach. We show the effectiveness of the proposed approach by experimenting it on several real world datasets. The proposed approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04235","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"},"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-17T23:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p0whXS5qOOdtRxBjD1JfRUrN1cbTd+1zCTdZxYGfBf07ecApfyuqA6weR2jVCS0zn2Yy6D+sXs9JW6i4y+dOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:25:13.926769Z"},"content_sha256":"643323455b747cca42693c9e083cae33be910565f5d6885a4780dbb70691885f","schema_version":"1.0","event_id":"sha256:643323455b747cca42693c9e083cae33be910565f5d6885a4780dbb70691885f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/bundle.json","state_url":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35YAJDEADSPILHK72KUMCAJLNG/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-26T10:25:13Z","links":{"resolver":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG","bundle":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/bundle.json","state":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35YAJDEADSPILHK72KUMCAJLNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:35YAJDEADSPILHK72KUMCAJLNG","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":"b342fc3504d9225671a7d6c33a5e7618e8c60e4deb66cd80e7c2c2a807e38fe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T18:38:26Z","title_canon_sha256":"8e62dcf3d8ca0020fd08d8a021ab6b0eb74f7d29a95a86ef93364c18926ed709"},"schema_version":"1.0","source":{"id":"1802.04235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04235","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04235v2","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04235","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"35YAJDEADSPI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35YAJDEADSPILHK7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35YAJDEA","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:643323455b747cca42693c9e083cae33be910565f5d6885a4780dbb70691885f","target":"graph","created_at":"2026-05-17T23:50:42Z","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":"In this paper, we propose an approach for learning sparse reject option classifiers using double ramp loss $L_{dr}$. We use DC programming to find the risk minimizer. The algorithm solves a sequence of linear programs to learn the reject option classifier. We show that the loss $L_{dr}$ is Fisher consistent. We also show that the excess risk of loss $L_d$ is upper bounded by the excess risk of $L_{dr}$. We derive the generalization error bounds for the proposed approach. We show the effectiveness of the proposed approach by experimenting it on several real world datasets. The proposed approach","authors_text":"Kulin Shah, Naresh Manwani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T18:38:26Z","title":"Sparse Reject Option Classifier Using Successive Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04235","kind":"arxiv","version":2},"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:17917d42c9e0b64e79f4fea86051819fdaee3ae37b9bc4456d1f72201a28878c","target":"record","created_at":"2026-05-17T23:50:42Z","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":"b342fc3504d9225671a7d6c33a5e7618e8c60e4deb66cd80e7c2c2a807e38fe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T18:38:26Z","title_canon_sha256":"8e62dcf3d8ca0020fd08d8a021ab6b0eb74f7d29a95a86ef93364c18926ed709"},"schema_version":"1.0","source":{"id":"1802.04235","kind":"arxiv","version":2}},"canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","first_computed_at":"2026-05-17T23:50:42.821638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:42.821638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdnOHhtIFymaXK5M8fKSF4ltNWJMatGuQwFa0/FgmshZ1ueTOJ3HC1BZ6eZi7Hn0FlWMEVzWT+Jbkk4jYQcUAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:42.822182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17917d42c9e0b64e79f4fea86051819fdaee3ae37b9bc4456d1f72201a28878c","sha256:643323455b747cca42693c9e083cae33be910565f5d6885a4780dbb70691885f"],"state_sha256":"6f67bd449d5a87f84a215397f156cae27e7489c1657367c55916d070e0c738a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GzDUvdAKrPIKHY+gyu80ebeYcmrIPWwYHvtxv63rnpgjlTOtkyEujIv+peviLfQ6IQSlWmslNWAO8znnaKtnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:25:13.928618Z","bundle_sha256":"21a17a7a8259f44f08b3c36390649234499e45536ec81a016fab1f98961fe1e7"}}