{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IPAFMZHW6422FBI62GLDH6GF7Y","short_pith_number":"pith:IPAFMZHW","canonical_record":{"source":{"id":"1210.1960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-06T14:16:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2e7567eb73094d4857ba6bb72915709c6e4222c601f66b3412bf4ecac7cb0d5c","abstract_canon_sha256":"cbd2b121c24c52710565aa38ba1b36ea69033b2d27d73086add14dbe3c146bc1"},"schema_version":"1.0"},"canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","source":{"kind":"arxiv","id":"1210.1960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1960","created_at":"2026-05-18T01:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1960v1","created_at":"2026-05-18T01:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1960","created_at":"2026-05-18T01:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"IPAFMZHW6422","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IPAFMZHW6422FBI6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IPAFMZHW","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IPAFMZHW6422FBI62GLDH6GF7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-06T14:16:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2e7567eb73094d4857ba6bb72915709c6e4222c601f66b3412bf4ecac7cb0d5c","abstract_canon_sha256":"cbd2b121c24c52710565aa38ba1b36ea69033b2d27d73086add14dbe3c146bc1"},"schema_version":"1.0"},"canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:54:05.033372Z","signature_b64":"Hw67Jelfl2uitGiRL9DlyrFoUs7EESg4/Ol82ULrvbCKUg0851jmrUdcyvCDBUQT+GQ4gwR8y7YjqDKP0HH6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","last_reissued_at":"2026-05-18T01:54:05.032931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:54:05.032931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1960","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:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0X0KNQSNSx2tFmqI1dgXuJpXZfkJ/mDxsn1bG9O6xcfzwvhYF3xYvBSl5TyBERyErPwvgHUWDh0Snabd2OynCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:45:16.219086Z"},"content_sha256":"45fffab6d9f27288560494d7859dca7c016681f1088b47e449c95bf79371010b","schema_version":"1.0","event_id":"sha256:45fffab6d9f27288560494d7859dca7c016681f1088b47e449c95bf79371010b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IPAFMZHW6422FBI62GLDH6GF7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Selection via L1-Penalized Squared-Loss Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hirotaka Hachiya, Masashi Sugiyama, Wittawat Jitkrittum","submitted_at":"2012-10-06T14:16:33Z","abstract_excerpt":"Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As an attempt to take feature interaction into account, we propose L1-LSMI, an L1-regularization based algorithm that maximizes a squared-loss variant of mutual information between selected features and outputs. Numerical results show that L1-LSMI performs well in handling redundancy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1960","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:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFxVSBSCvzNh4U15SEseSNAs3CCGWzh7EYhKw30QUgmzqDlzredN/xM6NpgarBlJM5lyu7wf7wI/CYWhSva1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:45:16.219454Z"},"content_sha256":"42ce8774e75edd10e95e52f1596e852427046b06c65d9fd8a004b8108b07322c","schema_version":"1.0","event_id":"sha256:42ce8774e75edd10e95e52f1596e852427046b06c65d9fd8a004b8108b07322c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/bundle.json","state_url":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPAFMZHW6422FBI62GLDH6GF7Y/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-28T12:45:16Z","links":{"resolver":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y","bundle":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/bundle.json","state":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPAFMZHW6422FBI62GLDH6GF7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IPAFMZHW6422FBI62GLDH6GF7Y","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":"cbd2b121c24c52710565aa38ba1b36ea69033b2d27d73086add14dbe3c146bc1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-06T14:16:33Z","title_canon_sha256":"2e7567eb73094d4857ba6bb72915709c6e4222c601f66b3412bf4ecac7cb0d5c"},"schema_version":"1.0","source":{"id":"1210.1960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1960","created_at":"2026-05-18T01:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1960v1","created_at":"2026-05-18T01:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1960","created_at":"2026-05-18T01:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"IPAFMZHW6422","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IPAFMZHW6422FBI6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IPAFMZHW","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:42ce8774e75edd10e95e52f1596e852427046b06c65d9fd8a004b8108b07322c","target":"graph","created_at":"2026-05-18T01:54:05Z","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 technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As an attempt to take feature interaction into account, we propose L1-LSMI, an L1-regularization based algorithm that maximizes a squared-loss variant of mutual information between selected features and outputs. Numerical results show that L1-LSMI performs well in handling redundancy","authors_text":"Hirotaka Hachiya, Masashi Sugiyama, Wittawat Jitkrittum","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-06T14:16:33Z","title":"Feature Selection via L1-Penalized Squared-Loss Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1960","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:45fffab6d9f27288560494d7859dca7c016681f1088b47e449c95bf79371010b","target":"record","created_at":"2026-05-18T01:54:05Z","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":"cbd2b121c24c52710565aa38ba1b36ea69033b2d27d73086add14dbe3c146bc1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-06T14:16:33Z","title_canon_sha256":"2e7567eb73094d4857ba6bb72915709c6e4222c601f66b3412bf4ecac7cb0d5c"},"schema_version":"1.0","source":{"id":"1210.1960","kind":"arxiv","version":1}},"canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","first_computed_at":"2026-05-18T01:54:05.032931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:54:05.032931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hw67Jelfl2uitGiRL9DlyrFoUs7EESg4/Ol82ULrvbCKUg0851jmrUdcyvCDBUQT+GQ4gwR8y7YjqDKP0HH6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:54:05.033372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45fffab6d9f27288560494d7859dca7c016681f1088b47e449c95bf79371010b","sha256:42ce8774e75edd10e95e52f1596e852427046b06c65d9fd8a004b8108b07322c"],"state_sha256":"4f3f8678e33e60758f9ad5a686d04342643e6c162023781339f1b02e8227d2be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3S4cycSmLlYNBqhO36q0P/nAXrJ6Wqa5NL5GjuTT7XjH5HC+PvtosjStkmKVWvcgbwUwoASgqYkrnGSjq7tcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:45:16.221669Z","bundle_sha256":"2daa8ca0f8537696da29c0941f69646891d2e09ae8f75bdecb6d153a39dfcf3d"}}