{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SSBCUIIM55LC53ZKDSH4XBST6I","short_pith_number":"pith:SSBCUIIM","schema_version":"1.0","canonical_sha256":"94822a210cef562eef2a1c8fcb8653f20b181a6bc9319784700f302da3e5c4c5","source":{"kind":"arxiv","id":"1501.03001","version":1},"attestation_state":"computed","paper":{"title":"On Generalizing the C-Bound to the Multiclass and Multi-label Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Emilie Morvant (LHC), Francois Laviolette, Jean-Francis Roy, Liva Ralaivola","submitted_at":"2015-01-13T13:47:03Z","abstract_excerpt":"The C-bound, introduced in Lacasse et al., gives a tight upper bound on the risk of a binary majority vote classifier. In this work, we present a first step towards extending this work to more complex outputs, by providing generalizations of the C-bound to the multiclass and multi-label settings."},"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.03001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-13T13:47:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b77ebfc99e423e027ca4389e5f532afe62ed91799147df171b88661a6577be45","abstract_canon_sha256":"727335fd2fa431fe04866e4c3eab8f49565e0c8c97f8cdb433dc981695c6e9cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:30.706663Z","signature_b64":"X5afSuFSrkfUP/hiZaQYFZeB9uMH0elluMYAqvPd4a8z9EDeuToy86HQ/ALHPI4e1uHpmdYYIAK5r0I+DOA7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94822a210cef562eef2a1c8fcb8653f20b181a6bc9319784700f302da3e5c4c5","last_reissued_at":"2026-05-18T02:29:30.706286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:30.706286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Generalizing the C-Bound to the Multiclass and Multi-label Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Emilie Morvant (LHC), Francois Laviolette, Jean-Francis Roy, Liva Ralaivola","submitted_at":"2015-01-13T13:47:03Z","abstract_excerpt":"The C-bound, introduced in Lacasse et al., gives a tight upper bound on the risk of a binary majority vote classifier. In this work, we present a first step towards extending this work to more complex outputs, by providing generalizations of the C-bound to the multiclass and multi-label settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03001","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.03001","created_at":"2026-05-18T02:29:30.706346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03001v1","created_at":"2026-05-18T02:29:30.706346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03001","created_at":"2026-05-18T02:29:30.706346+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSBCUIIM55LC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSBCUIIM55LC53ZK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSBCUIIM","created_at":"2026-05-18T12:29:42.218222+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/SSBCUIIM55LC53ZKDSH4XBST6I","json":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I.json","graph_json":"https://pith.science/api/pith-number/SSBCUIIM55LC53ZKDSH4XBST6I/graph.json","events_json":"https://pith.science/api/pith-number/SSBCUIIM55LC53ZKDSH4XBST6I/events.json","paper":"https://pith.science/paper/SSBCUIIM"},"agent_actions":{"view_html":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I","download_json":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I.json","view_paper":"https://pith.science/paper/SSBCUIIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03001&json=true","fetch_graph":"https://pith.science/api/pith-number/SSBCUIIM55LC53ZKDSH4XBST6I/graph.json","fetch_events":"https://pith.science/api/pith-number/SSBCUIIM55LC53ZKDSH4XBST6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I/action/storage_attestation","attest_author":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I/action/author_attestation","sign_citation":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I/action/citation_signature","submit_replication":"https://pith.science/pith/SSBCUIIM55LC53ZKDSH4XBST6I/action/replication_record"}},"created_at":"2026-05-18T02:29:30.706346+00:00","updated_at":"2026-05-18T02:29:30.706346+00:00"}