{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KL66GKNCZ3E3NQ34O6DR5KDQ5R","short_pith_number":"pith:KL66GKNC","canonical_record":{"source":{"id":"1903.10039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-24T18:45:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"44c48b5e7d755df2be734f06fdc38ceb3224e46eac32499267e0bfd325e3d307","abstract_canon_sha256":"d6db368af45416e35c20e535f86ef10fdb42cb4cb1e9049bd1580abe94b5e779"},"schema_version":"1.0"},"canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","source":{"kind":"arxiv","id":"1903.10039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10039","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10039v1","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10039","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"KL66GKNCZ3E3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KL66GKNCZ3E3NQ34","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KL66GKNC","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KL66GKNCZ3E3NQ34O6DR5KDQ5R","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-24T18:45:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"44c48b5e7d755df2be734f06fdc38ceb3224e46eac32499267e0bfd325e3d307","abstract_canon_sha256":"d6db368af45416e35c20e535f86ef10fdb42cb4cb1e9049bd1580abe94b5e779"},"schema_version":"1.0"},"canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:34.688646Z","signature_b64":"cYwekjHFqQmAXAU7wBxEdJDIx0sF2EjakN6S/xve/y3xC36XXekta0r1zUqgdogsS0kFjd7QI+eS3gzdm5uFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","last_reissued_at":"2026-05-17T23:50:34.688123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:34.688123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10039","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-17T23:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2CglSI2AbZB5jmQv2s8Coi2qw14/Hy4ACI0n1DeZWVTKae4fAND/jdV9XcVtPlEheMQRwel5AFzxcgUNo7pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:18:03.495510Z"},"content_sha256":"40549f31728d9a591a3b7a51f5b41ef8dbcfb656982fd70cfd75723d4112216a","schema_version":"1.0","event_id":"sha256:40549f31728d9a591a3b7a51f5b41ef8dbcfb656982fd70cfd75723d4112216a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KL66GKNCZ3E3NQ34O6DR5KDQ5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Strongly Consistent Sparse $k$-means Clustering with Direct $l_1$ Penalization on Variable Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Saptarshi Chakraborty, Swagatam Das","submitted_at":"2019-03-24T18:45:35Z","abstract_excerpt":"We propose the Lasso Weighted $k$-means ($LW$-$k$-means) algorithm as a simple yet efficient sparse clustering procedure for high-dimensional data where the number of features ($p$) can be much larger compared to the number of observations ($n$). In the $LW$-$k$-means algorithm, we introduce a lasso-based penalty term, directly on the feature weights to incorporate feature selection in the framework of sparse clustering. $LW$-$k$-means does not make any distributional assumption of the given dataset and thus, induces a non-parametric method for feature selection. We also analytically investiga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10039","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-17T23:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCLOZ+Adj0078UuppmpBIet39g2WvEM63OTw8iLiGiSbMWNa1ywgvtoy16NUupjRzSIqoBjMgGI2FMx/ZbuyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:18:03.495863Z"},"content_sha256":"2dbffe545fb199c539ffad77b8fb8f8c5169078951db33b84ff2b81ba11763bc","schema_version":"1.0","event_id":"sha256:2dbffe545fb199c539ffad77b8fb8f8c5169078951db33b84ff2b81ba11763bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/bundle.json","state_url":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/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-25T01:18:03Z","links":{"resolver":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R","bundle":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/bundle.json","state":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KL66GKNCZ3E3NQ34O6DR5KDQ5R","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":"d6db368af45416e35c20e535f86ef10fdb42cb4cb1e9049bd1580abe94b5e779","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-24T18:45:35Z","title_canon_sha256":"44c48b5e7d755df2be734f06fdc38ceb3224e46eac32499267e0bfd325e3d307"},"schema_version":"1.0","source":{"id":"1903.10039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10039","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10039v1","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10039","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"KL66GKNCZ3E3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KL66GKNCZ3E3NQ34","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KL66GKNC","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2dbffe545fb199c539ffad77b8fb8f8c5169078951db33b84ff2b81ba11763bc","target":"graph","created_at":"2026-05-17T23:50:34Z","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 the Lasso Weighted $k$-means ($LW$-$k$-means) algorithm as a simple yet efficient sparse clustering procedure for high-dimensional data where the number of features ($p$) can be much larger compared to the number of observations ($n$). In the $LW$-$k$-means algorithm, we introduce a lasso-based penalty term, directly on the feature weights to incorporate feature selection in the framework of sparse clustering. $LW$-$k$-means does not make any distributional assumption of the given dataset and thus, induces a non-parametric method for feature selection. We also analytically investiga","authors_text":"Saptarshi Chakraborty, Swagatam Das","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-24T18:45:35Z","title":"A Strongly Consistent Sparse $k$-means Clustering with Direct $l_1$ Penalization on Variable Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10039","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:40549f31728d9a591a3b7a51f5b41ef8dbcfb656982fd70cfd75723d4112216a","target":"record","created_at":"2026-05-17T23:50:34Z","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":"d6db368af45416e35c20e535f86ef10fdb42cb4cb1e9049bd1580abe94b5e779","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-24T18:45:35Z","title_canon_sha256":"44c48b5e7d755df2be734f06fdc38ceb3224e46eac32499267e0bfd325e3d307"},"schema_version":"1.0","source":{"id":"1903.10039","kind":"arxiv","version":1}},"canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","first_computed_at":"2026-05-17T23:50:34.688123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:34.688123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYwekjHFqQmAXAU7wBxEdJDIx0sF2EjakN6S/xve/y3xC36XXekta0r1zUqgdogsS0kFjd7QI+eS3gzdm5uFDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:34.688646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40549f31728d9a591a3b7a51f5b41ef8dbcfb656982fd70cfd75723d4112216a","sha256:2dbffe545fb199c539ffad77b8fb8f8c5169078951db33b84ff2b81ba11763bc"],"state_sha256":"5a573d00e79ffbb3b1b683265d5b75c8668506cb923a14ee1a4e1b2510cb3d35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgRP32AUHMsTjm9fMTIDCoiLGt9/gCVDqF9mHG8hWeJkXFZ+PW2zNSBrAYyjHU45gJtiWwfsK8wJoflG7VeXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T01:18:03.498023Z","bundle_sha256":"d5b5a0c0b9d5155bf276346f1634b4f3d210a35064a6f85e84709f4fe01d718c"}}