{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ANXZRWIQWBYAMO4GFNZ3M6RGON","short_pith_number":"pith:ANXZRWIQ","schema_version":"1.0","canonical_sha256":"036f98d910b070063b862b73b67a26734dd8a5f8d8be5071870699a87c0df68d","source":{"kind":"arxiv","id":"1312.7179","version":1},"attestation_state":"computed","paper":{"title":"Sub-Classifier Construction for Error Correcting Output Code Using Minimum Weight Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Boonserm Kijsirikul, Patoomsiri Songsiri, Ryutaro Ichise, Thimaporn Phetkaew","submitted_at":"2013-12-27T03:21:34Z","abstract_excerpt":"Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Output Code. We propose a method for constructing the Error Correcting Output Code to obtain the suitable combination of positive and negative classes encoded to represent binary classifiers. The minimum weight perfect matching algorithm is applied to find the optimal pairs of subset of classes by using the generalization performance as a weighting criterion. Based on our method, each subset of classes with positive and negative labels is appropriat"},"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":"1312.7179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-27T03:21:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c467d4aba3fdbe6f4cc8d808f3258ad78ec825227752b51393ab2b4a6a50c669","abstract_canon_sha256":"1b8e381d8aa0e5465491c9c7d906127592d3a3ff58cca888ad07598c4558e3ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.565579Z","signature_b64":"PYL+zwIeenqzRdzElIgn9iOSvXsa7bZbx904waqa8hJal610ltKmAgS3DTVgsgrJ6TQ6EVbabyNWk4oEDqWEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"036f98d910b070063b862b73b67a26734dd8a5f8d8be5071870699a87c0df68d","last_reissued_at":"2026-05-18T03:03:45.564937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.564937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sub-Classifier Construction for Error Correcting Output Code Using Minimum Weight Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Boonserm Kijsirikul, Patoomsiri Songsiri, Ryutaro Ichise, Thimaporn Phetkaew","submitted_at":"2013-12-27T03:21:34Z","abstract_excerpt":"Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Output Code. We propose a method for constructing the Error Correcting Output Code to obtain the suitable combination of positive and negative classes encoded to represent binary classifiers. The minimum weight perfect matching algorithm is applied to find the optimal pairs of subset of classes by using the generalization performance as a weighting criterion. Based on our method, each subset of classes with positive and negative labels is appropriat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7179","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":"1312.7179","created_at":"2026-05-18T03:03:45.565040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7179v1","created_at":"2026-05-18T03:03:45.565040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7179","created_at":"2026-05-18T03:03:45.565040+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANXZRWIQWBYA","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANXZRWIQWBYAMO4G","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANXZRWIQ","created_at":"2026-05-18T12:27:38.830355+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/ANXZRWIQWBYAMO4GFNZ3M6RGON","json":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON.json","graph_json":"https://pith.science/api/pith-number/ANXZRWIQWBYAMO4GFNZ3M6RGON/graph.json","events_json":"https://pith.science/api/pith-number/ANXZRWIQWBYAMO4GFNZ3M6RGON/events.json","paper":"https://pith.science/paper/ANXZRWIQ"},"agent_actions":{"view_html":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON","download_json":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON.json","view_paper":"https://pith.science/paper/ANXZRWIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7179&json=true","fetch_graph":"https://pith.science/api/pith-number/ANXZRWIQWBYAMO4GFNZ3M6RGON/graph.json","fetch_events":"https://pith.science/api/pith-number/ANXZRWIQWBYAMO4GFNZ3M6RGON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON/action/storage_attestation","attest_author":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON/action/author_attestation","sign_citation":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON/action/citation_signature","submit_replication":"https://pith.science/pith/ANXZRWIQWBYAMO4GFNZ3M6RGON/action/replication_record"}},"created_at":"2026-05-18T03:03:45.565040+00:00","updated_at":"2026-05-18T03:03:45.565040+00:00"}