{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LGDXSP2CXJGWEZJBFRXAO3XH6K","short_pith_number":"pith:LGDXSP2C","canonical_record":{"source":{"id":"1804.09813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-25T21:54:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"daf9bf229e972144aed61ccfcd4cf068f3c7e32419220fc33e3f0585a2a8cacc","abstract_canon_sha256":"54c87f757bea5dfa1b3a8701790c702b59965ba9715584b0a501bbb50c6456ff"},"schema_version":"1.0"},"canonical_sha256":"5987793f42ba4d6265212c6e076ee7f2b96cbc4a4a6a593ebfe956dbaef24ff6","source":{"kind":"arxiv","id":"1804.09813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09813","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09813v2","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09813","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"LGDXSP2CXJGW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGDXSP2CXJGWEZJB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGDXSP2C","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LGDXSP2CXJGWEZJBFRXAO3XH6K","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-25T21:54:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"daf9bf229e972144aed61ccfcd4cf068f3c7e32419220fc33e3f0585a2a8cacc","abstract_canon_sha256":"54c87f757bea5dfa1b3a8701790c702b59965ba9715584b0a501bbb50c6456ff"},"schema_version":"1.0"},"canonical_sha256":"5987793f42ba4d6265212c6e076ee7f2b96cbc4a4a6a593ebfe956dbaef24ff6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.131613Z","signature_b64":"dkXHH0SroFuVjZd/FxskxyhT+0pkLO9uHTel/DK6lqwRj46NIqzElIte8rQU0hQ/vStMgNiq1pM9XbrjBDfPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5987793f42ba4d6265212c6e076ee7f2b96cbc4a4a6a593ebfe956dbaef24ff6","last_reissued_at":"2026-05-17T23:57:54.130943Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.130943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09813","source_version":2,"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:57:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+JkpYTIXiEFgaTn+g5D+VQEPm2D3CypmgZCHSXq6geeDPdZLpQy7TPd0iZNdsI3dmR7SGDsx2TbEpX0lRaRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:34.325124Z"},"content_sha256":"7d6e55b832c69579c98752133de86fa4d7678bad010178b53727eb0723efedd1","schema_version":"1.0","event_id":"sha256:7d6e55b832c69579c98752133de86fa4d7678bad010178b53727eb0723efedd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LGDXSP2CXJGWEZJBFRXAO3XH6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Gribel, Thibaut Vidal","submitted_at":"2018-04-25T21:54:21Z","abstract_excerpt":"Minimum sum-of-squares clustering (MSSC) is a widely used clustering model, of which the popular K-means algorithm constitutes a local minimizer. It is well known that the solutions of K-means can be arbitrarily distant from the true MSSC global optimum, and dozens of alternative heuristics have been proposed for this problem. However, no other algorithm has been predominantly adopted in the literature. This may be related to differences of computational effort, or to the assumption that a near-optimal solution of the MSSC has only a marginal impact on clustering validity. In this article, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09813","kind":"arxiv","version":2},"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:57:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANIihOyIvkB5lNghWqBTO6BMKpOdltHIIuaSbh+EIQ1y06Xz35oKwFnbcANATkKW/fu84AqFNW9RZQgsnm8KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:34.325557Z"},"content_sha256":"a7d29e9313edc4a60dca3240f6a20ef6f0b9a8965fd2977a2c81b95ab92ac726","schema_version":"1.0","event_id":"sha256:a7d29e9313edc4a60dca3240f6a20ef6f0b9a8965fd2977a2c81b95ab92ac726"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K/bundle.json","state_url":"https://pith.science/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K/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-25T16:35:34Z","links":{"resolver":"https://pith.science/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K","bundle":"https://pith.science/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K/bundle.json","state":"https://pith.science/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGDXSP2CXJGWEZJBFRXAO3XH6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LGDXSP2CXJGWEZJBFRXAO3XH6K","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":"54c87f757bea5dfa1b3a8701790c702b59965ba9715584b0a501bbb50c6456ff","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-25T21:54:21Z","title_canon_sha256":"daf9bf229e972144aed61ccfcd4cf068f3c7e32419220fc33e3f0585a2a8cacc"},"schema_version":"1.0","source":{"id":"1804.09813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09813","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09813v2","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09813","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"LGDXSP2CXJGW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGDXSP2CXJGWEZJB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGDXSP2C","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:a7d29e9313edc4a60dca3240f6a20ef6f0b9a8965fd2977a2c81b95ab92ac726","target":"graph","created_at":"2026-05-17T23:57:54Z","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":"Minimum sum-of-squares clustering (MSSC) is a widely used clustering model, of which the popular K-means algorithm constitutes a local minimizer. It is well known that the solutions of K-means can be arbitrarily distant from the true MSSC global optimum, and dozens of alternative heuristics have been proposed for this problem. However, no other algorithm has been predominantly adopted in the literature. This may be related to differences of computational effort, or to the assumption that a near-optimal solution of the MSSC has only a marginal impact on clustering validity. In this article, we ","authors_text":"Daniel Gribel, Thibaut Vidal","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-25T21:54:21Z","title":"HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09813","kind":"arxiv","version":2},"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:7d6e55b832c69579c98752133de86fa4d7678bad010178b53727eb0723efedd1","target":"record","created_at":"2026-05-17T23:57:54Z","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":"54c87f757bea5dfa1b3a8701790c702b59965ba9715584b0a501bbb50c6456ff","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-25T21:54:21Z","title_canon_sha256":"daf9bf229e972144aed61ccfcd4cf068f3c7e32419220fc33e3f0585a2a8cacc"},"schema_version":"1.0","source":{"id":"1804.09813","kind":"arxiv","version":2}},"canonical_sha256":"5987793f42ba4d6265212c6e076ee7f2b96cbc4a4a6a593ebfe956dbaef24ff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5987793f42ba4d6265212c6e076ee7f2b96cbc4a4a6a593ebfe956dbaef24ff6","first_computed_at":"2026-05-17T23:57:54.130943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:54.130943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dkXHH0SroFuVjZd/FxskxyhT+0pkLO9uHTel/DK6lqwRj46NIqzElIte8rQU0hQ/vStMgNiq1pM9XbrjBDfPAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:54.131613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d6e55b832c69579c98752133de86fa4d7678bad010178b53727eb0723efedd1","sha256:a7d29e9313edc4a60dca3240f6a20ef6f0b9a8965fd2977a2c81b95ab92ac726"],"state_sha256":"1d36277233611df66cf969e6fa66a6aaf8919cbcd31689665682bf19a8d7dbfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SM99FX6FjjZlQxgjU6HmrhMN7hjJ1bLRTGUyp001LrnCcJ+chxob8Cv0U9yFzYs+HCPQ0vyw7e2ODyB/8/0VAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:35:34.330009Z","bundle_sha256":"5c3c6db1b9afd00f9850952fc20331863bff8673ae9cca5ec9dafaad9b01b803"}}