{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GIBXVLZ44CEK3T4OF35SA3NN46","short_pith_number":"pith:GIBXVLZ4","canonical_record":{"source":{"id":"2605.24673","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-23T17:17:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f9b46be108bc6f8058173e4d3a4ca856c4606dec39891f7c608061595a17720d","abstract_canon_sha256":"f5a41bee06d10c361c0bc114d3ce27507060341136cab7a7fbec6351aa6cd797"},"schema_version":"1.0"},"canonical_sha256":"32037aaf3ce088adcf8e2efb206dade782d0b5378009b5b1348f572c37dbab20","source":{"kind":"arxiv","id":"2605.24673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24673","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24673v1","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24673","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"GIBXVLZ44CEK","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"GIBXVLZ44CEK3T4O","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"GIBXVLZ4","created_at":"2026-05-26T01:03:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GIBXVLZ44CEK3T4OF35SA3NN46","target":"record","payload":{"canonical_record":{"source":{"id":"2605.24673","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-23T17:17:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f9b46be108bc6f8058173e4d3a4ca856c4606dec39891f7c608061595a17720d","abstract_canon_sha256":"f5a41bee06d10c361c0bc114d3ce27507060341136cab7a7fbec6351aa6cd797"},"schema_version":"1.0"},"canonical_sha256":"32037aaf3ce088adcf8e2efb206dade782d0b5378009b5b1348f572c37dbab20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:52.519883Z","signature_b64":"hGbPVf0RfcOohFoOo+D/moE4ZfIs4Sk+ePqpJPn3SGnZkFqe1xlAbCFiFYYGqoD04fdNkBi9MVQqpO3TfB5PBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32037aaf3ce088adcf8e2efb206dade782d0b5378009b5b1348f572c37dbab20","last_reissued_at":"2026-05-26T01:03:52.518889Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:52.518889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.24673","source_version":1,"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-26T01:03:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0wRppVKQb+w9UuH1XgBXtehw4OzMKEwAsU3esRtjmwMi61ZDPqij7QDiXUqIvmbsJ8IMRCc43LzTaMiQaPkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:05:47.175811Z"},"content_sha256":"7e3c054e97db5ce01fdbfd159e5331ee095d9fbfdd8c31dc6c1daf73b1ce6baf","schema_version":"1.0","event_id":"sha256:7e3c054e97db5ce01fdbfd159e5331ee095d9fbfdd8c31dc6c1daf73b1ce6baf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GIBXVLZ44CEK3T4OF35SA3NN46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Affinity Graph Connectivity in Convex Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jason Xu, Sam Rosen","submitted_at":"2026-05-23T17:17:36Z","abstract_excerpt":"We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering behavior under various implied connectivity structures behind the data and to new rates of convergence for centroid recovery. The new theoretical framework is based on random walks, which allow application of concentration inequalities related to random graph models, and formalizes the relationship between the clustering performance and the connectivity of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24673","kind":"arxiv","version":1},"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/2605.24673/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-05-26T01:03:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LuX+u9Dlr772AL2aZMowYssR36FCLB3fbKQS0H8rJvuZYDCppkFPDuo+t0o6f+azN/kgSwpp7sD3G68eMIxTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:05:47.176187Z"},"content_sha256":"9c2d5b1788c3f0903f43982f149f0e80da3ee441e3700731bb55447510d14443","schema_version":"1.0","event_id":"sha256:9c2d5b1788c3f0903f43982f149f0e80da3ee441e3700731bb55447510d14443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIBXVLZ44CEK3T4OF35SA3NN46/bundle.json","state_url":"https://pith.science/pith/GIBXVLZ44CEK3T4OF35SA3NN46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIBXVLZ44CEK3T4OF35SA3NN46/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-23T02:05:47Z","links":{"resolver":"https://pith.science/pith/GIBXVLZ44CEK3T4OF35SA3NN46","bundle":"https://pith.science/pith/GIBXVLZ44CEK3T4OF35SA3NN46/bundle.json","state":"https://pith.science/pith/GIBXVLZ44CEK3T4OF35SA3NN46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIBXVLZ44CEK3T4OF35SA3NN46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GIBXVLZ44CEK3T4OF35SA3NN46","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":"f5a41bee06d10c361c0bc114d3ce27507060341136cab7a7fbec6351aa6cd797","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-23T17:17:36Z","title_canon_sha256":"f9b46be108bc6f8058173e4d3a4ca856c4606dec39891f7c608061595a17720d"},"schema_version":"1.0","source":{"id":"2605.24673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24673","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24673v1","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24673","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"GIBXVLZ44CEK","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"GIBXVLZ44CEK3T4O","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"GIBXVLZ4","created_at":"2026-05-26T01:03:52Z"}],"graph_snapshots":[{"event_id":"sha256:9c2d5b1788c3f0903f43982f149f0e80da3ee441e3700731bb55447510d14443","target":"graph","created_at":"2026-05-26T01:03:52Z","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/2605.24673/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering behavior under various implied connectivity structures behind the data and to new rates of convergence for centroid recovery. The new theoretical framework is based on random walks, which allow application of concentration inequalities related to random graph models, and formalizes the relationship between the clustering performance and the connectivity of t","authors_text":"Jason Xu, Sam Rosen","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-23T17:17:36Z","title":"Affinity Graph Connectivity in Convex Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24673","kind":"arxiv","version":1},"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:7e3c054e97db5ce01fdbfd159e5331ee095d9fbfdd8c31dc6c1daf73b1ce6baf","target":"record","created_at":"2026-05-26T01:03:52Z","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":"f5a41bee06d10c361c0bc114d3ce27507060341136cab7a7fbec6351aa6cd797","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-23T17:17:36Z","title_canon_sha256":"f9b46be108bc6f8058173e4d3a4ca856c4606dec39891f7c608061595a17720d"},"schema_version":"1.0","source":{"id":"2605.24673","kind":"arxiv","version":1}},"canonical_sha256":"32037aaf3ce088adcf8e2efb206dade782d0b5378009b5b1348f572c37dbab20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32037aaf3ce088adcf8e2efb206dade782d0b5378009b5b1348f572c37dbab20","first_computed_at":"2026-05-26T01:03:52.518889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:52.518889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGbPVf0RfcOohFoOo+D/moE4ZfIs4Sk+ePqpJPn3SGnZkFqe1xlAbCFiFYYGqoD04fdNkBi9MVQqpO3TfB5PBw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:52.519883Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e3c054e97db5ce01fdbfd159e5331ee095d9fbfdd8c31dc6c1daf73b1ce6baf","sha256:9c2d5b1788c3f0903f43982f149f0e80da3ee441e3700731bb55447510d14443"],"state_sha256":"9e31a7e3dad34823fbcac503726fa2169f84c02887f28e6b044f2c9d792c9ca0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTQBF3tNc+QS9V96FLt1pptsuC+0RLDDv3j2h/habR4CK7D6kemp5WczlDTQjXu1YMLW4U3Ut2WSnh1kJY1JAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:05:47.178208Z","bundle_sha256":"94420cf7aea2153dfcdfbd643174defb8fa28bfa40d55fc479b0639f8999f0f4"}}