{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QZKZ7PW3V4PACFNGG5CP6HQQAB","short_pith_number":"pith:QZKZ7PW3","canonical_record":{"source":{"id":"2406.05066","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-07T16:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"f1ba04ecfa8228eff8e22eaa0e9c53956bdf5d3a9c0e89a5f9afa9267544b6cd","abstract_canon_sha256":"47215388950cafdd8507e3b5769d4c6b1c10c3722fc4e42f26d07edeb0068287"},"schema_version":"1.0"},"canonical_sha256":"86559fbedbaf1e0115a63744ff1e10005b8d57ab51ac6d75124144f5103729b2","source":{"kind":"arxiv","id":"2406.05066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05066","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05066v1","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05066","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"pith_short_12","alias_value":"QZKZ7PW3V4PA","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"pith_short_16","alias_value":"QZKZ7PW3V4PACFNG","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"pith_short_8","alias_value":"QZKZ7PW3","created_at":"2026-07-05T08:28:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QZKZ7PW3V4PACFNGG5CP6HQQAB","target":"record","payload":{"canonical_record":{"source":{"id":"2406.05066","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-07T16:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"f1ba04ecfa8228eff8e22eaa0e9c53956bdf5d3a9c0e89a5f9afa9267544b6cd","abstract_canon_sha256":"47215388950cafdd8507e3b5769d4c6b1c10c3722fc4e42f26d07edeb0068287"},"schema_version":"1.0"},"canonical_sha256":"86559fbedbaf1e0115a63744ff1e10005b8d57ab51ac6d75124144f5103729b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:53.867846Z","signature_b64":"KmD64vJ1eWj2XTe+GSPMenD9xpNQyF2j9AmsmMeY/kEjgpOrTKl7csfrSa6duJxnUgQYYZpHrCjmzDnPy9xSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86559fbedbaf1e0115a63744ff1e10005b8d57ab51ac6d75124144f5103729b2","last_reissued_at":"2026-07-05T08:28:53.867266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:53.867266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.05066","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-07-05T08:28:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/uCyU4RdoX9HLgmjNUl/sdH6attwa/1ZEKXploXDtgIaF/sc/dHvYOVDBcmnVqJHpMv3QlJLr9CDWaEddwLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:11:23.228520Z"},"content_sha256":"788ad78b139d16fbc2d89641159f956c5bb44b276a152ae5cb753b236d46883f","schema_version":"1.0","event_id":"sha256:788ad78b139d16fbc2d89641159f956c5bb44b276a152ae5cb753b236d46883f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QZKZ7PW3V4PACFNGG5CP6HQQAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Centroid-Linkage Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D Ellis Hershkowitz, Jakub {\\L}\\k{a}cki, Kishen N Gowda, Laxman Dhulipala, MohammadHossein Bateni, Rajesh Jayaram, Willem Fletcher","submitted_at":"2024-06-07T16:37:13Z","abstract_excerpt":"We give an efficient algorithm for Centroid-Linkage Hierarchical Agglomerative Clustering (HAC), which computes a $c$-approximate clustering in roughly $n^{1+O(1/c^2)}$ time. We obtain our result by combining a new Centroid-Linkage HAC algorithm with a novel fully dynamic data structure for nearest neighbor search which works under adaptive updates.\n  We also evaluate our algorithm empirically. By leveraging a state-of-the-art nearest-neighbor search library, we obtain a fast and accurate Centroid-Linkage HAC algorithm. Compared to an existing state-of-the-art exact baseline, our implementatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05066","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/2406.05066/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-05T08:28:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mt16ppLZtnGg2f3DxXeYX8HorELNmFVAF6j3u+yzzTX/m2ws1Pwb+9h7ebGGEdTZOyJpsNyPUnZUD9nyORsaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:11:23.229152Z"},"content_sha256":"165ae2b0600c84004aed27559e6a2fab16d148d0ce93d88c3c74b7b278b7379d","schema_version":"1.0","event_id":"sha256:165ae2b0600c84004aed27559e6a2fab16d148d0ce93d88c3c74b7b278b7379d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB/bundle.json","state_url":"https://pith.science/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB/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-18T06:11:23Z","links":{"resolver":"https://pith.science/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB","bundle":"https://pith.science/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB/bundle.json","state":"https://pith.science/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZKZ7PW3V4PACFNGG5CP6HQQAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QZKZ7PW3V4PACFNGG5CP6HQQAB","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":"47215388950cafdd8507e3b5769d4c6b1c10c3722fc4e42f26d07edeb0068287","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-07T16:37:13Z","title_canon_sha256":"f1ba04ecfa8228eff8e22eaa0e9c53956bdf5d3a9c0e89a5f9afa9267544b6cd"},"schema_version":"1.0","source":{"id":"2406.05066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05066","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05066v1","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05066","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"pith_short_12","alias_value":"QZKZ7PW3V4PA","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"pith_short_16","alias_value":"QZKZ7PW3V4PACFNG","created_at":"2026-07-05T08:28:53Z"},{"alias_kind":"pith_short_8","alias_value":"QZKZ7PW3","created_at":"2026-07-05T08:28:53Z"}],"graph_snapshots":[{"event_id":"sha256:165ae2b0600c84004aed27559e6a2fab16d148d0ce93d88c3c74b7b278b7379d","target":"graph","created_at":"2026-07-05T08:28: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.05066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an efficient algorithm for Centroid-Linkage Hierarchical Agglomerative Clustering (HAC), which computes a $c$-approximate clustering in roughly $n^{1+O(1/c^2)}$ time. We obtain our result by combining a new Centroid-Linkage HAC algorithm with a novel fully dynamic data structure for nearest neighbor search which works under adaptive updates.\n  We also evaluate our algorithm empirically. By leveraging a state-of-the-art nearest-neighbor search library, we obtain a fast and accurate Centroid-Linkage HAC algorithm. Compared to an existing state-of-the-art exact baseline, our implementatio","authors_text":"D Ellis Hershkowitz, Jakub {\\L}\\k{a}cki, Kishen N Gowda, Laxman Dhulipala, MohammadHossein Bateni, Rajesh Jayaram, Willem Fletcher","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-07T16:37:13Z","title":"Efficient Centroid-Linkage Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05066","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:788ad78b139d16fbc2d89641159f956c5bb44b276a152ae5cb753b236d46883f","target":"record","created_at":"2026-07-05T08:28: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":"47215388950cafdd8507e3b5769d4c6b1c10c3722fc4e42f26d07edeb0068287","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-07T16:37:13Z","title_canon_sha256":"f1ba04ecfa8228eff8e22eaa0e9c53956bdf5d3a9c0e89a5f9afa9267544b6cd"},"schema_version":"1.0","source":{"id":"2406.05066","kind":"arxiv","version":1}},"canonical_sha256":"86559fbedbaf1e0115a63744ff1e10005b8d57ab51ac6d75124144f5103729b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86559fbedbaf1e0115a63744ff1e10005b8d57ab51ac6d75124144f5103729b2","first_computed_at":"2026-07-05T08:28:53.867266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:53.867266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KmD64vJ1eWj2XTe+GSPMenD9xpNQyF2j9AmsmMeY/kEjgpOrTKl7csfrSa6duJxnUgQYYZpHrCjmzDnPy9xSDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:53.867846Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:788ad78b139d16fbc2d89641159f956c5bb44b276a152ae5cb753b236d46883f","sha256:165ae2b0600c84004aed27559e6a2fab16d148d0ce93d88c3c74b7b278b7379d"],"state_sha256":"56c4b0d0e99f78b2f5382ecefdecc89a143a712e8bb89d8dcf45698888e19fa4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKa4USZlNooPeiN0aQ6Eysbn0nMyUSGy6NaFK3V12eeXl3mHk9Zv1ENlxxmGaiE9xMlRtYbys8rA94wHcD3gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T06:11:23.234706Z","bundle_sha256":"b5290f1f2427e8b8bae589b0cb28f8f1f5fc951b751fe93bd480f2129d0bb4ca"}}