{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:H7SCVULN6SF3PLTKA5ZOVXWKPN","short_pith_number":"pith:H7SCVULN","canonical_record":{"source":{"id":"1905.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T14:40:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ef41bace015a16c8bdf34a1e1312b2fcf52cea715de46e04da5bbbb26290854","abstract_canon_sha256":"d1fe7dd918ad439bc881f47011ee83b4863bcf25acf6f4236f40d5b90186abfa"},"schema_version":"1.0"},"canonical_sha256":"3fe42ad16df48bb7ae6a0772eadeca7b4b909691ce8be960aae6cc38f232385a","source":{"kind":"arxiv","id":"1905.07297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07297","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07297v1","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07297","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"H7SCVULN6SF3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H7SCVULN6SF3PLTK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H7SCVULN","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:H7SCVULN6SF3PLTKA5ZOVXWKPN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T14:40:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ef41bace015a16c8bdf34a1e1312b2fcf52cea715de46e04da5bbbb26290854","abstract_canon_sha256":"d1fe7dd918ad439bc881f47011ee83b4863bcf25acf6f4236f40d5b90186abfa"},"schema_version":"1.0"},"canonical_sha256":"3fe42ad16df48bb7ae6a0772eadeca7b4b909691ce8be960aae6cc38f232385a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:55.935002Z","signature_b64":"ENyt2pQKrKkpqOKTUhIvHrBdca7NSCCa3J8XSL82SO697wKOWZ4AtHkx4EJyOJY0lWN52eSNhYw1MLLDP+d3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fe42ad16df48bb7ae6a0772eadeca7b4b909691ce8be960aae6cc38f232385a","last_reissued_at":"2026-05-17T23:45:55.934481Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:55.934481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07297","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-17T23:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jqp4byNLgTWV7sLoptwj7f5xnODXzi/Lt7TNvOfoEqIvHe+fE/g1x5Ip818jwKah5inFxrNV3l5Y7OVNlYEsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T18:31:35.359777Z"},"content_sha256":"1d7c3989c92616c5b8db9f7e5d9da53fd10dc9e2b61f5c630dc67b1114ac2da6","schema_version":"1.0","event_id":"sha256:1d7c3989c92616c5b8db9f7e5d9da53fd10dc9e2b61f5c630dc67b1114ac2da6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:H7SCVULN6SF3PLTKA5ZOVXWKPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MOBA: A multi-objective bounded-abstention model for two-class cost-sensitive problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongjiao Guan","submitted_at":"2019-05-17T14:40:17Z","abstract_excerpt":"Abstaining classifiers have been widely used in cost-sensitive applications to avoid ambiguous classification and reduce the cost of misclassification. Previous abstaining classification models rely on cost information, such as a cost matrix or cost ratio. However, it is difficult to obtain or estimate costs in practical applications. Furthermore, these abstention models are typically restricted to a single optimization metric, which may not be the expected indicator when evaluating classification performance. To overcome such problems, a multi-objective bounded-abstention (MOBA) model is prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07297","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-17T23:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGhvSj1qtLWLjMDAz0fyowLrCoGg57Vai8DmkA2xN5v5Nur+yyI565I+NbkGLF+rJ8hUUB0/wZtHHi191mG2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T18:31:35.360122Z"},"content_sha256":"af816e63ff25f859afe02e0e9bf926d0e7a82e67cfbf081fd0247e6cc202a2d9","schema_version":"1.0","event_id":"sha256:af816e63ff25f859afe02e0e9bf926d0e7a82e67cfbf081fd0247e6cc202a2d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN/bundle.json","state_url":"https://pith.science/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN/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-07-03T18:31:35Z","links":{"resolver":"https://pith.science/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN","bundle":"https://pith.science/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN/bundle.json","state":"https://pith.science/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7SCVULN6SF3PLTKA5ZOVXWKPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:H7SCVULN6SF3PLTKA5ZOVXWKPN","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":"d1fe7dd918ad439bc881f47011ee83b4863bcf25acf6f4236f40d5b90186abfa","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T14:40:17Z","title_canon_sha256":"8ef41bace015a16c8bdf34a1e1312b2fcf52cea715de46e04da5bbbb26290854"},"schema_version":"1.0","source":{"id":"1905.07297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07297","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07297v1","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07297","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"H7SCVULN6SF3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H7SCVULN6SF3PLTK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H7SCVULN","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:af816e63ff25f859afe02e0e9bf926d0e7a82e67cfbf081fd0247e6cc202a2d9","target":"graph","created_at":"2026-05-17T23:45:55Z","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":"Abstaining classifiers have been widely used in cost-sensitive applications to avoid ambiguous classification and reduce the cost of misclassification. Previous abstaining classification models rely on cost information, such as a cost matrix or cost ratio. However, it is difficult to obtain or estimate costs in practical applications. Furthermore, these abstention models are typically restricted to a single optimization metric, which may not be the expected indicator when evaluating classification performance. To overcome such problems, a multi-objective bounded-abstention (MOBA) model is prop","authors_text":"Hongjiao Guan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T14:40:17Z","title":"MOBA: A multi-objective bounded-abstention model for two-class cost-sensitive problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07297","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:1d7c3989c92616c5b8db9f7e5d9da53fd10dc9e2b61f5c630dc67b1114ac2da6","target":"record","created_at":"2026-05-17T23:45:55Z","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":"d1fe7dd918ad439bc881f47011ee83b4863bcf25acf6f4236f40d5b90186abfa","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T14:40:17Z","title_canon_sha256":"8ef41bace015a16c8bdf34a1e1312b2fcf52cea715de46e04da5bbbb26290854"},"schema_version":"1.0","source":{"id":"1905.07297","kind":"arxiv","version":1}},"canonical_sha256":"3fe42ad16df48bb7ae6a0772eadeca7b4b909691ce8be960aae6cc38f232385a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fe42ad16df48bb7ae6a0772eadeca7b4b909691ce8be960aae6cc38f232385a","first_computed_at":"2026-05-17T23:45:55.934481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:55.934481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENyt2pQKrKkpqOKTUhIvHrBdca7NSCCa3J8XSL82SO697wKOWZ4AtHkx4EJyOJY0lWN52eSNhYw1MLLDP+d3Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:55.935002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d7c3989c92616c5b8db9f7e5d9da53fd10dc9e2b61f5c630dc67b1114ac2da6","sha256:af816e63ff25f859afe02e0e9bf926d0e7a82e67cfbf081fd0247e6cc202a2d9"],"state_sha256":"0652501f5cce6edbe3a57a8ba903e5d3636f9bdd7797fc376db55e440fceb332"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBg7Ga2Vcd4gMhNqzZDT9KDQGVBaBdAnAW6MiymxsnYDJNY3ksAzSmNXRgRYCDWrOmhw46XnjoujZvPD88LSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T18:31:35.362111Z","bundle_sha256":"50c182af2700b9703880e6d23417701191f1f4a7eaf36ae723b967cc4cbb0989"}}