{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4XSIZRBKC7FOMJLIDFITOITK3T","short_pith_number":"pith:4XSIZRBK","canonical_record":{"source":{"id":"1904.02301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T01:36:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e48674c1ccc88b486e06c38d77b10b1f8b252b8034e8eefe52f17b6181c3beee","abstract_canon_sha256":"9672e9d25d9ae9200762b60a1cac4b66162455580b66ed610080c78126b9cc75"},"schema_version":"1.0"},"canonical_sha256":"e5e48cc42a17cae62568195137226adcc847d4b6a530985e1cf2d1198767f59d","source":{"kind":"arxiv","id":"1904.02301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02301","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02301v1","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02301","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"4XSIZRBKC7FO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4XSIZRBKC7FOMJLI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4XSIZRBK","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4XSIZRBKC7FOMJLIDFITOITK3T","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T01:36:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e48674c1ccc88b486e06c38d77b10b1f8b252b8034e8eefe52f17b6181c3beee","abstract_canon_sha256":"9672e9d25d9ae9200762b60a1cac4b66162455580b66ed610080c78126b9cc75"},"schema_version":"1.0"},"canonical_sha256":"e5e48cc42a17cae62568195137226adcc847d4b6a530985e1cf2d1198767f59d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:23.993432Z","signature_b64":"FyLzoeb9mxBfvOKJyqYwzmtFkSHtw24Ems4haQmjgKq/8Ax4gfY8KEMegoObnx2L2qaY2wJktcQNtLMfN3skBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5e48cc42a17cae62568195137226adcc847d4b6a530985e1cf2d1198767f59d","last_reissued_at":"2026-05-17T23:49:23.992984Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:23.992984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02301","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-17T23:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8o+VQPPUHzdIlC/bSHHQ8A/YlnpXTDEXuuL5VUoxqsGgd1DGBFVIZSXaAO+Et/wn5oIHt4znqJq2/9b18imBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:29:40.825847Z"},"content_sha256":"83351a9f9ffe5e87250eed413190f739b8026b0438936c3e7c2e31aeae403384","schema_version":"1.0","event_id":"sha256:83351a9f9ffe5e87250eed413190f739b8026b0438936c3e7c2e31aeae403384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4XSIZRBKC7FOMJLIDFITOITK3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-Sensitive Feature Selection by Optimizing F-Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chang Xu, Chao Xu, Dacheng Tao, Meng Liu, Yonggang Wen, Yong Luo","submitted_at":"2019-04-04T01:36:04Z","abstract_excerpt":"Feature selection is beneficial for improving the performance of general machine learning tasks by extracting an informative subset from the high-dimensional features. Conventional feature selection methods usually ignore the class imbalance problem, thus the selected features will be biased towards the majority class. Considering that F-measure is a more reasonable performance measure than accuracy for imbalanced data, this paper presents an effective feature selection algorithm that explores the class imbalance issue by optimizing F-measures. Since F-measure optimization can be decomposed in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02301","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-17T23:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJv4/f3JEhsq0dslYVx2WGmEu046PQ1NgsrfsVDD5QZSM9WhndGRMxuWgBvTqN9rxfnUWGVaRL4lJi1orP6VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:29:40.826201Z"},"content_sha256":"d386ee3f1f53ab4cd50bf4e8e7e78ab6ea97ee7d1e7f6465bf387f8ab253328e","schema_version":"1.0","event_id":"sha256:d386ee3f1f53ab4cd50bf4e8e7e78ab6ea97ee7d1e7f6465bf387f8ab253328e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XSIZRBKC7FOMJLIDFITOITK3T/bundle.json","state_url":"https://pith.science/pith/4XSIZRBKC7FOMJLIDFITOITK3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XSIZRBKC7FOMJLIDFITOITK3T/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-05-28T00:29:40Z","links":{"resolver":"https://pith.science/pith/4XSIZRBKC7FOMJLIDFITOITK3T","bundle":"https://pith.science/pith/4XSIZRBKC7FOMJLIDFITOITK3T/bundle.json","state":"https://pith.science/pith/4XSIZRBKC7FOMJLIDFITOITK3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XSIZRBKC7FOMJLIDFITOITK3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4XSIZRBKC7FOMJLIDFITOITK3T","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":"9672e9d25d9ae9200762b60a1cac4b66162455580b66ed610080c78126b9cc75","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T01:36:04Z","title_canon_sha256":"e48674c1ccc88b486e06c38d77b10b1f8b252b8034e8eefe52f17b6181c3beee"},"schema_version":"1.0","source":{"id":"1904.02301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02301","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02301v1","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02301","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"4XSIZRBKC7FO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4XSIZRBKC7FOMJLI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4XSIZRBK","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:d386ee3f1f53ab4cd50bf4e8e7e78ab6ea97ee7d1e7f6465bf387f8ab253328e","target":"graph","created_at":"2026-05-17T23:49:23Z","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":"Feature selection is beneficial for improving the performance of general machine learning tasks by extracting an informative subset from the high-dimensional features. Conventional feature selection methods usually ignore the class imbalance problem, thus the selected features will be biased towards the majority class. Considering that F-measure is a more reasonable performance measure than accuracy for imbalanced data, this paper presents an effective feature selection algorithm that explores the class imbalance issue by optimizing F-measures. Since F-measure optimization can be decomposed in","authors_text":"Chang Xu, Chao Xu, Dacheng Tao, Meng Liu, Yonggang Wen, Yong Luo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T01:36:04Z","title":"Cost-Sensitive Feature Selection by Optimizing F-Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02301","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:83351a9f9ffe5e87250eed413190f739b8026b0438936c3e7c2e31aeae403384","target":"record","created_at":"2026-05-17T23:49:23Z","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":"9672e9d25d9ae9200762b60a1cac4b66162455580b66ed610080c78126b9cc75","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T01:36:04Z","title_canon_sha256":"e48674c1ccc88b486e06c38d77b10b1f8b252b8034e8eefe52f17b6181c3beee"},"schema_version":"1.0","source":{"id":"1904.02301","kind":"arxiv","version":1}},"canonical_sha256":"e5e48cc42a17cae62568195137226adcc847d4b6a530985e1cf2d1198767f59d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5e48cc42a17cae62568195137226adcc847d4b6a530985e1cf2d1198767f59d","first_computed_at":"2026-05-17T23:49:23.992984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:23.992984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FyLzoeb9mxBfvOKJyqYwzmtFkSHtw24Ems4haQmjgKq/8Ax4gfY8KEMegoObnx2L2qaY2wJktcQNtLMfN3skBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:23.993432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83351a9f9ffe5e87250eed413190f739b8026b0438936c3e7c2e31aeae403384","sha256:d386ee3f1f53ab4cd50bf4e8e7e78ab6ea97ee7d1e7f6465bf387f8ab253328e"],"state_sha256":"89a0f5e072a97e62b1c988a1ff9905dad363a170dfba88ce222cef5ab30d3e7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhIEh3m7yApTyR4tqJYKGn94p1rodARuvgJdQFNzg4zdHfNOXCVVSg6hrNZTD6lhD2zPO5L7etmkqZtBbL2mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:29:40.828400Z","bundle_sha256":"fc64f42250a17822a3a7c77a9bbf086fb5b20c4c1801762253264ec024992028"}}