{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C4F7DF5AO7JMBNIZAKRX34JYHZ","short_pith_number":"pith:C4F7DF5A","canonical_record":{"source":{"id":"1907.05094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:35:03Z","cross_cats_sorted":["cs.CG","cs.LG"],"title_canon_sha256":"af08700018cd26d53832eca7e7ea2272e1fb8fafe87ea6d24dcb3c830bde5f4b","abstract_canon_sha256":"ce7148ff00b18ad1e0fd662a255d270dc667974b815e1ff42fa1cba604c86b39"},"schema_version":"1.0"},"canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","source":{"kind":"arxiv","id":"1907.05094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05094","created_at":"2026-05-17T23:40:53Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05094v1","created_at":"2026-05-17T23:40:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05094","created_at":"2026-05-17T23:40:53Z"},{"alias_kind":"pith_short_12","alias_value":"C4F7DF5AO7JM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C4F7DF5AO7JMBNIZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C4F7DF5A","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C4F7DF5AO7JMBNIZAKRX34JYHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.05094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:35:03Z","cross_cats_sorted":["cs.CG","cs.LG"],"title_canon_sha256":"af08700018cd26d53832eca7e7ea2272e1fb8fafe87ea6d24dcb3c830bde5f4b","abstract_canon_sha256":"ce7148ff00b18ad1e0fd662a255d270dc667974b815e1ff42fa1cba604c86b39"},"schema_version":"1.0"},"canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:53.957979Z","signature_b64":"XJle4SXqE9q3iO330QA5pUG1KpKWQ0ZdZA8y+CIBOcxDUQG8kyIR2I43+MnaYygkCnqeT5BS6mZNNbScJRvzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","last_reissued_at":"2026-05-17T23:40:53.957230Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:53.957230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.05094","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-17T23:40:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npDG+ykUbA1LoAx1szV4S9+D81Gxk+V4ZRsRdDBKesRQseTM7ezHk1IvQnI68gfLVtky4AELVFFBRhjWGcH2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:09.376301Z"},"content_sha256":"6f90a942a282d1ddc5dba3ed954d668c90f0d8a32578ebc6fa5dd432f9623001","schema_version":"1.0","event_id":"sha256:6f90a942a282d1ddc5dba3ed954d668c90f0d8a32578ebc6fa5dd432f9623001"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C4F7DF5AO7JMBNIZAKRX34JYHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Ward's Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.LG"],"primary_cat":"cs.DS","authors_text":"Anna Gro{\\ss}wendt, Heiko R\\\"oglin, Melanie Schmidt","submitted_at":"2019-07-11T10:35:03Z","abstract_excerpt":"We study Ward's method for the hierarchical $k$-means problem. This popular greedy heuristic is based on the \\emph{complete linkage} paradigm: Starting with all data points as singleton clusters, it successively merges two clusters to form a clustering with one cluster less. The pair of clusters is chosen to (locally) minimize the $k$-means cost of the clustering in the next step.\n  Complete linkage algorithms are very popular for hierarchical clustering problems, yet their theoretical properties have been studied relatively little. For the Euclidean $k$-center problem, Ackermann et al. show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05094","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":""},"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-17T23:40:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDWLrNU6YA7UnhDd9d8mVBM8aSk856pEgXk1Aw6+9l0AliWsoMx1ybDG/5vQK6HqUn3Lm4GXt4UKxoPphpYACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:09.377047Z"},"content_sha256":"f44bbd62be604f2468874a4107707ebbf9690c33bcafb188f3a6142aad1f674e","schema_version":"1.0","event_id":"sha256:f44bbd62be604f2468874a4107707ebbf9690c33bcafb188f3a6142aad1f674e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/bundle.json","state_url":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/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-25T18:01:09Z","links":{"resolver":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ","bundle":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/bundle.json","state":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C4F7DF5AO7JMBNIZAKRX34JYHZ","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":"ce7148ff00b18ad1e0fd662a255d270dc667974b815e1ff42fa1cba604c86b39","cross_cats_sorted":["cs.CG","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:35:03Z","title_canon_sha256":"af08700018cd26d53832eca7e7ea2272e1fb8fafe87ea6d24dcb3c830bde5f4b"},"schema_version":"1.0","source":{"id":"1907.05094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05094","created_at":"2026-05-17T23:40:53Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05094v1","created_at":"2026-05-17T23:40:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05094","created_at":"2026-05-17T23:40:53Z"},{"alias_kind":"pith_short_12","alias_value":"C4F7DF5AO7JM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C4F7DF5AO7JMBNIZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C4F7DF5A","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:f44bbd62be604f2468874a4107707ebbf9690c33bcafb188f3a6142aad1f674e","target":"graph","created_at":"2026-05-17T23:40:53Z","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":"We study Ward's method for the hierarchical $k$-means problem. This popular greedy heuristic is based on the \\emph{complete linkage} paradigm: Starting with all data points as singleton clusters, it successively merges two clusters to form a clustering with one cluster less. The pair of clusters is chosen to (locally) minimize the $k$-means cost of the clustering in the next step.\n  Complete linkage algorithms are very popular for hierarchical clustering problems, yet their theoretical properties have been studied relatively little. For the Euclidean $k$-center problem, Ackermann et al. show t","authors_text":"Anna Gro{\\ss}wendt, Heiko R\\\"oglin, Melanie Schmidt","cross_cats":["cs.CG","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:35:03Z","title":"Analysis of Ward's Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05094","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:6f90a942a282d1ddc5dba3ed954d668c90f0d8a32578ebc6fa5dd432f9623001","target":"record","created_at":"2026-05-17T23:40:53Z","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":"ce7148ff00b18ad1e0fd662a255d270dc667974b815e1ff42fa1cba604c86b39","cross_cats_sorted":["cs.CG","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:35:03Z","title_canon_sha256":"af08700018cd26d53832eca7e7ea2272e1fb8fafe87ea6d24dcb3c830bde5f4b"},"schema_version":"1.0","source":{"id":"1907.05094","kind":"arxiv","version":1}},"canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","first_computed_at":"2026-05-17T23:40:53.957230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:53.957230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJle4SXqE9q3iO330QA5pUG1KpKWQ0ZdZA8y+CIBOcxDUQG8kyIR2I43+MnaYygkCnqeT5BS6mZNNbScJRvzCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:53.957979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f90a942a282d1ddc5dba3ed954d668c90f0d8a32578ebc6fa5dd432f9623001","sha256:f44bbd62be604f2468874a4107707ebbf9690c33bcafb188f3a6142aad1f674e"],"state_sha256":"6398245c43c4dd7100c2f9e0ab6299523bacb260b0ae917cf71b1ef3e27e305b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qh47W4deXS5DlDF6OTHtRSEnrtOYdyGyIwNaKijiY37d2dCF+XS1DshASUtJlmCCNjIKHKMHkkIQUpIAYhMpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:01:09.381020Z","bundle_sha256":"9e6cd7ec56684b4b19600bcdc2cb909f818f74cf205d8bed942c92cd02557316"}}