{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CSEM5NLMBATETSE6KY6MX23ULQ","short_pith_number":"pith:CSEM5NLM","canonical_record":{"source":{"id":"1404.2948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-10T20:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"f2647d310a2a2a65c43b6b926434431aa1e9e9795818697d04d33dd9dd708df2","abstract_canon_sha256":"d5a7a7f7770e1f715a0209682a0d38ca1219a5faf707a299286de3eba92cadf0"},"schema_version":"1.0"},"canonical_sha256":"1488ceb56c082649c89e563ccbeb745c015db704843083be1c47ca22f562c4b0","source":{"kind":"arxiv","id":"1404.2948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2948","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2948v1","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2948","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"CSEM5NLMBATE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CSEM5NLMBATETSE6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CSEM5NLM","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CSEM5NLMBATETSE6KY6MX23ULQ","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-10T20:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"f2647d310a2a2a65c43b6b926434431aa1e9e9795818697d04d33dd9dd708df2","abstract_canon_sha256":"d5a7a7f7770e1f715a0209682a0d38ca1219a5faf707a299286de3eba92cadf0"},"schema_version":"1.0"},"canonical_sha256":"1488ceb56c082649c89e563ccbeb745c015db704843083be1c47ca22f562c4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:22.835701Z","signature_b64":"cnDi1mpVY7jBiTCE7wc6VLki3Bs7PnH5dr3J7hX8Av4S6r8cfy8vuoga5l2CbACO/RCcFk8H3P+Xbkpv17o+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1488ceb56c082649c89e563ccbeb745c015db704843083be1c47ca22f562c4b0","last_reissued_at":"2026-05-18T02:54:22.835179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:22.835179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2948","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:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMddKjRR83tgKZXkZx09q5bzxTCSyD0OvCjWhR4rC9H9/8LfKIaSP4wlTpKp1OYCxKj5mMXWjAfLP75U+2OWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:35:28.146641Z"},"content_sha256":"674aeda28d5991a9a1ebf670503c37895011412aace25cc8467728ba36c0e0cd","schema_version":"1.0","event_id":"sha256:674aeda28d5991a9a1ebf670503c37895011412aace25cc8467728ba36c0e0cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CSEM5NLMBATETSE6KY6MX23ULQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient-based Laplacian Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Goldenberg, Bo Wang","submitted_at":"2014-04-10T20:49:35Z","abstract_excerpt":"Analysis of high dimensional noisy data is of essence across a variety of research fields. Feature selection techniques are designed to find the relevant feature subset that can facilitate classification or pattern detection. Traditional (supervised) feature selection methods utilize label information to guide the identification of relevant feature subsets. In this paper, however, we consider the unsupervised feature selection problem. Without the label information, it is particularly difficult to identify a small set of relevant features due to the noisy nature of real-world data which corrup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2948","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:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcMk7QPqwSVeVBi3RDDmBarNDWc9EpxHfQyTgYvt7Qxrw07mu1etD4HGdOd+iB4hptrT/t5fHCPQjIl2y73tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:35:28.147293Z"},"content_sha256":"f79784da6e3d3ab8eba69b4799a625a73e9b1aa23098aab88bc0d04879fc5ff0","schema_version":"1.0","event_id":"sha256:f79784da6e3d3ab8eba69b4799a625a73e9b1aa23098aab88bc0d04879fc5ff0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSEM5NLMBATETSE6KY6MX23ULQ/bundle.json","state_url":"https://pith.science/pith/CSEM5NLMBATETSE6KY6MX23ULQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSEM5NLMBATETSE6KY6MX23ULQ/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-07T01:35:28Z","links":{"resolver":"https://pith.science/pith/CSEM5NLMBATETSE6KY6MX23ULQ","bundle":"https://pith.science/pith/CSEM5NLMBATETSE6KY6MX23ULQ/bundle.json","state":"https://pith.science/pith/CSEM5NLMBATETSE6KY6MX23ULQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSEM5NLMBATETSE6KY6MX23ULQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CSEM5NLMBATETSE6KY6MX23ULQ","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":"d5a7a7f7770e1f715a0209682a0d38ca1219a5faf707a299286de3eba92cadf0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-10T20:49:35Z","title_canon_sha256":"f2647d310a2a2a65c43b6b926434431aa1e9e9795818697d04d33dd9dd708df2"},"schema_version":"1.0","source":{"id":"1404.2948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2948","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2948v1","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2948","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"CSEM5NLMBATE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CSEM5NLMBATETSE6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CSEM5NLM","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:f79784da6e3d3ab8eba69b4799a625a73e9b1aa23098aab88bc0d04879fc5ff0","target":"graph","created_at":"2026-05-18T02:54:22Z","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":"Analysis of high dimensional noisy data is of essence across a variety of research fields. Feature selection techniques are designed to find the relevant feature subset that can facilitate classification or pattern detection. Traditional (supervised) feature selection methods utilize label information to guide the identification of relevant feature subsets. In this paper, however, we consider the unsupervised feature selection problem. Without the label information, it is particularly difficult to identify a small set of relevant features due to the noisy nature of real-world data which corrup","authors_text":"Anna Goldenberg, Bo Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-10T20:49:35Z","title":"Gradient-based Laplacian Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2948","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:674aeda28d5991a9a1ebf670503c37895011412aace25cc8467728ba36c0e0cd","target":"record","created_at":"2026-05-18T02:54:22Z","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":"d5a7a7f7770e1f715a0209682a0d38ca1219a5faf707a299286de3eba92cadf0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-10T20:49:35Z","title_canon_sha256":"f2647d310a2a2a65c43b6b926434431aa1e9e9795818697d04d33dd9dd708df2"},"schema_version":"1.0","source":{"id":"1404.2948","kind":"arxiv","version":1}},"canonical_sha256":"1488ceb56c082649c89e563ccbeb745c015db704843083be1c47ca22f562c4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1488ceb56c082649c89e563ccbeb745c015db704843083be1c47ca22f562c4b0","first_computed_at":"2026-05-18T02:54:22.835179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:22.835179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cnDi1mpVY7jBiTCE7wc6VLki3Bs7PnH5dr3J7hX8Av4S6r8cfy8vuoga5l2CbACO/RCcFk8H3P+Xbkpv17o+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:22.835701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:674aeda28d5991a9a1ebf670503c37895011412aace25cc8467728ba36c0e0cd","sha256:f79784da6e3d3ab8eba69b4799a625a73e9b1aa23098aab88bc0d04879fc5ff0"],"state_sha256":"cb0581fb47c5b4cd8cb149216f24b512f3f1d344c25a1ac8dad99ae9acd0dd2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcZK+Hrrols+1ZEAOSn5MxLDbGAZ4wfmpzvgIkHjrnUeMUjteJ8vozKw4uXU4+oQxMhINX9AbS37GVMLNpZ1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:35:28.151147Z","bundle_sha256":"4128a4b1b9268744529e8b14e1b4eb5d23f9a4690e4fc9bb83841682a087a78a"}}