{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YK6KTNIIFDEVWDYTNLH2UQHXDG","short_pith_number":"pith:YK6KTNII","schema_version":"1.0","canonical_sha256":"c2bca9b50828c95b0f136acfaa40f7198d8075c6e21cf92faee6268e2c898f4e","source":{"kind":"arxiv","id":"1501.00287","version":1},"attestation_state":"computed","paper":{"title":"Consistent Classification Algorithms for Multi-class Non-Decomposable Performance Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Harikrishna Narasimhan, Harish G. Ramaswamy, Shivani Agarwal","submitted_at":"2015-01-01T16:22:58Z","abstract_excerpt":"We study consistency of learning algorithms for a multi-class performance metric that is a non-decomposable function of the confusion matrix of a classifier and cannot be expressed as a sum of losses on individual data points; examples of such performance metrics include the macro F-measure popular in information retrieval and the G-mean metric used in class-imbalanced problems. While there has been much work in recent years in understanding the consistency properties of learning algorithms for `binary' non-decomposable metrics, little is known either about the form of the optimal classifier f"},"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":"1501.00287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-01T16:22:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e18015be564aee27f58cc953dcafccb63d8f1d340980061de6bc5d9c97ac77ea","abstract_canon_sha256":"9d9d10ba405d8ecd9cd567cbfae7a41480b49397976097093812ce29461a9462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.662518Z","signature_b64":"n+jyW7GdXI7eKuRIhZo54KhXn/s2kvIn7bkmQougfAnDvOqgtDZc6lm7e9otSYWZlFCZ4Oifg9mYoPzn4OSwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2bca9b50828c95b0f136acfaa40f7198d8075c6e21cf92faee6268e2c898f4e","last_reissued_at":"2026-05-18T02:30:09.662078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.662078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistent Classification Algorithms for Multi-class Non-Decomposable Performance Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Harikrishna Narasimhan, Harish G. Ramaswamy, Shivani Agarwal","submitted_at":"2015-01-01T16:22:58Z","abstract_excerpt":"We study consistency of learning algorithms for a multi-class performance metric that is a non-decomposable function of the confusion matrix of a classifier and cannot be expressed as a sum of losses on individual data points; examples of such performance metrics include the macro F-measure popular in information retrieval and the G-mean metric used in class-imbalanced problems. While there has been much work in recent years in understanding the consistency properties of learning algorithms for `binary' non-decomposable metrics, little is known either about the form of the optimal classifier f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00287","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00287","created_at":"2026-05-18T02:30:09.662139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00287v1","created_at":"2026-05-18T02:30:09.662139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00287","created_at":"2026-05-18T02:30:09.662139+00:00"},{"alias_kind":"pith_short_12","alias_value":"YK6KTNIIFDEV","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YK6KTNIIFDEVWDYT","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YK6KTNII","created_at":"2026-05-18T12:29:50.041715+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/YK6KTNIIFDEVWDYTNLH2UQHXDG","json":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG.json","graph_json":"https://pith.science/api/pith-number/YK6KTNIIFDEVWDYTNLH2UQHXDG/graph.json","events_json":"https://pith.science/api/pith-number/YK6KTNIIFDEVWDYTNLH2UQHXDG/events.json","paper":"https://pith.science/paper/YK6KTNII"},"agent_actions":{"view_html":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG","download_json":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG.json","view_paper":"https://pith.science/paper/YK6KTNII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00287&json=true","fetch_graph":"https://pith.science/api/pith-number/YK6KTNIIFDEVWDYTNLH2UQHXDG/graph.json","fetch_events":"https://pith.science/api/pith-number/YK6KTNIIFDEVWDYTNLH2UQHXDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG/action/storage_attestation","attest_author":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG/action/author_attestation","sign_citation":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG/action/citation_signature","submit_replication":"https://pith.science/pith/YK6KTNIIFDEVWDYTNLH2UQHXDG/action/replication_record"}},"created_at":"2026-05-18T02:30:09.662139+00:00","updated_at":"2026-05-18T02:30:09.662139+00:00"}