{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LWVGXU56JC6JSNQ6ZXD2KBNIKU","short_pith_number":"pith:LWVGXU56","canonical_record":{"source":{"id":"1606.02827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-09T05:19:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0f9953f43cf4550f8728b2a450e283147c3aa0130e5b014b1db90da4b170afa2","abstract_canon_sha256":"5bf6a24459d4525dbb6005f308462e90cbdb8f122e1a56deedef04b1f1e04dd0"},"schema_version":"1.0"},"canonical_sha256":"5daa6bd3be48bc99361ecdc7a505a85507c1e86e7275480915c547db69530782","source":{"kind":"arxiv","id":"1606.02827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02827","created_at":"2026-05-18T01:12:39Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02827v1","created_at":"2026-05-18T01:12:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02827","created_at":"2026-05-18T01:12:39Z"},{"alias_kind":"pith_short_12","alias_value":"LWVGXU56JC6J","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWVGXU56JC6JSNQ6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWVGXU56","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LWVGXU56JC6JSNQ6ZXD2KBNIKU","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-09T05:19:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0f9953f43cf4550f8728b2a450e283147c3aa0130e5b014b1db90da4b170afa2","abstract_canon_sha256":"5bf6a24459d4525dbb6005f308462e90cbdb8f122e1a56deedef04b1f1e04dd0"},"schema_version":"1.0"},"canonical_sha256":"5daa6bd3be48bc99361ecdc7a505a85507c1e86e7275480915c547db69530782","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:39.906337Z","signature_b64":"OG3hHfYiDAnqxJtVjunjGrgAx5kXSO5cO6pg1Y0pVZy1ukEaKzwvKaOl71hGyR9Q9FE8ykMgIpBBtAG5rKwmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5daa6bd3be48bc99361ecdc7a505a85507c1e86e7275480915c547db69530782","last_reissued_at":"2026-05-18T01:12:39.905972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:39.905972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02827","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-18T01:12:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzzcdbY7bMd0utB6bWlX3pZfjxuoXtAkaQMCi8THgXqKnn51r8SQSuWuo0IQJ0T9NhEYt9LsXY2WRx9H5pGGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:18:02.724949Z"},"content_sha256":"b727ddb57248da3961c5e3a6159832698b8edc4efe1ea3940d2cc5c20f4e5480","schema_version":"1.0","event_id":"sha256:b727ddb57248da3961c5e3a6159832698b8edc4efe1ea3940d2cc5c20f4e5480"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LWVGXU56JC6JSNQ6ZXD2KBNIKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variational Information Maximization for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aram Galstyan, Greg Ver Steeg, Shuyang Gao","submitted_at":"2016-06-09T05:19:23Z","abstract_excerpt":"Feature selection is one of the most fundamental problems in machine learning. An extensive body of work on information-theoretic feature selection exists which is based on maximizing mutual information between subsets of features and class labels. Practical methods are forced to rely on approximations due to the difficulty of estimating mutual information. We demonstrate that approximations made by existing methods are based on unrealistic assumptions. We formulate a more flexible and general class of assumptions based on variational distributions and use them to tractably generate lower boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02827","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-18T01:12:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcxORHKUDIj1mlSUs6ik4NiYV/+lz1uP6ShHWDlsJxPoOTgz2OjsQh6kv8BGTUoIIU0phtA1q3br5IDTEo/DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:18:02.725293Z"},"content_sha256":"d2c5b96d745cba6411908c95b070e493a6d775a4ea231123d44378335e1b8ac8","schema_version":"1.0","event_id":"sha256:d2c5b96d745cba6411908c95b070e493a6d775a4ea231123d44378335e1b8ac8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU/bundle.json","state_url":"https://pith.science/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU/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-07-02T08:18:02Z","links":{"resolver":"https://pith.science/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU","bundle":"https://pith.science/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU/bundle.json","state":"https://pith.science/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWVGXU56JC6JSNQ6ZXD2KBNIKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LWVGXU56JC6JSNQ6ZXD2KBNIKU","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":"5bf6a24459d4525dbb6005f308462e90cbdb8f122e1a56deedef04b1f1e04dd0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-09T05:19:23Z","title_canon_sha256":"0f9953f43cf4550f8728b2a450e283147c3aa0130e5b014b1db90da4b170afa2"},"schema_version":"1.0","source":{"id":"1606.02827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02827","created_at":"2026-05-18T01:12:39Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02827v1","created_at":"2026-05-18T01:12:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02827","created_at":"2026-05-18T01:12:39Z"},{"alias_kind":"pith_short_12","alias_value":"LWVGXU56JC6J","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWVGXU56JC6JSNQ6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWVGXU56","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:d2c5b96d745cba6411908c95b070e493a6d775a4ea231123d44378335e1b8ac8","target":"graph","created_at":"2026-05-18T01:12:39Z","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 one of the most fundamental problems in machine learning. An extensive body of work on information-theoretic feature selection exists which is based on maximizing mutual information between subsets of features and class labels. Practical methods are forced to rely on approximations due to the difficulty of estimating mutual information. We demonstrate that approximations made by existing methods are based on unrealistic assumptions. We formulate a more flexible and general class of assumptions based on variational distributions and use them to tractably generate lower boun","authors_text":"Aram Galstyan, Greg Ver Steeg, Shuyang Gao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-09T05:19:23Z","title":"Variational Information Maximization for Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02827","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:b727ddb57248da3961c5e3a6159832698b8edc4efe1ea3940d2cc5c20f4e5480","target":"record","created_at":"2026-05-18T01:12:39Z","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":"5bf6a24459d4525dbb6005f308462e90cbdb8f122e1a56deedef04b1f1e04dd0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-09T05:19:23Z","title_canon_sha256":"0f9953f43cf4550f8728b2a450e283147c3aa0130e5b014b1db90da4b170afa2"},"schema_version":"1.0","source":{"id":"1606.02827","kind":"arxiv","version":1}},"canonical_sha256":"5daa6bd3be48bc99361ecdc7a505a85507c1e86e7275480915c547db69530782","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5daa6bd3be48bc99361ecdc7a505a85507c1e86e7275480915c547db69530782","first_computed_at":"2026-05-18T01:12:39.905972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:39.905972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OG3hHfYiDAnqxJtVjunjGrgAx5kXSO5cO6pg1Y0pVZy1ukEaKzwvKaOl71hGyR9Q9FE8ykMgIpBBtAG5rKwmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:39.906337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b727ddb57248da3961c5e3a6159832698b8edc4efe1ea3940d2cc5c20f4e5480","sha256:d2c5b96d745cba6411908c95b070e493a6d775a4ea231123d44378335e1b8ac8"],"state_sha256":"d21137723dae43b4f636834fc3e600bf56d18414cf613580757034b2781d2d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hWLKLzUB+OC97PBB+rQyfueSVbiokqZMKv0R9zTxAeAlHyaEe2oTh0YRTjeAYez7Pq9WF1RUvmtBCB6B4dCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:18:02.727285Z","bundle_sha256":"990423e7ddad69cf777734658e5f7e676ade2b3de3cad731885b27584a07cd96"}}