{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UZ3ACNUA4U5OKGUYLYQRNYLQC7","short_pith_number":"pith:UZ3ACNUA","canonical_record":{"source":{"id":"1311.6556","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T05:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"d06c65e2e0908cbadef8e031271ece57c641190f18822001d38b09c383563a52","abstract_canon_sha256":"52c4ca63753e0dfbe3cbde0bed2c8bf3874004ecc740955489359bed227562c7"},"schema_version":"1.0"},"canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","source":{"kind":"arxiv","id":"1311.6556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6556","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6556v2","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6556","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"UZ3ACNUA4U5O","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UZ3ACNUA4U5OKGUY","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UZ3ACNUA","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UZ3ACNUA4U5OKGUYLYQRNYLQC7","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6556","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T05:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"d06c65e2e0908cbadef8e031271ece57c641190f18822001d38b09c383563a52","abstract_canon_sha256":"52c4ca63753e0dfbe3cbde0bed2c8bf3874004ecc740955489359bed227562c7"},"schema_version":"1.0"},"canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:23.671455Z","signature_b64":"DFFgtr/by9uHYwG1EqY3/MBL45rEoCZl1K6NcCHzDG0sNnt+tMaDVz96bBq8A/u8fCw1PZNhwVThDBgySqwDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","last_reissued_at":"2026-05-18T00:41:23.670805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:23.670805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6556","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-18T00:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnQDotP7Fs9+C7JJHG+YcI5Ziq0LF3DSNuqcokMxpKUOqyfKdIUdWNpXclLtHiXDFMmpYcqCXEoWEfnOo0W6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:00:31.151203Z"},"content_sha256":"3aa92f5ce9077fd1a017c294d55df99e3bafb1f551990c5af641ddbcab2127b6","schema_version":"1.0","event_id":"sha256:3aa92f5ce9077fd1a017c294d55df99e3bafb1f551990c5af641ddbcab2127b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UZ3ACNUA4U5OKGUYLYQRNYLQC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Double Ramp Loss Based Reject Option Classifier","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kalpit Desai, Naresh Manwani, Ramasubramanian Sundararajan, Sanand Sasidharan","submitted_at":"2013-11-26T05:13:18Z","abstract_excerpt":"We consider the problem of learning reject option classifiers. The goodness of a reject option classifier is quantified using $0-d-1$ loss function wherein a loss $d \\in (0,.5)$ is assigned for rejection. In this paper, we propose {\\em double ramp loss} function which gives a continuous upper bound for $(0-d-1)$ loss. Our approach is based on minimizing regularized risk under the double ramp loss using {\\em difference of convex (DC) programming}. We show the effectiveness of our approach through experiments on synthetic and benchmark datasets. Our approach performs better than the state of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6556","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-18T00:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvMrzfO8FNEU+3gTkAwggwKn0ieML9F1AlaabUgoACc+89EFeG9tQ7TCiJU8m7x+2+aJgTNFiZxEr63ujwvYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:00:31.151564Z"},"content_sha256":"4d2fa1b0f07069f68a4af8e7b6c562dfbbb4d252387a0e6a94360bdff603775f","schema_version":"1.0","event_id":"sha256:4d2fa1b0f07069f68a4af8e7b6c562dfbbb4d252387a0e6a94360bdff603775f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/bundle.json","state_url":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/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-26T14:00:31Z","links":{"resolver":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7","bundle":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/bundle.json","state":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UZ3ACNUA4U5OKGUYLYQRNYLQC7","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":"52c4ca63753e0dfbe3cbde0bed2c8bf3874004ecc740955489359bed227562c7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T05:13:18Z","title_canon_sha256":"d06c65e2e0908cbadef8e031271ece57c641190f18822001d38b09c383563a52"},"schema_version":"1.0","source":{"id":"1311.6556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6556","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6556v2","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6556","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"UZ3ACNUA4U5O","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UZ3ACNUA4U5OKGUY","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UZ3ACNUA","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:4d2fa1b0f07069f68a4af8e7b6c562dfbbb4d252387a0e6a94360bdff603775f","target":"graph","created_at":"2026-05-18T00:41:23Z","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":"We consider the problem of learning reject option classifiers. The goodness of a reject option classifier is quantified using $0-d-1$ loss function wherein a loss $d \\in (0,.5)$ is assigned for rejection. In this paper, we propose {\\em double ramp loss} function which gives a continuous upper bound for $(0-d-1)$ loss. Our approach is based on minimizing regularized risk under the double ramp loss using {\\em difference of convex (DC) programming}. We show the effectiveness of our approach through experiments on synthetic and benchmark datasets. Our approach performs better than the state of the","authors_text":"Kalpit Desai, Naresh Manwani, Ramasubramanian Sundararajan, Sanand Sasidharan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T05:13:18Z","title":"Double Ramp Loss Based Reject Option Classifier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6556","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:3aa92f5ce9077fd1a017c294d55df99e3bafb1f551990c5af641ddbcab2127b6","target":"record","created_at":"2026-05-18T00:41:23Z","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":"52c4ca63753e0dfbe3cbde0bed2c8bf3874004ecc740955489359bed227562c7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T05:13:18Z","title_canon_sha256":"d06c65e2e0908cbadef8e031271ece57c641190f18822001d38b09c383563a52"},"schema_version":"1.0","source":{"id":"1311.6556","kind":"arxiv","version":2}},"canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","first_computed_at":"2026-05-18T00:41:23.670805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:23.670805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DFFgtr/by9uHYwG1EqY3/MBL45rEoCZl1K6NcCHzDG0sNnt+tMaDVz96bBq8A/u8fCw1PZNhwVThDBgySqwDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:23.671455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aa92f5ce9077fd1a017c294d55df99e3bafb1f551990c5af641ddbcab2127b6","sha256:4d2fa1b0f07069f68a4af8e7b6c562dfbbb4d252387a0e6a94360bdff603775f"],"state_sha256":"4d4b84dcf09f58561bc6b691d55a8e8af30f9a04eb578006e49d6db39b0f4749"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srIhdkeGXZJktAG3BURC7jQrjVZ92IkT+bzq4hvP9Mv7OvJH3k19UZ7w2/tmUAXDWzg63UNnLaS2bNVif8OLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:00:31.153479Z","bundle_sha256":"44c12b1d78f29191edd79fd4b6683f6b2548af112a540fcf49e99755aaacef83"}}