{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:A3GFF7EO6YYJBMTOOVXKJKI4WH","short_pith_number":"pith:A3GFF7EO","canonical_record":{"source":{"id":"2502.08397","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-12T13:40:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"75f547e1fddc4a44956e797abb84a645184d98afeec78f65cf1526ed886eaea0","abstract_canon_sha256":"e2f1151cc9c5e34d7deac0158ee917500a7c9953b52d714f28ec144c248c674c"},"schema_version":"1.0"},"canonical_sha256":"06cc52fc8ef63090b26e756ea4a91cb1e05b8c8c3282e5f2744f5cc3f99f79d6","source":{"kind":"arxiv","id":"2502.08397","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08397","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08397v3","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08397","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"A3GFF7EO6YYJ","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"pith_short_16","alias_value":"A3GFF7EO6YYJBMTO","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"pith_short_8","alias_value":"A3GFF7EO","created_at":"2026-08-05T00:40:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:A3GFF7EO6YYJBMTOOVXKJKI4WH","target":"record","payload":{"canonical_record":{"source":{"id":"2502.08397","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-12T13:40:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"75f547e1fddc4a44956e797abb84a645184d98afeec78f65cf1526ed886eaea0","abstract_canon_sha256":"e2f1151cc9c5e34d7deac0158ee917500a7c9953b52d714f28ec144c248c674c"},"schema_version":"1.0"},"canonical_sha256":"06cc52fc8ef63090b26e756ea4a91cb1e05b8c8c3282e5f2744f5cc3f99f79d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T00:40:39.399061Z","signature_b64":"o3AHFk2ebWDBaDob/iKpUi7nWATVrBIm6bfDQvlFR91KiXU8NfQK3Em2qkfZ041jNDmwKkzYbxrRHaluLhg2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06cc52fc8ef63090b26e756ea4a91cb1e05b8c8c3282e5f2744f5cc3f99f79d6","last_reissued_at":"2026-08-05T00:40:39.396426Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T00:40:39.396426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.08397","source_version":3,"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-08-05T00:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98pu+YPeFyfwKcjtbTSxSlsZdt/KYYbUwzaAKu4mEPMwmmI8cCsaS3yspWmApapACoPnj/DxjplXpZN94VQABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:23:30.534188Z"},"content_sha256":"d36c72c970baef80886963d56a11e0ec87e48d58c0d25a8681217ca87682ae67","schema_version":"1.0","event_id":"sha256:d36c72c970baef80886963d56a11e0ec87e48d58c0d25a8681217ca87682ae67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:A3GFF7EO6YYJBMTOOVXKJKI4WH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong bounds for large-scale 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":"Anna Livia Croella, Antonio M. Sudoso, Veronica Piccialli","submitted_at":"2025-02-12T13:40:00Z","abstract_excerpt":"Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together. Among various clustering methods, the Minimum Sum-of-Squares Clustering (MSSC) is one of the most widely used. MSSC aims to minimize the total squared Euclidean distance between data points and their corresponding cluster centroids. Due to the unsupervised nature of clustering, achieving global optimality is crucial, yet computationally challenging. The complexity of finding the global solution increases exponentially with the number of data points, making exact methods impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08397","kind":"arxiv","version":3},"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/2502.08397/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-08-05T00:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGqwf+HKMnpH1tNG7+mE03yfEKKPAfWivoeM/UzSZHJlX2rekpIh0k7wf/6H1q+y5KYEINDKEg1kiA9f/TjoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:23:30.534919Z"},"content_sha256":"acc75c32f0b84e184445b52f57d045a0c8fb70d98d1c6ca89a0e962e88be9a41","schema_version":"1.0","event_id":"sha256:acc75c32f0b84e184445b52f57d045a0c8fb70d98d1c6ca89a0e962e88be9a41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH/bundle.json","state_url":"https://pith.science/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH/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-06T06:23:30Z","links":{"resolver":"https://pith.science/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH","bundle":"https://pith.science/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH/bundle.json","state":"https://pith.science/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3GFF7EO6YYJBMTOOVXKJKI4WH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A3GFF7EO6YYJBMTOOVXKJKI4WH","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":"e2f1151cc9c5e34d7deac0158ee917500a7c9953b52d714f28ec144c248c674c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-12T13:40:00Z","title_canon_sha256":"75f547e1fddc4a44956e797abb84a645184d98afeec78f65cf1526ed886eaea0"},"schema_version":"1.0","source":{"id":"2502.08397","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08397","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08397v3","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08397","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"A3GFF7EO6YYJ","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"pith_short_16","alias_value":"A3GFF7EO6YYJBMTO","created_at":"2026-08-05T00:40:39Z"},{"alias_kind":"pith_short_8","alias_value":"A3GFF7EO","created_at":"2026-08-05T00:40:39Z"}],"graph_snapshots":[{"event_id":"sha256:acc75c32f0b84e184445b52f57d045a0c8fb70d98d1c6ca89a0e962e88be9a41","target":"graph","created_at":"2026-08-05T00:40:39Z","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/2502.08397/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together. Among various clustering methods, the Minimum Sum-of-Squares Clustering (MSSC) is one of the most widely used. MSSC aims to minimize the total squared Euclidean distance between data points and their corresponding cluster centroids. Due to the unsupervised nature of clustering, achieving global optimality is crucial, yet computationally challenging. The complexity of finding the global solution increases exponentially with the number of data points, making exact methods impr","authors_text":"Anna Livia Croella, Antonio M. Sudoso, Veronica Piccialli","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-12T13:40:00Z","title":"Strong bounds for large-scale Minimum Sum-of-Squares Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08397","kind":"arxiv","version":3},"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:d36c72c970baef80886963d56a11e0ec87e48d58c0d25a8681217ca87682ae67","target":"record","created_at":"2026-08-05T00:40:39Z","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":"e2f1151cc9c5e34d7deac0158ee917500a7c9953b52d714f28ec144c248c674c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-12T13:40:00Z","title_canon_sha256":"75f547e1fddc4a44956e797abb84a645184d98afeec78f65cf1526ed886eaea0"},"schema_version":"1.0","source":{"id":"2502.08397","kind":"arxiv","version":3}},"canonical_sha256":"06cc52fc8ef63090b26e756ea4a91cb1e05b8c8c3282e5f2744f5cc3f99f79d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06cc52fc8ef63090b26e756ea4a91cb1e05b8c8c3282e5f2744f5cc3f99f79d6","first_computed_at":"2026-08-05T00:40:39.396426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T00:40:39.396426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o3AHFk2ebWDBaDob/iKpUi7nWATVrBIm6bfDQvlFR91KiXU8NfQK3Em2qkfZ041jNDmwKkzYbxrRHaluLhg2Ag==","signature_status":"signed_v1","signed_at":"2026-08-05T00:40:39.399061Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08397","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d36c72c970baef80886963d56a11e0ec87e48d58c0d25a8681217ca87682ae67","sha256:acc75c32f0b84e184445b52f57d045a0c8fb70d98d1c6ca89a0e962e88be9a41"],"state_sha256":"dfa4bfdb326a92ede72e7d16a8b8006c0fab8c9fa47c27454d2b45c767172fb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxtGqqx7MHeaUcYOCbRag20WVB+v6cmhJV2EVg4yxuAAasJtcMt27nzjRaj0xhZU17uoYrQt+i1EPUbD1WOvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:23:30.540709Z","bundle_sha256":"ab347ad5087533048a3e8338c3e6bdbd246f7c28de79697f98996038442a8aef"}}