{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DKIPLQNYCFUXDFMYP34BRPBVLP","short_pith_number":"pith:DKIPLQNY","canonical_record":{"source":{"id":"1612.00554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T03:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"f338642bb686e31f9e817bc407a43452bf1e0268271a13babcedb17302cd4234","abstract_canon_sha256":"8a314dfc942f4522c1df5c6d4a91a0c2d90aa218a6dc1d8b6eeec931b53a0b84"},"schema_version":"1.0"},"canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","source":{"kind":"arxiv","id":"1612.00554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00554","created_at":"2026-05-18T00:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00554v1","created_at":"2026-05-18T00:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00554","created_at":"2026-05-18T00:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"DKIPLQNYCFUX","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKIPLQNYCFUXDFMY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKIPLQNY","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DKIPLQNYCFUXDFMYP34BRPBVLP","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T03:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"f338642bb686e31f9e817bc407a43452bf1e0268271a13babcedb17302cd4234","abstract_canon_sha256":"8a314dfc942f4522c1df5c6d4a91a0c2d90aa218a6dc1d8b6eeec931b53a0b84"},"schema_version":"1.0"},"canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:59.709650Z","signature_b64":"drdF1HDU4PcLGXb1+KiM7aSg5j7m5hBZecOe97112M6sTZw6Ncnau743WdEWLtnL79GB0ErNsqMyrepRYx+lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","last_reissued_at":"2026-05-18T00:55:59.709038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:59.709038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00554","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:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECaoJZ9WAvjofPAso1BFt3nWfUY4rmnIgu4EVRnS7ug3us6zXnfDttMrBtUIQgA0yBGOWRxFr5GowS/8BEQZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:35:58.378996Z"},"content_sha256":"fc7c4f0abaeb5aabebef1b4a0e0336c6ad14a64f7b9647110e8dcc66b9bc157a","schema_version":"1.0","event_id":"sha256:fc7c4f0abaeb5aabebef1b4a0e0336c6ad14a64f7b9647110e8dcc66b9bc157a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DKIPLQNYCFUXDFMYP34BRPBVLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher Order Mutual Information Approximation for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandrajit Bajaj, Jilin Wu, Soumyajit Gupta","submitted_at":"2016-12-02T03:34:44Z","abstract_excerpt":"Feature selection is a process of choosing a subset of relevant features so that the quality of prediction models can be improved. An extensive body of work exists on information-theoretic feature selection, based on maximizing Mutual Information (MI) between subsets of features and class labels. The prior methods use a lower order approximation, by treating the joint entropy as a summation of several single variable entropies. This leads to locally optimal selections and misses multi-way feature combinations. We present a higher order MI based approximation technique called Higher Order Featu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00554","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:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2eqfrEKnPi1MTX8PqkDDEFxVvyNcDTpJNlqooXVUZsCVrXbQYt5M9ljvvXUk0k482eh/x1AGBSmzYaBNHXrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:35:58.379345Z"},"content_sha256":"b150a45bf3bc48da8f8dace8977dac23894f0db58c467f8006e2445891f4d601","schema_version":"1.0","event_id":"sha256:b150a45bf3bc48da8f8dace8977dac23894f0db58c467f8006e2445891f4d601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/bundle.json","state_url":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/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-29T03:35:58Z","links":{"resolver":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP","bundle":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/bundle.json","state":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DKIPLQNYCFUXDFMYP34BRPBVLP","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":"8a314dfc942f4522c1df5c6d4a91a0c2d90aa218a6dc1d8b6eeec931b53a0b84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T03:34:44Z","title_canon_sha256":"f338642bb686e31f9e817bc407a43452bf1e0268271a13babcedb17302cd4234"},"schema_version":"1.0","source":{"id":"1612.00554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00554","created_at":"2026-05-18T00:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00554v1","created_at":"2026-05-18T00:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00554","created_at":"2026-05-18T00:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"DKIPLQNYCFUX","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKIPLQNYCFUXDFMY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKIPLQNY","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:b150a45bf3bc48da8f8dace8977dac23894f0db58c467f8006e2445891f4d601","target":"graph","created_at":"2026-05-18T00:55:59Z","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 a process of choosing a subset of relevant features so that the quality of prediction models can be improved. An extensive body of work exists on information-theoretic feature selection, based on maximizing Mutual Information (MI) between subsets of features and class labels. The prior methods use a lower order approximation, by treating the joint entropy as a summation of several single variable entropies. This leads to locally optimal selections and misses multi-way feature combinations. We present a higher order MI based approximation technique called Higher Order Featu","authors_text":"Chandrajit Bajaj, Jilin Wu, Soumyajit Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T03:34:44Z","title":"Higher Order Mutual Information Approximation for Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00554","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:fc7c4f0abaeb5aabebef1b4a0e0336c6ad14a64f7b9647110e8dcc66b9bc157a","target":"record","created_at":"2026-05-18T00:55:59Z","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":"8a314dfc942f4522c1df5c6d4a91a0c2d90aa218a6dc1d8b6eeec931b53a0b84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T03:34:44Z","title_canon_sha256":"f338642bb686e31f9e817bc407a43452bf1e0268271a13babcedb17302cd4234"},"schema_version":"1.0","source":{"id":"1612.00554","kind":"arxiv","version":1}},"canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","first_computed_at":"2026-05-18T00:55:59.709038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:59.709038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"drdF1HDU4PcLGXb1+KiM7aSg5j7m5hBZecOe97112M6sTZw6Ncnau743WdEWLtnL79GB0ErNsqMyrepRYx+lBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:59.709650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7c4f0abaeb5aabebef1b4a0e0336c6ad14a64f7b9647110e8dcc66b9bc157a","sha256:b150a45bf3bc48da8f8dace8977dac23894f0db58c467f8006e2445891f4d601"],"state_sha256":"813260b9b3726b529f160aadc6b8a421d1616b237c180f793e243843c6b04eea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lOj6hvXzdqfeGvcQuJYFTmo2q2V9pD6Nb+9UL7er0MA8IgTJy1A+b2wdOMGRrd29QJo7kqv/YuwLN51ASSqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:35:58.381174Z","bundle_sha256":"42f2ece1bd658bd2e001ffecbd1bc453eed83293d12f36255c24664bcf2f3b59"}}