{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PT2W6PND4R3UA67IE5HDYW2G27","short_pith_number":"pith:PT2W6PND","canonical_record":{"source":{"id":"1711.02974","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T14:42:55Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"34fa927f243697df500ee68cdbfd6805bfee6842600328e9f1894164a65df0cf","abstract_canon_sha256":"0fc488b68e6ccba2246e1cf5fce451dee4f8d0cca6344c9c6b6290a03a6666bc"},"schema_version":"1.0"},"canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","source":{"kind":"arxiv","id":"1711.02974","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02974","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02974v4","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02974","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"PT2W6PND4R3U","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PT2W6PND4R3UA67I","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PT2W6PND","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PT2W6PND4R3UA67IE5HDYW2G27","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02974","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T14:42:55Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"34fa927f243697df500ee68cdbfd6805bfee6842600328e9f1894164a65df0cf","abstract_canon_sha256":"0fc488b68e6ccba2246e1cf5fce451dee4f8d0cca6344c9c6b6290a03a6666bc"},"schema_version":"1.0"},"canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.639899Z","signature_b64":"9baRvZnxzKMDgeUShVwFzYCyZdcI+RH+/3pSQpJMNM+CnQEjuI/iGIUAr8iUvk4X5l3VgInBxDW0h7kwCLp/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","last_reissued_at":"2026-05-17T23:45:15.639169Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.639169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02974","source_version":4,"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/K0D/ogrxdlZwPFsCkfPL6VevlFx/T0qU0vlZ2BcZgormNJCtZsMKOwy+W4b4sZnR8AExYO+fRHSRdcJBE5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:40:20.631124Z"},"content_sha256":"b2884cffe7a44011e2af274e52ad85dfc0a46b6d3e146701e853030ad0d510e6","schema_version":"1.0","event_id":"sha256:b2884cffe7a44011e2af274e52ad85dfc0a46b6d3e146701e853030ad0d510e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PT2W6PND4R3UA67IE5HDYW2G27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering with feature selection using alternating minimization, Application to computational biology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyprien Gilet, Jean-Baptiste Caillau, Marie Deprez, Michel Barlaud","submitted_at":"2017-11-08T14:42:55Z","abstract_excerpt":"This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Frobenius norm criterion. We provide a new efficient algorithm named K-sparse which alternates k-means with projection-gradient minimization. The projection-gradient step is a method of splitting type, with exact projection on the $\\ell^1$ ball to promote sparsity. The convergence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02974","kind":"arxiv","version":4},"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTpsnX5CUwrGmhiz+9j7A/aY5SWgQVugweZEI2WHWZkISvu0q4FnIlEoUbArzccwkYhuJ9/gOSxGSW3eDHjXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:40:20.631913Z"},"content_sha256":"485c4a3d629715617188dce29846054306d5eec3aacf85b0c5b69c94c28ea8ed","schema_version":"1.0","event_id":"sha256:485c4a3d629715617188dce29846054306d5eec3aacf85b0c5b69c94c28ea8ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/bundle.json","state_url":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PT2W6PND4R3UA67IE5HDYW2G27/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-06T10:40:20Z","links":{"resolver":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27","bundle":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/bundle.json","state":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PT2W6PND4R3UA67IE5HDYW2G27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PT2W6PND4R3UA67IE5HDYW2G27","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":"0fc488b68e6ccba2246e1cf5fce451dee4f8d0cca6344c9c6b6290a03a6666bc","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T14:42:55Z","title_canon_sha256":"34fa927f243697df500ee68cdbfd6805bfee6842600328e9f1894164a65df0cf"},"schema_version":"1.0","source":{"id":"1711.02974","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02974","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02974v4","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02974","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"PT2W6PND4R3U","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PT2W6PND4R3UA67I","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PT2W6PND","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:485c4a3d629715617188dce29846054306d5eec3aacf85b0c5b69c94c28ea8ed","target":"graph","created_at":"2026-05-17T23:45:15Z","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":"This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Frobenius norm criterion. We provide a new efficient algorithm named K-sparse which alternates k-means with projection-gradient minimization. The projection-gradient step is a method of splitting type, with exact projection on the $\\ell^1$ ball to promote sparsity. The convergence ","authors_text":"Cyprien Gilet, Jean-Baptiste Caillau, Marie Deprez, Michel Barlaud","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T14:42:55Z","title":"Clustering with feature selection using alternating minimization, Application to computational biology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02974","kind":"arxiv","version":4},"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:b2884cffe7a44011e2af274e52ad85dfc0a46b6d3e146701e853030ad0d510e6","target":"record","created_at":"2026-05-17T23:45:15Z","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":"0fc488b68e6ccba2246e1cf5fce451dee4f8d0cca6344c9c6b6290a03a6666bc","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T14:42:55Z","title_canon_sha256":"34fa927f243697df500ee68cdbfd6805bfee6842600328e9f1894164a65df0cf"},"schema_version":"1.0","source":{"id":"1711.02974","kind":"arxiv","version":4}},"canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","first_computed_at":"2026-05-17T23:45:15.639169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.639169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9baRvZnxzKMDgeUShVwFzYCyZdcI+RH+/3pSQpJMNM+CnQEjuI/iGIUAr8iUvk4X5l3VgInBxDW0h7kwCLp/AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.639899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02974","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2884cffe7a44011e2af274e52ad85dfc0a46b6d3e146701e853030ad0d510e6","sha256:485c4a3d629715617188dce29846054306d5eec3aacf85b0c5b69c94c28ea8ed"],"state_sha256":"0eea7c3f91793a8c1a475c729d7917fbde850916b13edc901aba94c093dc7fc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7/h+DoMtNoXHwnVYA6Sfg75VZ0Ez6OPxTqJm05z2VszJzyrDVS2CELnhVsWgny+XRFhkSERT8ycwWKTgY9nCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:40:20.635888Z","bundle_sha256":"d56cdc5b3812cbfca77e4208fbaa0f1045602a47eebdf20fc253bb7c1485224e"}}