{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4QK6OQQQ4WKB4UBOCWR5PTPVXG","short_pith_number":"pith:4QK6OQQQ","canonical_record":{"source":{"id":"1012.3697","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-16T17:46:07Z","cross_cats_sorted":["cs.CG","cs.LG"],"title_canon_sha256":"78799264c34a842436b7c17c866f9243f7d2784d5cc8b0951e30da14384b2955","abstract_canon_sha256":"d4e09a398299755700bc3be2a88a78fdfcfe4c450b51f6efce38ab481a9c3cc7"},"schema_version":"1.0"},"canonical_sha256":"e415e74210e5941e502e15a3d7cdf5b9b44b76070aedb532a53530543285b145","source":{"kind":"arxiv","id":"1012.3697","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3697","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3697v4","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3697","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"4QK6OQQQ4WKB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4QK6OQQQ4WKB4UBO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4QK6OQQQ","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4QK6OQQQ4WKB4UBOCWR5PTPVXG","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3697","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-16T17:46:07Z","cross_cats_sorted":["cs.CG","cs.LG"],"title_canon_sha256":"78799264c34a842436b7c17c866f9243f7d2784d5cc8b0951e30da14384b2955","abstract_canon_sha256":"d4e09a398299755700bc3be2a88a78fdfcfe4c450b51f6efce38ab481a9c3cc7"},"schema_version":"1.0"},"canonical_sha256":"e415e74210e5941e502e15a3d7cdf5b9b44b76070aedb532a53530543285b145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:58.648573Z","signature_b64":"ex/OjC3Sn9WnLfEFfu7FWTObz7lDLOmW7bJmDmsf7Iq6ldSJn7yXxZGUYrzkzEZ2UW36+St8K3y6/EYlFlFVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e415e74210e5941e502e15a3d7cdf5b9b44b76070aedb532a53530543285b145","last_reissued_at":"2026-05-18T02:56:58.648159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:58.648159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3697","source_version":4,"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-18T02:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6pbchohpgJBZuYotZ+B/T7K3lHlGpwJX3wCHPEZllDmqwZ8eq4UA5lVrIpcMmaL6hSB28S/Fa7UxhgT80CFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:30:12.078616Z"},"content_sha256":"b89661d9fc6437ab5854a196a26f14683d2481d9fd3b5414020d307b2f5b49c5","schema_version":"1.0","event_id":"sha256:b89661d9fc6437ab5854a196a26f14683d2481d9fd3b5414020d307b2f5b49c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4QK6OQQQ4WKB4UBOCWR5PTPVXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Agglomerative Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.LG"],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Daniel Kuntze, Johannes Bl\\\"omer, Marcel R. Ackermann","submitted_at":"2010-12-16T17:46:07Z","abstract_excerpt":"The diameter $k$-clustering problem is the problem of partitioning a finite subset of $\\mathbb{R}^d$ into $k$ subsets called clusters such that the maximum diameter of the clusters is minimized. One early clustering algorithm that computes a hierarchy of approximate solutions to this problem (for all values of $k$) is the agglomerative clustering algorithm with the complete linkage strategy. For decades, this algorithm has been widely used by practitioners. However, it is not well studied theoretically. In this paper, we analyze the agglomerative complete linkage clustering algorithm. Assuming"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3697","kind":"arxiv","version":4},"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-18T02:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDmeETFi/wjJbH63UC8LGKfDf9JigPC2vWM99jpjo8T1Qw6EJMbFK2leNwxrEMcwAvHs+Tozbi8kQx7cOdxcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:30:12.078988Z"},"content_sha256":"65b7c548c2e04114f1522e54764df7f51792b6e325a7935cbaa29a0b18c0947a","schema_version":"1.0","event_id":"sha256:65b7c548c2e04114f1522e54764df7f51792b6e325a7935cbaa29a0b18c0947a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG/bundle.json","state_url":"https://pith.science/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG/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-26T22:30:12Z","links":{"resolver":"https://pith.science/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG","bundle":"https://pith.science/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG/bundle.json","state":"https://pith.science/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QK6OQQQ4WKB4UBOCWR5PTPVXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4QK6OQQQ4WKB4UBOCWR5PTPVXG","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":"d4e09a398299755700bc3be2a88a78fdfcfe4c450b51f6efce38ab481a9c3cc7","cross_cats_sorted":["cs.CG","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-16T17:46:07Z","title_canon_sha256":"78799264c34a842436b7c17c866f9243f7d2784d5cc8b0951e30da14384b2955"},"schema_version":"1.0","source":{"id":"1012.3697","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3697","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3697v4","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3697","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"4QK6OQQQ4WKB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4QK6OQQQ4WKB4UBO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4QK6OQQQ","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:65b7c548c2e04114f1522e54764df7f51792b6e325a7935cbaa29a0b18c0947a","target":"graph","created_at":"2026-05-18T02:56:58Z","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":"The diameter $k$-clustering problem is the problem of partitioning a finite subset of $\\mathbb{R}^d$ into $k$ subsets called clusters such that the maximum diameter of the clusters is minimized. One early clustering algorithm that computes a hierarchy of approximate solutions to this problem (for all values of $k$) is the agglomerative clustering algorithm with the complete linkage strategy. For decades, this algorithm has been widely used by practitioners. However, it is not well studied theoretically. In this paper, we analyze the agglomerative complete linkage clustering algorithm. Assuming","authors_text":"Christian Sohler, Daniel Kuntze, Johannes Bl\\\"omer, Marcel R. Ackermann","cross_cats":["cs.CG","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-16T17:46:07Z","title":"Analysis of Agglomerative Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3697","kind":"arxiv","version":4},"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:b89661d9fc6437ab5854a196a26f14683d2481d9fd3b5414020d307b2f5b49c5","target":"record","created_at":"2026-05-18T02:56:58Z","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":"d4e09a398299755700bc3be2a88a78fdfcfe4c450b51f6efce38ab481a9c3cc7","cross_cats_sorted":["cs.CG","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-16T17:46:07Z","title_canon_sha256":"78799264c34a842436b7c17c866f9243f7d2784d5cc8b0951e30da14384b2955"},"schema_version":"1.0","source":{"id":"1012.3697","kind":"arxiv","version":4}},"canonical_sha256":"e415e74210e5941e502e15a3d7cdf5b9b44b76070aedb532a53530543285b145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e415e74210e5941e502e15a3d7cdf5b9b44b76070aedb532a53530543285b145","first_computed_at":"2026-05-18T02:56:58.648159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:58.648159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ex/OjC3Sn9WnLfEFfu7FWTObz7lDLOmW7bJmDmsf7Iq6ldSJn7yXxZGUYrzkzEZ2UW36+St8K3y6/EYlFlFVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:58.648573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3697","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b89661d9fc6437ab5854a196a26f14683d2481d9fd3b5414020d307b2f5b49c5","sha256:65b7c548c2e04114f1522e54764df7f51792b6e325a7935cbaa29a0b18c0947a"],"state_sha256":"26d5747c30778263d38aca28c2359382cddf3c71b66009196a870a6ac45b30cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqRdZhcp8o6UaLkdBj42hGr0ncol3qEbYLVxaRzyd/yiZleUGSTia6QJtUY1WdJxhPest8Wf0xQhMRTtPu0kBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:30:12.081469Z","bundle_sha256":"402024a18dcb426f75d4d91d21dc0df720052b8fe4fc541e5a3535bad51dc57c"}}