{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PEOOKDCUXUR2A2MRVQ2JNYOMQX","short_pith_number":"pith:PEOOKDCU","schema_version":"1.0","canonical_sha256":"791ce50c54bd23a06991ac3496e1cc85c966166a0df92e6e1f17c3f8e37c2411","source":{"kind":"arxiv","id":"1303.3145","version":2},"attestation_state":"computed","paper":{"title":"Convex Hull-Based Multi-objective Genetic Programming for Maximizing ROC Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ke Tang, Michael Emmerich, Pu Wang, Rui Li, Thomas Baeck, Xin Yao","submitted_at":"2013-03-13T12:51:31Z","abstract_excerpt":"ROC is usually used to analyze the performance of classifiers in data mining. ROC convex hull (ROCCH) is the least convex major-ant (LCM) of the empirical ROC curve, and covers potential optima for the given set of classifiers. Generally, ROC performance maximization could be considered to maximize the ROCCH, which also means to maximize the true positive rate (tpr) and minimize the false positive rate (fpr) for each classifier in the ROC space. However, tpr and fpr are conflicting with each other in the ROCCH optimization process. Though ROCCH maximization problem seems like a multi-objective"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1303.3145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-13T12:51:31Z","cross_cats_sorted":[],"title_canon_sha256":"5275bdedf13da22e361f0771fc78c7d2fc9f7455982c5c17d77b9bc4ce48d934","abstract_canon_sha256":"5dfcd6985721fdc452f3007e7875b90a7ef37db91ff2961a2a4b41689dd04f7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:53.143632Z","signature_b64":"d6GN4TFVUiZjP+Fq/jq1qUnmas9s7NpDEiDfkhwcyZX00lR/CsG1k/aqDwNtOSR3cyW+taGzK+5P/wME7gp4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791ce50c54bd23a06991ac3496e1cc85c966166a0df92e6e1f17c3f8e37c2411","last_reissued_at":"2026-05-18T03:30:53.142989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:53.142989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Hull-Based Multi-objective Genetic Programming for Maximizing ROC Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ke Tang, Michael Emmerich, Pu Wang, Rui Li, Thomas Baeck, Xin Yao","submitted_at":"2013-03-13T12:51:31Z","abstract_excerpt":"ROC is usually used to analyze the performance of classifiers in data mining. ROC convex hull (ROCCH) is the least convex major-ant (LCM) of the empirical ROC curve, and covers potential optima for the given set of classifiers. Generally, ROC performance maximization could be considered to maximize the ROCCH, which also means to maximize the true positive rate (tpr) and minimize the false positive rate (fpr) for each classifier in the ROC space. However, tpr and fpr are conflicting with each other in the ROCCH optimization process. Though ROCCH maximization problem seems like a multi-objective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3145","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.3145","created_at":"2026-05-18T03:30:53.143089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3145v2","created_at":"2026-05-18T03:30:53.143089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3145","created_at":"2026-05-18T03:30:53.143089+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEOOKDCUXUR2","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEOOKDCUXUR2A2MR","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEOOKDCU","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX","json":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX.json","graph_json":"https://pith.science/api/pith-number/PEOOKDCUXUR2A2MRVQ2JNYOMQX/graph.json","events_json":"https://pith.science/api/pith-number/PEOOKDCUXUR2A2MRVQ2JNYOMQX/events.json","paper":"https://pith.science/paper/PEOOKDCU"},"agent_actions":{"view_html":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX","download_json":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX.json","view_paper":"https://pith.science/paper/PEOOKDCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3145&json=true","fetch_graph":"https://pith.science/api/pith-number/PEOOKDCUXUR2A2MRVQ2JNYOMQX/graph.json","fetch_events":"https://pith.science/api/pith-number/PEOOKDCUXUR2A2MRVQ2JNYOMQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX/action/storage_attestation","attest_author":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX/action/author_attestation","sign_citation":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX/action/citation_signature","submit_replication":"https://pith.science/pith/PEOOKDCUXUR2A2MRVQ2JNYOMQX/action/replication_record"}},"created_at":"2026-05-18T03:30:53.143089+00:00","updated_at":"2026-05-18T03:30:53.143089+00:00"}