{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TBRWRCGDFDKKHAXSJXOPGHZMHP","short_pith_number":"pith:TBRWRCGD","schema_version":"1.0","canonical_sha256":"98636888c328d4a382f24ddcf31f2c3bfbc1e9432b247e3145e755eaa01659f8","source":{"kind":"arxiv","id":"1806.08465","version":1},"attestation_state":"computed","paper":{"title":"A Novel ECOC Algorithm with Centroid Distance Based Soft Coding Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AI","authors_text":"Beizhan Wang, Kaijie Feng, Kunhong Liu","submitted_at":"2018-06-22T01:35:39Z","abstract_excerpt":"In ECOC framework, the ternary coding strategy is widely deployed in coding process. It relabels classes with {\"-1,0,1\" }, where -1/1 means to assign the corresponding classes to the negative/positive group, and label 0 leads to ignore the corresponding classes in the training process. However, the application of hard labels may lose some information about the tendency of class distributions. Instead, we propose a Centroid distance-based Soft coding scheme to indicate such tendency, named as CSECOC. In our algorithm, Sequential Forward Floating Selection (SFFS) is applied to search an optimal "},"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":"1806.08465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-22T01:35:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e00e22b87371909673cda4750682211fc312843a59db077c63f5145b5475a1a0","abstract_canon_sha256":"7783913aabd26704dca5952bb2366cc5fde50fd4cf383a45908c7abc1cd8f898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:37.190973Z","signature_b64":"PVvE6xd3fGa3Rzj0NCjhAa0j8z2jlBW/dzRUOnpDgpuAFXktbXqOztbwUVKabccQ2KTn0p+dSSyvSlyH1/5qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98636888c328d4a382f24ddcf31f2c3bfbc1e9432b247e3145e755eaa01659f8","last_reissued_at":"2026-05-18T00:12:37.190124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:37.190124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel ECOC Algorithm with Centroid Distance Based Soft Coding Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AI","authors_text":"Beizhan Wang, Kaijie Feng, Kunhong Liu","submitted_at":"2018-06-22T01:35:39Z","abstract_excerpt":"In ECOC framework, the ternary coding strategy is widely deployed in coding process. It relabels classes with {\"-1,0,1\" }, where -1/1 means to assign the corresponding classes to the negative/positive group, and label 0 leads to ignore the corresponding classes in the training process. However, the application of hard labels may lose some information about the tendency of class distributions. Instead, we propose a Centroid distance-based Soft coding scheme to indicate such tendency, named as CSECOC. In our algorithm, Sequential Forward Floating Selection (SFFS) is applied to search an optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08465","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":"1806.08465","created_at":"2026-05-18T00:12:37.190266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08465v1","created_at":"2026-05-18T00:12:37.190266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08465","created_at":"2026-05-18T00:12:37.190266+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBRWRCGDFDKK","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBRWRCGDFDKKHAXS","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBRWRCGD","created_at":"2026-05-18T12:32:53.628368+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/TBRWRCGDFDKKHAXSJXOPGHZMHP","json":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP.json","graph_json":"https://pith.science/api/pith-number/TBRWRCGDFDKKHAXSJXOPGHZMHP/graph.json","events_json":"https://pith.science/api/pith-number/TBRWRCGDFDKKHAXSJXOPGHZMHP/events.json","paper":"https://pith.science/paper/TBRWRCGD"},"agent_actions":{"view_html":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP","download_json":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP.json","view_paper":"https://pith.science/paper/TBRWRCGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08465&json=true","fetch_graph":"https://pith.science/api/pith-number/TBRWRCGDFDKKHAXSJXOPGHZMHP/graph.json","fetch_events":"https://pith.science/api/pith-number/TBRWRCGDFDKKHAXSJXOPGHZMHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP/action/storage_attestation","attest_author":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP/action/author_attestation","sign_citation":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP/action/citation_signature","submit_replication":"https://pith.science/pith/TBRWRCGDFDKKHAXSJXOPGHZMHP/action/replication_record"}},"created_at":"2026-05-18T00:12:37.190266+00:00","updated_at":"2026-05-18T00:12:37.190266+00:00"}