{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GZBXHEU6PKXM57ETNCQOV5NMBH","short_pith_number":"pith:GZBXHEU6","canonical_record":{"source":{"id":"1102.3887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-18T19:05:49Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"dec756ddcf9b9174033bfb44ccc04f11914bb8a281abffd4fa47fc36ae75608c","abstract_canon_sha256":"788e7aac4aa438edbda8272d3f452eabc8917a5e9abe7da3344f3b14e9e91bbf"},"schema_version":"1.0"},"canonical_sha256":"364373929e7aaecefc9368a0eaf5ac09e8a4b434acd8c815b7a75bfa5926f936","source":{"kind":"arxiv","id":"1102.3887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3887","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3887v1","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3887","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"GZBXHEU6PKXM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GZBXHEU6PKXM57ET","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GZBXHEU6","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GZBXHEU6PKXM57ETNCQOV5NMBH","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-18T19:05:49Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"dec756ddcf9b9174033bfb44ccc04f11914bb8a281abffd4fa47fc36ae75608c","abstract_canon_sha256":"788e7aac4aa438edbda8272d3f452eabc8917a5e9abe7da3344f3b14e9e91bbf"},"schema_version":"1.0"},"canonical_sha256":"364373929e7aaecefc9368a0eaf5ac09e8a4b434acd8c815b7a75bfa5926f936","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.469408Z","signature_b64":"7IhfFCuyv8ntoEzNcdXL4ngCyBaPYF1XKur//YI4z17LgorM4dXzCGnmOXTG/qDDqNzm54O+eZqBC6Sak5AjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"364373929e7aaecefc9368a0eaf5ac09e8a4b434acd8c815b7a75bfa5926f936","last_reissued_at":"2026-05-18T02:22:31.468818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.468818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3887","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-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hf2/zFACwPeiw7EcQs6OtxsCIHtBQappGoEB642URsYOEe3XJYeC0xuKudpzYbpz0jB71RVPptlz/nUK4ZOZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:15:29.650225Z"},"content_sha256":"83214da7f5da57e67bd41f36f7a65dd369f591c17ad2ffa8143978eaf1f14f3f","schema_version":"1.0","event_id":"sha256:83214da7f5da57e67bd41f36f7a65dd369f591c17ad2ffa8143978eaf1f14f3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GZBXHEU6PKXM57ETNCQOV5NMBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Clustering: Robust and Efficient Hierarchical Clustering using Adaptively Selected Similarities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Aarti Singh, Brian Eriksson, Gautam Dasarathy, Robert Nowak","submitted_at":"2011-02-18T19:05:49Z","abstract_excerpt":"Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in many problems it may be expensive to obtain or compute similarities between the items to be clustered. This paper investigates the hierarchical clustering of N items based on a small subset of pairwise similarities, significantly less than the complete set of N(N-1)/2 similarities. First, we show that if the intracluster similarities exceed intercluster similarities, then it is possible to correctly determine the hierarchical clustering from as few as 3N log N s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3887","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-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDGP0fuFkmztZRAZWZBrL2t7YzBKhCg36FUpMSFe6X6CVOUvmmlQzG2Bno/u53pVjWizQHD1XD45KS6SYimfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:15:29.650760Z"},"content_sha256":"892a823bba7ff82e720c508aacfc61030b94037597bc446f4145bf818976d38a","schema_version":"1.0","event_id":"sha256:892a823bba7ff82e720c508aacfc61030b94037597bc446f4145bf818976d38a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZBXHEU6PKXM57ETNCQOV5NMBH/bundle.json","state_url":"https://pith.science/pith/GZBXHEU6PKXM57ETNCQOV5NMBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZBXHEU6PKXM57ETNCQOV5NMBH/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-25T04:15:29Z","links":{"resolver":"https://pith.science/pith/GZBXHEU6PKXM57ETNCQOV5NMBH","bundle":"https://pith.science/pith/GZBXHEU6PKXM57ETNCQOV5NMBH/bundle.json","state":"https://pith.science/pith/GZBXHEU6PKXM57ETNCQOV5NMBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZBXHEU6PKXM57ETNCQOV5NMBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GZBXHEU6PKXM57ETNCQOV5NMBH","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":"788e7aac4aa438edbda8272d3f452eabc8917a5e9abe7da3344f3b14e9e91bbf","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-18T19:05:49Z","title_canon_sha256":"dec756ddcf9b9174033bfb44ccc04f11914bb8a281abffd4fa47fc36ae75608c"},"schema_version":"1.0","source":{"id":"1102.3887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3887","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3887v1","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3887","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"GZBXHEU6PKXM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GZBXHEU6PKXM57ET","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GZBXHEU6","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:892a823bba7ff82e720c508aacfc61030b94037597bc446f4145bf818976d38a","target":"graph","created_at":"2026-05-18T02:22:31Z","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":"Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in many problems it may be expensive to obtain or compute similarities between the items to be clustered. This paper investigates the hierarchical clustering of N items based on a small subset of pairwise similarities, significantly less than the complete set of N(N-1)/2 similarities. First, we show that if the intracluster similarities exceed intercluster similarities, then it is possible to correctly determine the hierarchical clustering from as few as 3N log N s","authors_text":"Aarti Singh, Brian Eriksson, Gautam Dasarathy, Robert Nowak","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-18T19:05:49Z","title":"Active Clustering: Robust and Efficient Hierarchical Clustering using Adaptively Selected Similarities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3887","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:83214da7f5da57e67bd41f36f7a65dd369f591c17ad2ffa8143978eaf1f14f3f","target":"record","created_at":"2026-05-18T02:22:31Z","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":"788e7aac4aa438edbda8272d3f452eabc8917a5e9abe7da3344f3b14e9e91bbf","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-18T19:05:49Z","title_canon_sha256":"dec756ddcf9b9174033bfb44ccc04f11914bb8a281abffd4fa47fc36ae75608c"},"schema_version":"1.0","source":{"id":"1102.3887","kind":"arxiv","version":1}},"canonical_sha256":"364373929e7aaecefc9368a0eaf5ac09e8a4b434acd8c815b7a75bfa5926f936","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"364373929e7aaecefc9368a0eaf5ac09e8a4b434acd8c815b7a75bfa5926f936","first_computed_at":"2026-05-18T02:22:31.468818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:31.468818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7IhfFCuyv8ntoEzNcdXL4ngCyBaPYF1XKur//YI4z17LgorM4dXzCGnmOXTG/qDDqNzm54O+eZqBC6Sak5AjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:31.469408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83214da7f5da57e67bd41f36f7a65dd369f591c17ad2ffa8143978eaf1f14f3f","sha256:892a823bba7ff82e720c508aacfc61030b94037597bc446f4145bf818976d38a"],"state_sha256":"f54d29dd7630f5e1dfff8e5746d72b4c4eefc4d65602924e7ce0e39875b11ade"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qN20q3tBiZL/nBQLYhQ7LNAyVPP4c/4Vqf2ASj289QTJj1dLxBta1mjzUjEzRzIbO89MjXr+zDnAEEvpgPnxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:15:29.657738Z","bundle_sha256":"848cf254a9816822ca6815b57674addcc5f42b557f7b023aaab5612f51879231"}}