{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CWIG4OCGLN6HLGQUKZEQHSMB72","short_pith_number":"pith:CWIG4OCG","canonical_record":{"source":{"id":"1812.02715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-06T18:50:35Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"ca73c2d1063235c961493a9aa357421ebc9c864efb2d5e56a2e739182d71c0aa","abstract_canon_sha256":"3fd5647f0812b71ec7c70672a072fdb63055a0f6af803d0d150038f3ebc854cd"},"schema_version":"1.0"},"canonical_sha256":"15906e38465b7c759a14564903c981feaeffa44ac715998806a76977db6bbd7a","source":{"kind":"arxiv","id":"1812.02715","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02715","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02715v2","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02715","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"CWIG4OCGLN6H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CWIG4OCGLN6HLGQU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CWIG4OCG","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CWIG4OCGLN6HLGQUKZEQHSMB72","target":"record","payload":{"canonical_record":{"source":{"id":"1812.02715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-06T18:50:35Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"ca73c2d1063235c961493a9aa357421ebc9c864efb2d5e56a2e739182d71c0aa","abstract_canon_sha256":"3fd5647f0812b71ec7c70672a072fdb63055a0f6af803d0d150038f3ebc854cd"},"schema_version":"1.0"},"canonical_sha256":"15906e38465b7c759a14564903c981feaeffa44ac715998806a76977db6bbd7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:08.325625Z","signature_b64":"ZPkJsf6cNEfKHXCqcoLlNb2inNlixFY2/RTUOrVmHW9U9uw8WkfWM8X/kobZeoLwod5ENUZYsCoCmenClvg1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15906e38465b7c759a14564903c981feaeffa44ac715998806a76977db6bbd7a","last_reissued_at":"2026-05-17T23:58:08.325024Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:08.325024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.02715","source_version":2,"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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkpKAOmEuFyC2+Nm8Ha7LQGaBFCuMM3RQNh87K5+eSL3MNYtXCrY2ASTz4iBoK3L6eI0DfdCl8YZ7p+OO/htCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:13:21.580005Z"},"content_sha256":"f3862dfa13ef423bf9cdbbff82fa9f2536a8afa83d4768b6474b8762aa319426","schema_version":"1.0","event_id":"sha256:f3862dfa13ef423bf9cdbbff82fa9f2536a8afa83d4768b6474b8762aa319426"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CWIG4OCGLN6HLGQUKZEQHSMB72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Cost Function for Hierarchical Cluster Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Dingkang Wang, Yusu Wang","submitted_at":"2018-12-06T18:50:35Z","abstract_excerpt":"Hierarchical clustering has been a popular method in various data analysis applications. It partitions a data set into a hierarchical collection of clusters, and can provide a global view of (cluster) structure behind data across different granularity levels. A hierarchical clustering (HC) of a data set can be naturally represented by a tree, called a HC-tree, where leaves correspond to input data and subtrees rooted at internal nodes correspond to clusters. Many hierarchical clustering algorithms used in practice are developed in a procedure manner. Dasgupta proposed to study the hierarchical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02715","kind":"arxiv","version":2},"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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PETrHExd0O1yueMOzPwbEAVBuY6iieEL0G6DeGTV6HuB24dIbH53N7vkKteAS9yKD8U+ZO2rBU43PPpjG9cRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:13:21.580695Z"},"content_sha256":"d436000db0b0665bf9ac901584b7f147f182efc4376b0a720ab7b13c2d17875f","schema_version":"1.0","event_id":"sha256:d436000db0b0665bf9ac901584b7f147f182efc4376b0a720ab7b13c2d17875f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWIG4OCGLN6HLGQUKZEQHSMB72/bundle.json","state_url":"https://pith.science/pith/CWIG4OCGLN6HLGQUKZEQHSMB72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWIG4OCGLN6HLGQUKZEQHSMB72/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-26T11:13:21Z","links":{"resolver":"https://pith.science/pith/CWIG4OCGLN6HLGQUKZEQHSMB72","bundle":"https://pith.science/pith/CWIG4OCGLN6HLGQUKZEQHSMB72/bundle.json","state":"https://pith.science/pith/CWIG4OCGLN6HLGQUKZEQHSMB72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWIG4OCGLN6HLGQUKZEQHSMB72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CWIG4OCGLN6HLGQUKZEQHSMB72","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":"3fd5647f0812b71ec7c70672a072fdb63055a0f6af803d0d150038f3ebc854cd","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-06T18:50:35Z","title_canon_sha256":"ca73c2d1063235c961493a9aa357421ebc9c864efb2d5e56a2e739182d71c0aa"},"schema_version":"1.0","source":{"id":"1812.02715","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02715","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02715v2","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02715","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"CWIG4OCGLN6H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CWIG4OCGLN6HLGQU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CWIG4OCG","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:d436000db0b0665bf9ac901584b7f147f182efc4376b0a720ab7b13c2d17875f","target":"graph","created_at":"2026-05-17T23:58:08Z","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 has been a popular method in various data analysis applications. It partitions a data set into a hierarchical collection of clusters, and can provide a global view of (cluster) structure behind data across different granularity levels. A hierarchical clustering (HC) of a data set can be naturally represented by a tree, called a HC-tree, where leaves correspond to input data and subtrees rooted at internal nodes correspond to clusters. Many hierarchical clustering algorithms used in practice are developed in a procedure manner. Dasgupta proposed to study the hierarchical","authors_text":"Dingkang Wang, Yusu Wang","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-06T18:50:35Z","title":"An Improved Cost Function for Hierarchical Cluster Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02715","kind":"arxiv","version":2},"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:f3862dfa13ef423bf9cdbbff82fa9f2536a8afa83d4768b6474b8762aa319426","target":"record","created_at":"2026-05-17T23:58:08Z","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":"3fd5647f0812b71ec7c70672a072fdb63055a0f6af803d0d150038f3ebc854cd","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-06T18:50:35Z","title_canon_sha256":"ca73c2d1063235c961493a9aa357421ebc9c864efb2d5e56a2e739182d71c0aa"},"schema_version":"1.0","source":{"id":"1812.02715","kind":"arxiv","version":2}},"canonical_sha256":"15906e38465b7c759a14564903c981feaeffa44ac715998806a76977db6bbd7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15906e38465b7c759a14564903c981feaeffa44ac715998806a76977db6bbd7a","first_computed_at":"2026-05-17T23:58:08.325024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:08.325024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZPkJsf6cNEfKHXCqcoLlNb2inNlixFY2/RTUOrVmHW9U9uw8WkfWM8X/kobZeoLwod5ENUZYsCoCmenClvg1Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:08.325625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02715","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3862dfa13ef423bf9cdbbff82fa9f2536a8afa83d4768b6474b8762aa319426","sha256:d436000db0b0665bf9ac901584b7f147f182efc4376b0a720ab7b13c2d17875f"],"state_sha256":"3c090d865525a704f1860f4c2d038fd36507141e91784b56eae8eba31aa9ef7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5VoXriypk9QTkUHqCmz4Ic8jymw7habiVnKQpZUj2T2u1iniQG4EOGrmykEU1KArh7Ve8ux0RhM1Sol6+bxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:13:21.584554Z","bundle_sha256":"7ab839c3a927430dd7384b700791d5470818a7ca407e6c474fb3224e32e41f51"}}