{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XWRDJXOYVPMY7KUWZEBCRABZR2","short_pith_number":"pith:XWRDJXOY","canonical_record":{"source":{"id":"2410.06187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T16:51:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8895a547ed1cff83add4eb1f9f8deb674d6b22f3d01511ac52de0881ae12cae7","abstract_canon_sha256":"8864147d21aa96ea57a0607e3ddabcce3f3250a3295c8623ae83248253f217b8"},"schema_version":"1.0"},"canonical_sha256":"bda234ddd8abd98faa96c9022880398e8f565ac5fed5d1d6eac5d05f50551867","source":{"kind":"arxiv","id":"2410.06187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06187","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06187v2","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06187","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"XWRDJXOYVPMY","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"pith_short_16","alias_value":"XWRDJXOYVPMY7KUW","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"pith_short_8","alias_value":"XWRDJXOY","created_at":"2026-07-05T11:38:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XWRDJXOYVPMY7KUWZEBCRABZR2","target":"record","payload":{"canonical_record":{"source":{"id":"2410.06187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T16:51:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8895a547ed1cff83add4eb1f9f8deb674d6b22f3d01511ac52de0881ae12cae7","abstract_canon_sha256":"8864147d21aa96ea57a0607e3ddabcce3f3250a3295c8623ae83248253f217b8"},"schema_version":"1.0"},"canonical_sha256":"bda234ddd8abd98faa96c9022880398e8f565ac5fed5d1d6eac5d05f50551867","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:24.628673Z","signature_b64":"lAnxBZ19+Fw1i66U8j4k9mlG9vjw2Wptw53P8OAmAK7znNZrOFf/OYK95LGSmanZItTEf+ltsa/ld1KRetvbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda234ddd8abd98faa96c9022880398e8f565ac5fed5d1d6eac5d05f50551867","last_reissued_at":"2026-07-05T11:38:24.628154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:24.628154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.06187","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-07-05T11:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfMA+h+37ym0hsCJ63N3FOCRnc61NMYmbUZcAjwU3S+H/UkkDYHsAxk+C9GOYBCwBxEsIqatT/Eze5Ih0Yz4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:05:15.546291Z"},"content_sha256":"afa77bf08c97b329721581ed41cc34748c006e8b7657df2be5c739df2cd826c3","schema_version":"1.0","event_id":"sha256:afa77bf08c97b329721581ed41cc34748c006e8b7657df2be5c739df2cd826c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XWRDJXOYVPMY7KUWZEBCRABZR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Antonio M. Sudoso, Daniel Aloise","submitted_at":"2024-10-08T16:51:28Z","abstract_excerpt":"The minimum sum-of-squares clustering problem (MSSC), also known as $k$-means clustering, refers to the problem of partitioning $n$ data points into $k$ clusters, with the objective of minimizing the total sum of squared Euclidean distances between each point and the center of its assigned cluster. We propose an efficient algorithm for solving large-scale MSSC instances, which combines column generation (CG) with dynamic constraint aggregation (DCA) to effectively reduce the number of constraints considered in the CG master problem. DCA was originally conceived to reduce degeneracy in set part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06187","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.06187/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"},"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-07-05T11:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KVuXCTIMx3zpWQfhSD1ER7C+aE9DzNu2fJJK2ha3okkT8TMLs5Mx30dgsw93g/iZdce9EZM/QzBDDHN9my5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:05:15.546817Z"},"content_sha256":"1927babdffe17199534ca1f8cee9537bda1283077e899089ab1e183944ce6b83","schema_version":"1.0","event_id":"sha256:1927babdffe17199534ca1f8cee9537bda1283077e899089ab1e183944ce6b83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWRDJXOYVPMY7KUWZEBCRABZR2/bundle.json","state_url":"https://pith.science/pith/XWRDJXOYVPMY7KUWZEBCRABZR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWRDJXOYVPMY7KUWZEBCRABZR2/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-08-01T09:05:15Z","links":{"resolver":"https://pith.science/pith/XWRDJXOYVPMY7KUWZEBCRABZR2","bundle":"https://pith.science/pith/XWRDJXOYVPMY7KUWZEBCRABZR2/bundle.json","state":"https://pith.science/pith/XWRDJXOYVPMY7KUWZEBCRABZR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWRDJXOYVPMY7KUWZEBCRABZR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XWRDJXOYVPMY7KUWZEBCRABZR2","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":"8864147d21aa96ea57a0607e3ddabcce3f3250a3295c8623ae83248253f217b8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T16:51:28Z","title_canon_sha256":"8895a547ed1cff83add4eb1f9f8deb674d6b22f3d01511ac52de0881ae12cae7"},"schema_version":"1.0","source":{"id":"2410.06187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06187","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06187v2","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06187","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"XWRDJXOYVPMY","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"pith_short_16","alias_value":"XWRDJXOYVPMY7KUW","created_at":"2026-07-05T11:38:24Z"},{"alias_kind":"pith_short_8","alias_value":"XWRDJXOY","created_at":"2026-07-05T11:38:24Z"}],"graph_snapshots":[{"event_id":"sha256:1927babdffe17199534ca1f8cee9537bda1283077e899089ab1e183944ce6b83","target":"graph","created_at":"2026-07-05T11:38:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.06187/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The minimum sum-of-squares clustering problem (MSSC), also known as $k$-means clustering, refers to the problem of partitioning $n$ data points into $k$ clusters, with the objective of minimizing the total sum of squared Euclidean distances between each point and the center of its assigned cluster. We propose an efficient algorithm for solving large-scale MSSC instances, which combines column generation (CG) with dynamic constraint aggregation (DCA) to effectively reduce the number of constraints considered in the CG master problem. DCA was originally conceived to reduce degeneracy in set part","authors_text":"Antonio M. Sudoso, Daniel Aloise","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T16:51:28Z","title":"A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06187","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:afa77bf08c97b329721581ed41cc34748c006e8b7657df2be5c739df2cd826c3","target":"record","created_at":"2026-07-05T11:38:24Z","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":"8864147d21aa96ea57a0607e3ddabcce3f3250a3295c8623ae83248253f217b8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T16:51:28Z","title_canon_sha256":"8895a547ed1cff83add4eb1f9f8deb674d6b22f3d01511ac52de0881ae12cae7"},"schema_version":"1.0","source":{"id":"2410.06187","kind":"arxiv","version":2}},"canonical_sha256":"bda234ddd8abd98faa96c9022880398e8f565ac5fed5d1d6eac5d05f50551867","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bda234ddd8abd98faa96c9022880398e8f565ac5fed5d1d6eac5d05f50551867","first_computed_at":"2026-07-05T11:38:24.628154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:24.628154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lAnxBZ19+Fw1i66U8j4k9mlG9vjw2Wptw53P8OAmAK7znNZrOFf/OYK95LGSmanZItTEf+ltsa/ld1KRetvbCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:24.628673Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.06187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afa77bf08c97b329721581ed41cc34748c006e8b7657df2be5c739df2cd826c3","sha256:1927babdffe17199534ca1f8cee9537bda1283077e899089ab1e183944ce6b83"],"state_sha256":"b612d0c3b98db27316311ee77def584654961ecf625ab865dd1d12d1be69e6e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBYQAXXUoOcA/MC6IoXl/k19285Uz1NPZYvsN4qmAguSjkZ7XLxxVfqSRlV1+9OaLxsorG7L2EcHFVIU+sNvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:05:15.550320Z","bundle_sha256":"844cd0105178b198ce16c93dd1812bd98e433c3e19f73d69522361c5614d40a9"}}