{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UQC26ONB2WMEJYDEDCYECO4KAB","short_pith_number":"pith:UQC26ONB","canonical_record":{"source":{"id":"1409.7384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-25T11:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"31d960cf3f37e45340cd6b2d9d5d02ec739e73f01bec260669fc9ced96d3738f","abstract_canon_sha256":"b2c2d631048198122f068ca4db8d8bd30daa872a685f699e2eef8d8219f54a6e"},"schema_version":"1.0"},"canonical_sha256":"a405af39a1d59844e06418b0413b8a006a27140dc38b38ba3e204d123359e2c2","source":{"kind":"arxiv","id":"1409.7384","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7384","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7384v2","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7384","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"UQC26ONB2WME","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UQC26ONB2WMEJYDE","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UQC26ONB","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UQC26ONB2WMEJYDEDCYECO4KAB","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-25T11:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"31d960cf3f37e45340cd6b2d9d5d02ec739e73f01bec260669fc9ced96d3738f","abstract_canon_sha256":"b2c2d631048198122f068ca4db8d8bd30daa872a685f699e2eef8d8219f54a6e"},"schema_version":"1.0"},"canonical_sha256":"a405af39a1d59844e06418b0413b8a006a27140dc38b38ba3e204d123359e2c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:51.425585Z","signature_b64":"ACnyn4f2IFEPxlUoqC7e7RVz7UQsmnsb33V622fifoy95XvLCRP1WxhmkakskwpeZ2tfPCxzcCKi/m2gDRQ5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a405af39a1d59844e06418b0413b8a006a27140dc38b38ba3e204d123359e2c2","last_reissued_at":"2026-05-18T02:37:51.425108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:51.425108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7384","source_version":2,"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-18T02:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejrNZDuE4zVau7ZG4pjWVZZLOoXhcy50I9Tlc6ZNmCmJuSmbOjUJlXqdOAOasdR/scipT/l6QIg0Zvn/wi5kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:59:52.966523Z"},"content_sha256":"1956189a2fc48c00afa6d9a928855063ac807149ebd463efac83019f7f10844c","schema_version":"1.0","event_id":"sha256:1956189a2fc48c00afa6d9a928855063ac807149ebd463efac83019f7f10844c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UQC26ONB2WMEJYDEDCYECO4KAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Semidefinite Programming Based Search Strategy for Feature Selection with Mutual Information Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Beat Pfister, Sarah Hoffmann, Tofigh Naghibi","submitted_at":"2014-09-25T11:57:48Z","abstract_excerpt":"Feature subset selection, as a special case of the general subset selection problem, has been the topic of a considerable number of studies due to the growing importance of data-mining applications. In the feature subset selection problem there are two main issues that need to be addressed: (i) Finding an appropriate measure function than can be fairly fast and robustly computed for high-dimensional data. (ii) A search strategy to optimize the measure over the subset space in a reasonable amount of time. In this article mutual information between features and class labels is considered to be t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7384","kind":"arxiv","version":2},"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-18T02:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLM4JSyz51Cd2uxmhCh3BiWULJekw33GAwW2pLzhqKHI77g90sAuz7y/Rur02rlQYcCF9h87V9Ivu4E+fB7NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:59:52.967154Z"},"content_sha256":"bf9186ec2a8cb1c8dc2f97ff269ea0e5dae31a8ee5a681cdd555969d11f44039","schema_version":"1.0","event_id":"sha256:bf9186ec2a8cb1c8dc2f97ff269ea0e5dae31a8ee5a681cdd555969d11f44039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQC26ONB2WMEJYDEDCYECO4KAB/bundle.json","state_url":"https://pith.science/pith/UQC26ONB2WMEJYDEDCYECO4KAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQC26ONB2WMEJYDEDCYECO4KAB/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-31T09:59:52Z","links":{"resolver":"https://pith.science/pith/UQC26ONB2WMEJYDEDCYECO4KAB","bundle":"https://pith.science/pith/UQC26ONB2WMEJYDEDCYECO4KAB/bundle.json","state":"https://pith.science/pith/UQC26ONB2WMEJYDEDCYECO4KAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQC26ONB2WMEJYDEDCYECO4KAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UQC26ONB2WMEJYDEDCYECO4KAB","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":"b2c2d631048198122f068ca4db8d8bd30daa872a685f699e2eef8d8219f54a6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-25T11:57:48Z","title_canon_sha256":"31d960cf3f37e45340cd6b2d9d5d02ec739e73f01bec260669fc9ced96d3738f"},"schema_version":"1.0","source":{"id":"1409.7384","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7384","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7384v2","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7384","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"UQC26ONB2WME","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UQC26ONB2WMEJYDE","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UQC26ONB","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:bf9186ec2a8cb1c8dc2f97ff269ea0e5dae31a8ee5a681cdd555969d11f44039","target":"graph","created_at":"2026-05-18T02:37:51Z","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 subset selection, as a special case of the general subset selection problem, has been the topic of a considerable number of studies due to the growing importance of data-mining applications. In the feature subset selection problem there are two main issues that need to be addressed: (i) Finding an appropriate measure function than can be fairly fast and robustly computed for high-dimensional data. (ii) A search strategy to optimize the measure over the subset space in a reasonable amount of time. In this article mutual information between features and class labels is considered to be t","authors_text":"Beat Pfister, Sarah Hoffmann, Tofigh Naghibi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-25T11:57:48Z","title":"A Semidefinite Programming Based Search Strategy for Feature Selection with Mutual Information Measure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7384","kind":"arxiv","version":2},"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:1956189a2fc48c00afa6d9a928855063ac807149ebd463efac83019f7f10844c","target":"record","created_at":"2026-05-18T02:37:51Z","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":"b2c2d631048198122f068ca4db8d8bd30daa872a685f699e2eef8d8219f54a6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-25T11:57:48Z","title_canon_sha256":"31d960cf3f37e45340cd6b2d9d5d02ec739e73f01bec260669fc9ced96d3738f"},"schema_version":"1.0","source":{"id":"1409.7384","kind":"arxiv","version":2}},"canonical_sha256":"a405af39a1d59844e06418b0413b8a006a27140dc38b38ba3e204d123359e2c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a405af39a1d59844e06418b0413b8a006a27140dc38b38ba3e204d123359e2c2","first_computed_at":"2026-05-18T02:37:51.425108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:51.425108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ACnyn4f2IFEPxlUoqC7e7RVz7UQsmnsb33V622fifoy95XvLCRP1WxhmkakskwpeZ2tfPCxzcCKi/m2gDRQ5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:51.425585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7384","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1956189a2fc48c00afa6d9a928855063ac807149ebd463efac83019f7f10844c","sha256:bf9186ec2a8cb1c8dc2f97ff269ea0e5dae31a8ee5a681cdd555969d11f44039"],"state_sha256":"403822cd2974aec36f5ea171572f3708c18b4af86d9a5707a63c6f9f17ff0be0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlSrTJDx7TgbxQl41PjeeVIaOEIbI1NcFEpm5TXFzWlUPe2N+0YjMXGx8dxuygNvGYTZWgr4UENXg4yQrvrNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:59:52.970206Z","bundle_sha256":"be8a1b73463861f86230f11329e7857f77ff42460e249cdd897d6e8d8ba80a48"}}