{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GKMYY5MDWIIMJRSCR6HX4TWBW3","short_pith_number":"pith:GKMYY5MD","schema_version":"1.0","canonical_sha256":"32998c7583b210c4c6428f8f7e4ec1b6dc2eaa5ed4a2d3cafd631c947c475fab","source":{"kind":"arxiv","id":"1603.05850","version":1},"attestation_state":"computed","paper":{"title":"N-ary Error Correcting Coding Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ivor W. Tsang, Joey Tianyi Zhou, Klaus-Robert Muller, Shen-Shyang Ho","submitted_at":"2016-03-18T11:51:09Z","abstract_excerpt":"The coding matrix design plays a fundamental role in the prediction performance of the error correcting output codes (ECOC)-based multi-class task. {In many-class classification problems, e.g., fine-grained categorization, it is difficult to distinguish subtle between-class differences under existing coding schemes due to a limited choices of coding values.} In this paper, we investigate whether one can relax existing binary and ternary code design to $N$-ary code design to achieve better classification performance. {In particular, we present a novel $N$-ary coding scheme that decomposes the o"},"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":"1603.05850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-18T11:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"0fcbf0cf9a55b0336af16c731feadc7e422b08f2a9d50323fed9c4b8e34c93b4","abstract_canon_sha256":"4a3ede5b57d77ad00926e6998fc1cfad8102f300ec16efa792dc7f6fc7c507b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.430654Z","signature_b64":"s84Lp1FIzH+HKebS1jGijBUOgsQ09zHEjirKY5FqnodJitIQmhYnN2wzdbsjoAP1663s/hJ4Ax0dxKqWB9FICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32998c7583b210c4c6428f8f7e4ec1b6dc2eaa5ed4a2d3cafd631c947c475fab","last_reissued_at":"2026-05-18T01:18:53.430125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.430125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"N-ary Error Correcting Coding Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ivor W. Tsang, Joey Tianyi Zhou, Klaus-Robert Muller, Shen-Shyang Ho","submitted_at":"2016-03-18T11:51:09Z","abstract_excerpt":"The coding matrix design plays a fundamental role in the prediction performance of the error correcting output codes (ECOC)-based multi-class task. {In many-class classification problems, e.g., fine-grained categorization, it is difficult to distinguish subtle between-class differences under existing coding schemes due to a limited choices of coding values.} In this paper, we investigate whether one can relax existing binary and ternary code design to $N$-ary code design to achieve better classification performance. {In particular, we present a novel $N$-ary coding scheme that decomposes the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05850","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":"1603.05850","created_at":"2026-05-18T01:18:53.430203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05850v1","created_at":"2026-05-18T01:18:53.430203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05850","created_at":"2026-05-18T01:18:53.430203+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKMYY5MDWIIM","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKMYY5MDWIIMJRSC","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKMYY5MD","created_at":"2026-05-18T12:30:19.053100+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/GKMYY5MDWIIMJRSCR6HX4TWBW3","json":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3.json","graph_json":"https://pith.science/api/pith-number/GKMYY5MDWIIMJRSCR6HX4TWBW3/graph.json","events_json":"https://pith.science/api/pith-number/GKMYY5MDWIIMJRSCR6HX4TWBW3/events.json","paper":"https://pith.science/paper/GKMYY5MD"},"agent_actions":{"view_html":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3","download_json":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3.json","view_paper":"https://pith.science/paper/GKMYY5MD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05850&json=true","fetch_graph":"https://pith.science/api/pith-number/GKMYY5MDWIIMJRSCR6HX4TWBW3/graph.json","fetch_events":"https://pith.science/api/pith-number/GKMYY5MDWIIMJRSCR6HX4TWBW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3/action/storage_attestation","attest_author":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3/action/author_attestation","sign_citation":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3/action/citation_signature","submit_replication":"https://pith.science/pith/GKMYY5MDWIIMJRSCR6HX4TWBW3/action/replication_record"}},"created_at":"2026-05-18T01:18:53.430203+00:00","updated_at":"2026-05-18T01:18:53.430203+00:00"}