{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PDF7WFU5ZXTCMSVE4UZT7JRSIG","short_pith_number":"pith:PDF7WFU5","canonical_record":{"source":{"id":"1411.2331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-10T05:43:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"893a9a7311376e339265263b87828ffe93c84a3d348948bdf48097b6c7d50c93","abstract_canon_sha256":"26eadf497c9ffebd9150e43aa0a64dd5a4ff27733cfd7e7734b8495cfea074a0"},"schema_version":"1.0"},"canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","source":{"kind":"arxiv","id":"1411.2331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2331","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2331v1","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2331","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"PDF7WFU5ZXTC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDF7WFU5ZXTCMSVE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDF7WFU5","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PDF7WFU5ZXTCMSVE4UZT7JRSIG","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-10T05:43:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"893a9a7311376e339265263b87828ffe93c84a3d348948bdf48097b6c7d50c93","abstract_canon_sha256":"26eadf497c9ffebd9150e43aa0a64dd5a4ff27733cfd7e7734b8495cfea074a0"},"schema_version":"1.0"},"canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:07.809799Z","signature_b64":"qFmyEIaM8GyKS7iHrDBdMfLgGQMrEPq2PVuGLkMiTVUYQhGR7YoiHL0dIjuKLAE52+6WJIi5lZIFO0kyYusoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","last_reissued_at":"2026-05-18T02:38:07.809090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:07.809090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2331","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-18T02:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQPTqHSdvX2/VHLaewNjQhzsdTqa9jVM5d4ikB+7oURefR/NQvxwRlj8s02djfftzfN6Z6nSe2147Wy+OCciBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:48:58.401506Z"},"content_sha256":"515d52fd03bff13d1dd3ed86db454511583046439cae6192d7b184c1ccf928ca","schema_version":"1.0","event_id":"sha256:515d52fd03bff13d1dd3ed86db454511583046439cae6192d7b184c1ccf928ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PDF7WFU5ZXTCMSVE4UZT7JRSIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Avishek Saha, Dawei Yin, Hua Ouyang, Makoto Yamada, Yi Chang","submitted_at":"2014-11-10T05:43:28Z","abstract_excerpt":"We propose a feature selection method that finds non-redundant features from a large and high-dimensional data in nonlinear way. Specifically, we propose a nonlinear extension of the non-negative least-angle regression (LARS) called N${}^3$LARS, where the similarity between input and output is measured through the normalized version of the Hilbert-Schmidt Independence Criterion (HSIC). An advantage of N${}^3$LARS is that it can easily incorporate with map-reduce frameworks such as Hadoop and Spark. Thus, with the help of distributed computing, a set of features can be efficiently selected from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2331","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-18T02:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKZHTVLk6GF2yNMu/CfGZ6ko+doLqqOesyvvaYzQypFtxhAozTAXO/ArgGV0u/Ozn8j/SxtYUz5I2EzbhMZ0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:48:58.401875Z"},"content_sha256":"bedbec3b745269cefbcabd1983d23078e2228935bb562fb86c2da146f474b4df","schema_version":"1.0","event_id":"sha256:bedbec3b745269cefbcabd1983d23078e2228935bb562fb86c2da146f474b4df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/bundle.json","state_url":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/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-31T06:48:58Z","links":{"resolver":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG","bundle":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/bundle.json","state":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PDF7WFU5ZXTCMSVE4UZT7JRSIG","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":"26eadf497c9ffebd9150e43aa0a64dd5a4ff27733cfd7e7734b8495cfea074a0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-10T05:43:28Z","title_canon_sha256":"893a9a7311376e339265263b87828ffe93c84a3d348948bdf48097b6c7d50c93"},"schema_version":"1.0","source":{"id":"1411.2331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2331","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2331v1","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2331","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"PDF7WFU5ZXTC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDF7WFU5ZXTCMSVE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDF7WFU5","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:bedbec3b745269cefbcabd1983d23078e2228935bb562fb86c2da146f474b4df","target":"graph","created_at":"2026-05-18T02:38:07Z","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":"We propose a feature selection method that finds non-redundant features from a large and high-dimensional data in nonlinear way. Specifically, we propose a nonlinear extension of the non-negative least-angle regression (LARS) called N${}^3$LARS, where the similarity between input and output is measured through the normalized version of the Hilbert-Schmidt Independence Criterion (HSIC). An advantage of N${}^3$LARS is that it can easily incorporate with map-reduce frameworks such as Hadoop and Spark. Thus, with the help of distributed computing, a set of features can be efficiently selected from","authors_text":"Avishek Saha, Dawei Yin, Hua Ouyang, Makoto Yamada, Yi Chang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-10T05:43:28Z","title":"N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2331","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:515d52fd03bff13d1dd3ed86db454511583046439cae6192d7b184c1ccf928ca","target":"record","created_at":"2026-05-18T02:38:07Z","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":"26eadf497c9ffebd9150e43aa0a64dd5a4ff27733cfd7e7734b8495cfea074a0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-10T05:43:28Z","title_canon_sha256":"893a9a7311376e339265263b87828ffe93c84a3d348948bdf48097b6c7d50c93"},"schema_version":"1.0","source":{"id":"1411.2331","kind":"arxiv","version":1}},"canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","first_computed_at":"2026-05-18T02:38:07.809090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:07.809090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qFmyEIaM8GyKS7iHrDBdMfLgGQMrEPq2PVuGLkMiTVUYQhGR7YoiHL0dIjuKLAE52+6WJIi5lZIFO0kyYusoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:07.809799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:515d52fd03bff13d1dd3ed86db454511583046439cae6192d7b184c1ccf928ca","sha256:bedbec3b745269cefbcabd1983d23078e2228935bb562fb86c2da146f474b4df"],"state_sha256":"91dc9182790d8051bf9618381602d587bf525ce81c4afd7015ae34053103dc0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Ugb6EXXk3QOhTeEiiH3FcyK+oOxJ+H/sUIhyRof63LKOuucoIqJwImcOsPXHL+KF+WSOvxtSYCBPI4jASRrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:48:58.405872Z","bundle_sha256":"f9523705d5d731813a5f53640b7007f2f9b12355ec8a322e2edb5d78bb216363"}}