{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X4EKG7LF5YUDURJXOLHWLRZW7U","short_pith_number":"pith:X4EKG7LF","schema_version":"1.0","canonical_sha256":"bf08a37d65ee283a453772cf65c736fd1d082b247f47af1b754653516b94f6cc","source":{"kind":"arxiv","id":"1905.00531","version":5},"attestation_state":"computed","paper":{"title":"Recombinator-k-means: An evolutionary algorithm that exploits k-means++ for recombination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carlo Baldassi","submitted_at":"2019-05-01T23:55:00Z","abstract_excerpt":"We introduce an evolutionary algorithm called recombinator-$k$-means for optimizing the highly non-convex kmeans problem. Its defining feature is that its crossover step involves all the members of the current generation, stochastically recombining them with a repurposed variant of the $k$-means++ seeding algorithm. The recombination also uses a reweighting mechanism that realizes a progressively sharper stochastic selection policy and ensures that the population eventually coalesces into a single solution. We compare this scheme with state-of-the-art alternative, a more standard genetic algor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.00531","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-01T23:55:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"89a70c7dd99a850b1b7d10cb8ecf8873923b2da8c629d6c59822d18983f791dd","abstract_canon_sha256":"26967c9653dea584c5983bd3374bbcd0b598b79064e0c159586a29f3aa9f704b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:23.838538Z","signature_b64":"dMOHEz/9AtGHsxmGBzGE+cjr62UE8BCvVjJLAzMMPYI+r8tHhi1aFmA4Lihtz9PPqGmV6lbSJPOsD37mg2X9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf08a37d65ee283a453772cf65c736fd1d082b247f47af1b754653516b94f6cc","last_reissued_at":"2026-07-05T03:55:23.838125Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:23.838125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recombinator-k-means: An evolutionary algorithm that exploits k-means++ for recombination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carlo Baldassi","submitted_at":"2019-05-01T23:55:00Z","abstract_excerpt":"We introduce an evolutionary algorithm called recombinator-$k$-means for optimizing the highly non-convex kmeans problem. Its defining feature is that its crossover step involves all the members of the current generation, stochastically recombining them with a repurposed variant of the $k$-means++ seeding algorithm. The recombination also uses a reweighting mechanism that realizes a progressively sharper stochastic selection policy and ensures that the population eventually coalesces into a single solution. We compare this scheme with state-of-the-art alternative, a more standard genetic algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00531","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.00531/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.00531","created_at":"2026-07-05T03:55:23.838186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00531v5","created_at":"2026-07-05T03:55:23.838186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00531","created_at":"2026-07-05T03:55:23.838186+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4EKG7LF5YUD","created_at":"2026-07-05T03:55:23.838186+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4EKG7LF5YUDURJX","created_at":"2026-07-05T03:55:23.838186+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4EKG7LF","created_at":"2026-07-05T03:55:23.838186+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22991","citing_title":"Number of Clusters in a Dataset: A Regularized K-means Approach","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U","json":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U.json","graph_json":"https://pith.science/api/pith-number/X4EKG7LF5YUDURJXOLHWLRZW7U/graph.json","events_json":"https://pith.science/api/pith-number/X4EKG7LF5YUDURJXOLHWLRZW7U/events.json","paper":"https://pith.science/paper/X4EKG7LF"},"agent_actions":{"view_html":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U","download_json":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U.json","view_paper":"https://pith.science/paper/X4EKG7LF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00531&json=true","fetch_graph":"https://pith.science/api/pith-number/X4EKG7LF5YUDURJXOLHWLRZW7U/graph.json","fetch_events":"https://pith.science/api/pith-number/X4EKG7LF5YUDURJXOLHWLRZW7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U/action/storage_attestation","attest_author":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U/action/author_attestation","sign_citation":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U/action/citation_signature","submit_replication":"https://pith.science/pith/X4EKG7LF5YUDURJXOLHWLRZW7U/action/replication_record"}},"created_at":"2026-07-05T03:55:23.838186+00:00","updated_at":"2026-07-05T03:55:23.838186+00:00"}