{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NOZVNUJNNP5WWAN2TZAGEOLNO7","short_pith_number":"pith:NOZVNUJN","canonical_record":{"source":{"id":"1807.03233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T01:29:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2dc61e5d855b223daeb8b29f40ab9ec7bb4b69fd929ecd1e0bbf59e0c913bcdc","abstract_canon_sha256":"3defe5c055f922381bbd8f38d35b752048eeb2aa73871d90f01e9f761b36db57"},"schema_version":"1.0"},"canonical_sha256":"6bb356d12d6bfb6b01ba9e4062396d77dfaa7009e8d64ad1be6267a71831f5b2","source":{"kind":"arxiv","id":"1807.03233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03233","created_at":"2026-05-18T00:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03233v1","created_at":"2026-05-18T00:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03233","created_at":"2026-05-18T00:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"NOZVNUJNNP5W","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NOZVNUJNNP5WWAN2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NOZVNUJN","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NOZVNUJNNP5WWAN2TZAGEOLNO7","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T01:29:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2dc61e5d855b223daeb8b29f40ab9ec7bb4b69fd929ecd1e0bbf59e0c913bcdc","abstract_canon_sha256":"3defe5c055f922381bbd8f38d35b752048eeb2aa73871d90f01e9f761b36db57"},"schema_version":"1.0"},"canonical_sha256":"6bb356d12d6bfb6b01ba9e4062396d77dfaa7009e8d64ad1be6267a71831f5b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:12.312482Z","signature_b64":"kFsG3Q2rReZbXRhrB/9HTjifxTdi+hwanTkXFQNrkLU1ZdYFInK/rcyzH9ct9sFcGLbArhe8hyzHS9xfVhtiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb356d12d6bfb6b01ba9e4062396d77dfaa7009e8d64ad1be6267a71831f5b2","last_reissued_at":"2026-05-18T00:11:12.311662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:12.311662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03233","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wAuw1w76HVuzeucIQAFRpYYXtcSJQddvHk79IfSFiBqVu/H+2eSbFZr7a4VZPyf+hLAI3lbgXZrsBgMXSdIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:57:08.449477Z"},"content_sha256":"8cb0ea47c5740a9b3919db3ab5e9c50a96656c9b37dd15f8f0fb8f8706e50c32","schema_version":"1.0","event_id":"sha256:8cb0ea47c5740a9b3919db3ab5e9c50a96656c9b37dd15f8f0fb8f8706e50c32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NOZVNUJNNP5WWAN2TZAGEOLNO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New ECOC Algorithm for Multiclass Microarray Data Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Beizhan Wang, Kunhong Liu, Mengxin Sun, Qingqi Hong","submitted_at":"2018-06-22T01:29:53Z","abstract_excerpt":"The classification of multi-class microarray datasets is a hard task because of the small samples size in each class and the heavy overlaps among classes. To effectively solve these problems, we propose novel Error Correcting Output Code (ECOC) algorithm by Enhance Class Separability related Data Complexity measures during encoding process, named as ECOCECS. In this algorithm, two nearest neighbor related DC measures are deployed to extract the intrinsic overlapping information from microarray data. Our ECOC algorithm aims to search an optimal class split scheme by minimizing these measures. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03233","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3RAVhILmJhE/7abGjtYNbMnaWIn1Uh0P6j268SYrwohGITfPe4mwkLBl3S833HjioH4Qn6xW60ZDXnpO2R9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:57:08.450142Z"},"content_sha256":"04017bfdae8042da30ce904d4f1dcb9794419fd744b90957b54f99919e13d524","schema_version":"1.0","event_id":"sha256:04017bfdae8042da30ce904d4f1dcb9794419fd744b90957b54f99919e13d524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7/bundle.json","state_url":"https://pith.science/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T21:57:08Z","links":{"resolver":"https://pith.science/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7","bundle":"https://pith.science/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7/bundle.json","state":"https://pith.science/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOZVNUJNNP5WWAN2TZAGEOLNO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NOZVNUJNNP5WWAN2TZAGEOLNO7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3defe5c055f922381bbd8f38d35b752048eeb2aa73871d90f01e9f761b36db57","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T01:29:53Z","title_canon_sha256":"2dc61e5d855b223daeb8b29f40ab9ec7bb4b69fd929ecd1e0bbf59e0c913bcdc"},"schema_version":"1.0","source":{"id":"1807.03233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03233","created_at":"2026-05-18T00:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03233v1","created_at":"2026-05-18T00:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03233","created_at":"2026-05-18T00:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"NOZVNUJNNP5W","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NOZVNUJNNP5WWAN2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NOZVNUJN","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:04017bfdae8042da30ce904d4f1dcb9794419fd744b90957b54f99919e13d524","target":"graph","created_at":"2026-05-18T00:11:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The classification of multi-class microarray datasets is a hard task because of the small samples size in each class and the heavy overlaps among classes. To effectively solve these problems, we propose novel Error Correcting Output Code (ECOC) algorithm by Enhance Class Separability related Data Complexity measures during encoding process, named as ECOCECS. In this algorithm, two nearest neighbor related DC measures are deployed to extract the intrinsic overlapping information from microarray data. Our ECOC algorithm aims to search an optimal class split scheme by minimizing these measures. T","authors_text":"Beizhan Wang, Kunhong Liu, Mengxin Sun, Qingqi Hong","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T01:29:53Z","title":"A New ECOC Algorithm for Multiclass Microarray Data Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03233","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8cb0ea47c5740a9b3919db3ab5e9c50a96656c9b37dd15f8f0fb8f8706e50c32","target":"record","created_at":"2026-05-18T00:11:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3defe5c055f922381bbd8f38d35b752048eeb2aa73871d90f01e9f761b36db57","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T01:29:53Z","title_canon_sha256":"2dc61e5d855b223daeb8b29f40ab9ec7bb4b69fd929ecd1e0bbf59e0c913bcdc"},"schema_version":"1.0","source":{"id":"1807.03233","kind":"arxiv","version":1}},"canonical_sha256":"6bb356d12d6bfb6b01ba9e4062396d77dfaa7009e8d64ad1be6267a71831f5b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bb356d12d6bfb6b01ba9e4062396d77dfaa7009e8d64ad1be6267a71831f5b2","first_computed_at":"2026-05-18T00:11:12.311662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:12.311662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFsG3Q2rReZbXRhrB/9HTjifxTdi+hwanTkXFQNrkLU1ZdYFInK/rcyzH9ct9sFcGLbArhe8hyzHS9xfVhtiBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:12.312482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cb0ea47c5740a9b3919db3ab5e9c50a96656c9b37dd15f8f0fb8f8706e50c32","sha256:04017bfdae8042da30ce904d4f1dcb9794419fd744b90957b54f99919e13d524"],"state_sha256":"7440f4431a83f2cf4832f298b2d30598e1c3b1f890046738c1ea8dbfb5bb1f9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wV9C4Us89RXBGS3NLQSdj6UXjQCPwDjuiV5WOKTj/Fjy116wjFa9ZahxkWjnrLFwd/SOhIAHOAObOHVIbFRPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:57:08.453796Z","bundle_sha256":"14199d7067e145088ce51be3e84038b6c15029316baebcbb9805dd77a4f4d83d"}}