{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DEQVJSXYISHWN4GQEKY4E3P7MN","short_pith_number":"pith:DEQVJSXY","schema_version":"1.0","canonical_sha256":"192154caf8448f66f0d022b1c26dff6363f51be35b0041fc442ab2530295dcc6","source":{"kind":"arxiv","id":"2111.04597","version":4},"attestation_state":"computed","paper":{"title":"Neyman-Pearson Multi-class Classification via Cost-sensitive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Yang Feng, Ye Tian","submitted_at":"2021-11-08T16:09:39Z","abstract_excerpt":"Most existing classification methods aim to minimize the overall misclassification error rate. However, in applications such as loan default prediction, different types of errors can have varying consequences. To address this asymmetry issue, two popular paradigms have been developed: the Neyman-Pearson (NP) paradigm and the cost-sensitive (CS) paradigm. Previous studies on the NP paradigm have primarily focused on the binary case, while the multi-class NP problem poses a greater challenge due to its unknown feasibility. In this work, we tackle the multi-class NP problem by establishing a conn"},"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":"2111.04597","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-11-08T16:09:39Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"9b0c7aa70a027f8046fdac0e29f4aab4fa292242b57d2ed3bf2162fe4eaf4b20","abstract_canon_sha256":"e68a997f04bccf63425a13e9ebe8f45d4000eae4ebeeffd40d93aedf893402d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:27.916245Z","signature_b64":"Z53QrKeZsvvdFpTdRS/RA2TTgCXro4RtMRLPy+0c3pfT7jfZkSXL2djyGZOpQWBIEGCAvGd9QYV3pBbGlALnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"192154caf8448f66f0d022b1c26dff6363f51be35b0041fc442ab2530295dcc6","last_reissued_at":"2026-07-05T10:50:27.915760Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:27.915760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neyman-Pearson Multi-class Classification via Cost-sensitive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Yang Feng, Ye Tian","submitted_at":"2021-11-08T16:09:39Z","abstract_excerpt":"Most existing classification methods aim to minimize the overall misclassification error rate. However, in applications such as loan default prediction, different types of errors can have varying consequences. To address this asymmetry issue, two popular paradigms have been developed: the Neyman-Pearson (NP) paradigm and the cost-sensitive (CS) paradigm. Previous studies on the NP paradigm have primarily focused on the binary case, while the multi-class NP problem poses a greater challenge due to its unknown feasibility. In this work, we tackle the multi-class NP problem by establishing a conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04597","kind":"arxiv","version":4},"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/2111.04597/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.04597","created_at":"2026-07-05T10:50:27.915818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.04597v4","created_at":"2026-07-05T10:50:27.915818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04597","created_at":"2026-07-05T10:50:27.915818+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEQVJSXYISHW","created_at":"2026-07-05T10:50:27.915818+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEQVJSXYISHWN4GQ","created_at":"2026-07-05T10:50:27.915818+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEQVJSXY","created_at":"2026-07-05T10:50:27.915818+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13523","citing_title":"HNPclassifier: An R Package for Hierarchical Neyman-Pearson Classification","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN","json":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN.json","graph_json":"https://pith.science/api/pith-number/DEQVJSXYISHWN4GQEKY4E3P7MN/graph.json","events_json":"https://pith.science/api/pith-number/DEQVJSXYISHWN4GQEKY4E3P7MN/events.json","paper":"https://pith.science/paper/DEQVJSXY"},"agent_actions":{"view_html":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN","download_json":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN.json","view_paper":"https://pith.science/paper/DEQVJSXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.04597&json=true","fetch_graph":"https://pith.science/api/pith-number/DEQVJSXYISHWN4GQEKY4E3P7MN/graph.json","fetch_events":"https://pith.science/api/pith-number/DEQVJSXYISHWN4GQEKY4E3P7MN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN/action/storage_attestation","attest_author":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN/action/author_attestation","sign_citation":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN/action/citation_signature","submit_replication":"https://pith.science/pith/DEQVJSXYISHWN4GQEKY4E3P7MN/action/replication_record"}},"created_at":"2026-07-05T10:50:27.915818+00:00","updated_at":"2026-07-05T10:50:27.915818+00:00"}