{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RJSXFQY3GFSBRJREVJNY4JIXH7","short_pith_number":"pith:RJSXFQY3","canonical_record":{"source":{"id":"1503.06549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T08:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"c6b9926806b06df017a42c8e09c2042989d72bebbc707d104545a7a8c7789113","abstract_canon_sha256":"16409597f942144e53f32587d8d2feeaf568daa668fcb68d2578fedb73c3958d"},"schema_version":"1.0"},"canonical_sha256":"8a6572c31b316418a624aa5b8e25173fe30889a447bf1bd355de215cb866385c","source":{"kind":"arxiv","id":"1503.06549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06549","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06549v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06549","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"RJSXFQY3GFSB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJSXFQY3GFSBRJRE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJSXFQY3","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RJSXFQY3GFSBRJREVJNY4JIXH7","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T08:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"c6b9926806b06df017a42c8e09c2042989d72bebbc707d104545a7a8c7789113","abstract_canon_sha256":"16409597f942144e53f32587d8d2feeaf568daa668fcb68d2578fedb73c3958d"},"schema_version":"1.0"},"canonical_sha256":"8a6572c31b316418a624aa5b8e25173fe30889a447bf1bd355de215cb866385c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.051496Z","signature_b64":"/FposYSyaU2TYleoSFUGsSqd0HYvT9Mx6uWVGeXve7g6KaxuNd3VWttPJqZa65zAEWU/VWl8jJ3kRkmZgS3aBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6572c31b316418a624aa5b8e25173fe30889a447bf1bd355de215cb866385c","last_reissued_at":"2026-05-18T02:20:38.050798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.050798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06549","source_version":1,"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-18T02:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epGV8BkXa3ejy2MTPs1/KJTeLrpy6dJ5msrzQy/qZsPepZGWvY/FFhRdgFCeUGAmPu8LlkqLMXAu1hSDaQ4AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:09:36.579907Z"},"content_sha256":"8cc7590c82f52edef85967cd0bec6ef3059b7157bdcb79074643f35084b3016c","schema_version":"1.0","event_id":"sha256:8cc7590c82f52edef85967cd0bec6ef3059b7157bdcb79074643f35084b3016c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RJSXFQY3GFSBRJREVJNY4JIXH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimum Reject Options for Prototype-based Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Barbara Hammer, Heiko Wersing, Lydia Fischer","submitted_at":"2015-03-23T08:19:17Z","abstract_excerpt":"We analyse optimum reject strategies for prototype-based classifiers and real-valued rejection measures, using the distance of a data point to the closest prototype or probabilistic counterparts. We compare reject schemes with global thresholds, and local thresholds for the Voronoi cells of the classifier. For the latter, we develop a polynomial-time algorithm to compute optimum thresholds based on a dynamic programming scheme, and we propose an intuitive linear time, memory efficient approximation thereof with competitive accuracy. Evaluating the performance in various benchmarks, we conclude"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06549","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"},"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-18T02:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KiuJy3Hv+TkHaSSZqIToa3uT8WGbQvt/lGFePCN2w658Cc8ltijqO84dge39WTMLKypQTLKKprTYvAr/LFTiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:09:36.580600Z"},"content_sha256":"a7e98ac20056c12f6f01029ebad7292b17221d33d8fb59e2856b5629f4d5d3ac","schema_version":"1.0","event_id":"sha256:a7e98ac20056c12f6f01029ebad7292b17221d33d8fb59e2856b5629f4d5d3ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJSXFQY3GFSBRJREVJNY4JIXH7/bundle.json","state_url":"https://pith.science/pith/RJSXFQY3GFSBRJREVJNY4JIXH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJSXFQY3GFSBRJREVJNY4JIXH7/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-05-28T19:09:36Z","links":{"resolver":"https://pith.science/pith/RJSXFQY3GFSBRJREVJNY4JIXH7","bundle":"https://pith.science/pith/RJSXFQY3GFSBRJREVJNY4JIXH7/bundle.json","state":"https://pith.science/pith/RJSXFQY3GFSBRJREVJNY4JIXH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJSXFQY3GFSBRJREVJNY4JIXH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RJSXFQY3GFSBRJREVJNY4JIXH7","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":"16409597f942144e53f32587d8d2feeaf568daa668fcb68d2578fedb73c3958d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T08:19:17Z","title_canon_sha256":"c6b9926806b06df017a42c8e09c2042989d72bebbc707d104545a7a8c7789113"},"schema_version":"1.0","source":{"id":"1503.06549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06549","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06549v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06549","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"RJSXFQY3GFSB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJSXFQY3GFSBRJRE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJSXFQY3","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a7e98ac20056c12f6f01029ebad7292b17221d33d8fb59e2856b5629f4d5d3ac","target":"graph","created_at":"2026-05-18T02:20:38Z","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 analyse optimum reject strategies for prototype-based classifiers and real-valued rejection measures, using the distance of a data point to the closest prototype or probabilistic counterparts. We compare reject schemes with global thresholds, and local thresholds for the Voronoi cells of the classifier. For the latter, we develop a polynomial-time algorithm to compute optimum thresholds based on a dynamic programming scheme, and we propose an intuitive linear time, memory efficient approximation thereof with competitive accuracy. Evaluating the performance in various benchmarks, we conclude","authors_text":"Barbara Hammer, Heiko Wersing, Lydia Fischer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T08:19:17Z","title":"Optimum Reject Options for Prototype-based Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06549","kind":"arxiv","version":1},"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:8cc7590c82f52edef85967cd0bec6ef3059b7157bdcb79074643f35084b3016c","target":"record","created_at":"2026-05-18T02:20:38Z","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":"16409597f942144e53f32587d8d2feeaf568daa668fcb68d2578fedb73c3958d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T08:19:17Z","title_canon_sha256":"c6b9926806b06df017a42c8e09c2042989d72bebbc707d104545a7a8c7789113"},"schema_version":"1.0","source":{"id":"1503.06549","kind":"arxiv","version":1}},"canonical_sha256":"8a6572c31b316418a624aa5b8e25173fe30889a447bf1bd355de215cb866385c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a6572c31b316418a624aa5b8e25173fe30889a447bf1bd355de215cb866385c","first_computed_at":"2026-05-18T02:20:38.050798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:38.050798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/FposYSyaU2TYleoSFUGsSqd0HYvT9Mx6uWVGeXve7g6KaxuNd3VWttPJqZa65zAEWU/VWl8jJ3kRkmZgS3aBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:38.051496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cc7590c82f52edef85967cd0bec6ef3059b7157bdcb79074643f35084b3016c","sha256:a7e98ac20056c12f6f01029ebad7292b17221d33d8fb59e2856b5629f4d5d3ac"],"state_sha256":"767cb71432a857e12cfe3db522f777d39479d0f20cd298fcfe4b3a441f6ef0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ln9AdtJ5AXxjMJJpFjgJDnhh/KkniOba9l1N3W+k7WHnNX8b6zayiRrcFHGfGXz6/hdJGHyByk54C6Fi0fp0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:09:36.585308Z","bundle_sha256":"35693da6e36b9bdd5b1ef18f70cde60e2f4ce971b8c815553bd7236d4992caef"}}