{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:PV34PLHC57FIYYM7NN23ZLXEC6","short_pith_number":"pith:PV34PLHC","canonical_record":{"source":{"id":"cs/0009007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2000-09-13T21:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"8b69067679ce2f4f080c6baf3352c77bdf4ef1042e2f4945ef42ee3457eb2dc6","abstract_canon_sha256":"f482c0c935a15c34979613960a3857e18b804303096a83d8f446c060531e051a"},"schema_version":"1.0"},"canonical_sha256":"7d77c7ace2efca8c619f6b75bcaee417a4025bbad05ef6ae2bd5ef3a9a03e22f","source":{"kind":"arxiv","id":"cs/0009007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0009007","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0009007v1","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0009007","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"PV34PLHC57FI","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"pith_short_16","alias_value":"PV34PLHC57FIYYM7","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"pith_short_8","alias_value":"PV34PLHC","created_at":"2026-07-04T14:24:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:PV34PLHC57FIYYM7NN23ZLXEC6","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0009007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2000-09-13T21:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"8b69067679ce2f4f080c6baf3352c77bdf4ef1042e2f4945ef42ee3457eb2dc6","abstract_canon_sha256":"f482c0c935a15c34979613960a3857e18b804303096a83d8f446c060531e051a"},"schema_version":"1.0"},"canonical_sha256":"7d77c7ace2efca8c619f6b75bcaee417a4025bbad05ef6ae2bd5ef3a9a03e22f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:04.594842Z","signature_b64":"6tXnCiDwCiC/0qPGVvKg4gKwGPzHv3H6g8JPdGn52fadXjjIvKm0XZUR+0so1qNHY88GigOLL68MqERW+t5oDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d77c7ace2efca8c619f6b75bcaee417a4025bbad05ef6ae2bd5ef3a9a03e22f","last_reissued_at":"2026-07-04T14:24:04.594326Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:04.594326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0009007","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-07-04T14:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xVbAH2Gqw+ADir0gsm1DU3kc4SuQSfY4+KmfjmBjjY6zBAtif6nyZ7lBmyiMCl0alZSdoGXj9WPUrKak4wcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:49:30.358824Z"},"content_sha256":"68ef8364cbd1620dc42e8a629d0418b480defcb4d2d0f4501c62f6081b02b214","schema_version":"1.0","event_id":"sha256:68ef8364cbd1620dc42e8a629d0418b480defcb4d2d0f4501c62f6081b02b214"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:PV34PLHC57FIYYM7NN23ZLXEC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Classification for Imprecise Environments","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Foster Provost, Tom Fawcett","submitted_at":"2000-09-13T21:09:47Z","abstract_excerpt":"In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building robust classification systems problematic. We show that it is possible to build a hybrid classifier that will perform at least as well as the best available classifier for any target conditions. In some cases, the performance of the hybrid actually can surpass that of the best known classifier. This robust performance extends across a wide variety of comparison frameworks, including the optimization of metrics such as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0009007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0009007/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aql3kHpnpnP9xWnwYvihPTUOSMqkZ57f+5luz7J+yd6G294x6ABeW+8jCf7M3jn5KOvUDwd9+aCKn4LRlM+zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:49:30.359342Z"},"content_sha256":"3fc865a498b8aed552d2da2cac4279297e8774f042a99186a50f543c068f45b9","schema_version":"1.0","event_id":"sha256:3fc865a498b8aed552d2da2cac4279297e8774f042a99186a50f543c068f45b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PV34PLHC57FIYYM7NN23ZLXEC6/bundle.json","state_url":"https://pith.science/pith/PV34PLHC57FIYYM7NN23ZLXEC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PV34PLHC57FIYYM7NN23ZLXEC6/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-08-05T03:49:30Z","links":{"resolver":"https://pith.science/pith/PV34PLHC57FIYYM7NN23ZLXEC6","bundle":"https://pith.science/pith/PV34PLHC57FIYYM7NN23ZLXEC6/bundle.json","state":"https://pith.science/pith/PV34PLHC57FIYYM7NN23ZLXEC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PV34PLHC57FIYYM7NN23ZLXEC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:PV34PLHC57FIYYM7NN23ZLXEC6","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":"f482c0c935a15c34979613960a3857e18b804303096a83d8f446c060531e051a","cross_cats_sorted":[],"license":"","primary_cat":"cs.LG","submitted_at":"2000-09-13T21:09:47Z","title_canon_sha256":"8b69067679ce2f4f080c6baf3352c77bdf4ef1042e2f4945ef42ee3457eb2dc6"},"schema_version":"1.0","source":{"id":"cs/0009007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0009007","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0009007v1","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0009007","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"PV34PLHC57FI","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"pith_short_16","alias_value":"PV34PLHC57FIYYM7","created_at":"2026-07-04T14:24:04Z"},{"alias_kind":"pith_short_8","alias_value":"PV34PLHC","created_at":"2026-07-04T14:24:04Z"}],"graph_snapshots":[{"event_id":"sha256:3fc865a498b8aed552d2da2cac4279297e8774f042a99186a50f543c068f45b9","target":"graph","created_at":"2026-07-04T14:24:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0009007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building robust classification systems problematic. We show that it is possible to build a hybrid classifier that will perform at least as well as the best available classifier for any target conditions. In some cases, the performance of the hybrid actually can surpass that of the best known classifier. This robust performance extends across a wide variety of comparison frameworks, including the optimization of metrics such as ","authors_text":"Foster Provost, Tom Fawcett","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LG","submitted_at":"2000-09-13T21:09:47Z","title":"Robust Classification for Imprecise Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0009007","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:68ef8364cbd1620dc42e8a629d0418b480defcb4d2d0f4501c62f6081b02b214","target":"record","created_at":"2026-07-04T14:24:04Z","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":"f482c0c935a15c34979613960a3857e18b804303096a83d8f446c060531e051a","cross_cats_sorted":[],"license":"","primary_cat":"cs.LG","submitted_at":"2000-09-13T21:09:47Z","title_canon_sha256":"8b69067679ce2f4f080c6baf3352c77bdf4ef1042e2f4945ef42ee3457eb2dc6"},"schema_version":"1.0","source":{"id":"cs/0009007","kind":"arxiv","version":1}},"canonical_sha256":"7d77c7ace2efca8c619f6b75bcaee417a4025bbad05ef6ae2bd5ef3a9a03e22f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d77c7ace2efca8c619f6b75bcaee417a4025bbad05ef6ae2bd5ef3a9a03e22f","first_computed_at":"2026-07-04T14:24:04.594326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:04.594326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6tXnCiDwCiC/0qPGVvKg4gKwGPzHv3H6g8JPdGn52fadXjjIvKm0XZUR+0so1qNHY88GigOLL68MqERW+t5oDg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:04.594842Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0009007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68ef8364cbd1620dc42e8a629d0418b480defcb4d2d0f4501c62f6081b02b214","sha256:3fc865a498b8aed552d2da2cac4279297e8774f042a99186a50f543c068f45b9"],"state_sha256":"314f1791fa3ebed4acbb34bdcbcf8603c33b79dfdff125623bd7898f2d004816"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsYK2BZ0szYsgreYVfNrpVdOZCVQvP1bNhu5hU8MwGKLz9vQwu6RLaf0TyrGLb5lUMDY3YT8wm5P05b3qzkVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:49:30.362936Z","bundle_sha256":"5cec041fe3e94a1919e319d1183e8a0f803f2289b1b482d2f85983ac6d36c704"}}