{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RNY2WVAU6F2LTSGCFATHYLCMQ5","short_pith_number":"pith:RNY2WVAU","canonical_record":{"source":{"id":"1909.09667","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T18:29:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"067eacd7545fbe05d1112d55dc909130f8045b72fc8d45c52caa0519fdc70eac","abstract_canon_sha256":"b7a82377b5d9cf223aaf14478ca8f64bf8e8434bf64b6e761eefed7e57bda092"},"schema_version":"1.0"},"canonical_sha256":"8b71ab5414f174b9c8c228267c2c4c8752a1abfb150497cab18dad6fd9923320","source":{"kind":"arxiv","id":"1909.09667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09667","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09667v1","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09667","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"RNY2WVAU6F2L","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"pith_short_16","alias_value":"RNY2WVAU6F2LTSGC","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"pith_short_8","alias_value":"RNY2WVAU","created_at":"2026-07-05T00:06:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RNY2WVAU6F2LTSGCFATHYLCMQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1909.09667","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T18:29:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"067eacd7545fbe05d1112d55dc909130f8045b72fc8d45c52caa0519fdc70eac","abstract_canon_sha256":"b7a82377b5d9cf223aaf14478ca8f64bf8e8434bf64b6e761eefed7e57bda092"},"schema_version":"1.0"},"canonical_sha256":"8b71ab5414f174b9c8c228267c2c4c8752a1abfb150497cab18dad6fd9923320","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:06:13.058324Z","signature_b64":"zeDHY37EEUkL80K6sKcwSUpj8fgYEHX5Kbf6IegyZw7YzuXXIuLAZqR1WFiEhrkwWTXgECPDFUvEPONy6vxlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b71ab5414f174b9c8c228267c2c4c8752a1abfb150497cab18dad6fd9923320","last_reissued_at":"2026-07-05T00:06:13.057914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:06:13.057914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.09667","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-05T00:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iKWo78W9HN/zU/hsk5D9+pCsDtWl6FQipWjjUJGzwMXKS3Gv3/ICeu1HQ12JJblW9jWMoZiPxpjHgUe5j4YWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:23:36.775957Z"},"content_sha256":"e3ca3a1c3397cf01b9f5322391d21d1be18c9075bb563f4150827ae4b78a1d6a","schema_version":"1.0","event_id":"sha256:e3ca3a1c3397cf01b9f5322391d21d1be18c9075bb563f4150827ae4b78a1d6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RNY2WVAU6F2LTSGCFATHYLCMQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Hierarchical Clustering Approximations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Krishna Menon, Anand Rajagopalan, Baris Sumengen, Gui Citovsky, Qin Cao, Sanjiv Kumar","submitted_at":"2019-09-20T18:29:59Z","abstract_excerpt":"Hierarchical clustering is a widely used approach for clustering datasets at multiple levels of granularity. Despite its popularity, existing algorithms such as hierarchical agglomerative clustering (HAC) are limited to the offline setting, and thus require the entire dataset to be available. This prohibits their use on large datasets commonly encountered in modern learning applications. In this paper, we consider hierarchical clustering in the online setting, where points arrive one at a time. We propose two algorithms that seek to optimize the Moseley and Wang (MW) revenue function, a varian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09667","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/1909.09667/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-05T00:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ts5qHLM/wjJuVOF784ux29uR9tHAumZf+lRqRVDf8vyt5UU9LLsPIhcK9bvoldX5RO4lmys1nq9cNAIa7D0HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:23:36.776539Z"},"content_sha256":"ced14e4656976f500438c031a39c54cfd3d9a4494e84f7225eeb86268a85ea0c","schema_version":"1.0","event_id":"sha256:ced14e4656976f500438c031a39c54cfd3d9a4494e84f7225eeb86268a85ea0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5/bundle.json","state_url":"https://pith.science/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5/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-12T13:23:36Z","links":{"resolver":"https://pith.science/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5","bundle":"https://pith.science/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5/bundle.json","state":"https://pith.science/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNY2WVAU6F2LTSGCFATHYLCMQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RNY2WVAU6F2LTSGCFATHYLCMQ5","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":"b7a82377b5d9cf223aaf14478ca8f64bf8e8434bf64b6e761eefed7e57bda092","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T18:29:59Z","title_canon_sha256":"067eacd7545fbe05d1112d55dc909130f8045b72fc8d45c52caa0519fdc70eac"},"schema_version":"1.0","source":{"id":"1909.09667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09667","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09667v1","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09667","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"RNY2WVAU6F2L","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"pith_short_16","alias_value":"RNY2WVAU6F2LTSGC","created_at":"2026-07-05T00:06:13Z"},{"alias_kind":"pith_short_8","alias_value":"RNY2WVAU","created_at":"2026-07-05T00:06:13Z"}],"graph_snapshots":[{"event_id":"sha256:ced14e4656976f500438c031a39c54cfd3d9a4494e84f7225eeb86268a85ea0c","target":"graph","created_at":"2026-07-05T00:06:13Z","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/1909.09667/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hierarchical clustering is a widely used approach for clustering datasets at multiple levels of granularity. Despite its popularity, existing algorithms such as hierarchical agglomerative clustering (HAC) are limited to the offline setting, and thus require the entire dataset to be available. This prohibits their use on large datasets commonly encountered in modern learning applications. In this paper, we consider hierarchical clustering in the online setting, where points arrive one at a time. We propose two algorithms that seek to optimize the Moseley and Wang (MW) revenue function, a varian","authors_text":"Aditya Krishna Menon, Anand Rajagopalan, Baris Sumengen, Gui Citovsky, Qin Cao, Sanjiv Kumar","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T18:29:59Z","title":"Online Hierarchical Clustering Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09667","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:e3ca3a1c3397cf01b9f5322391d21d1be18c9075bb563f4150827ae4b78a1d6a","target":"record","created_at":"2026-07-05T00:06:13Z","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":"b7a82377b5d9cf223aaf14478ca8f64bf8e8434bf64b6e761eefed7e57bda092","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T18:29:59Z","title_canon_sha256":"067eacd7545fbe05d1112d55dc909130f8045b72fc8d45c52caa0519fdc70eac"},"schema_version":"1.0","source":{"id":"1909.09667","kind":"arxiv","version":1}},"canonical_sha256":"8b71ab5414f174b9c8c228267c2c4c8752a1abfb150497cab18dad6fd9923320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b71ab5414f174b9c8c228267c2c4c8752a1abfb150497cab18dad6fd9923320","first_computed_at":"2026-07-05T00:06:13.057914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:06:13.057914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zeDHY37EEUkL80K6sKcwSUpj8fgYEHX5Kbf6IegyZw7YzuXXIuLAZqR1WFiEhrkwWTXgECPDFUvEPONy6vxlDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:06:13.058324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.09667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3ca3a1c3397cf01b9f5322391d21d1be18c9075bb563f4150827ae4b78a1d6a","sha256:ced14e4656976f500438c031a39c54cfd3d9a4494e84f7225eeb86268a85ea0c"],"state_sha256":"1198394c54ee22083e99c1d159347cc672a4faa208d7d318cf38de55a6657910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0IGvLAvU5rtzYUEB+T0JKemXVbx4aodfVvcNF67ZQkVn0GQeoezSsFxK9Boqs8ScWVqyGkl22Xe5o43AluBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:23:36.780351Z","bundle_sha256":"32b6412af244d2550f08a804fd30e6834e412b48b9342ef526351e3cb2318fec"}}