{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E7ZELRBVIDZOF6CM6XWEHOCSK5","short_pith_number":"pith:E7ZELRBV","canonical_record":{"source":{"id":"1704.02147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T09:14:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9a48c92f60069d035bad1bfa10509aabaa0445aa83b18d2c7f75f1ce6b6fafd","abstract_canon_sha256":"f34440251b1612c04e9c485517fcd2fbf3d36fc219ca9ee2b67e8e3e34e433be"},"schema_version":"1.0"},"canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","source":{"kind":"arxiv","id":"1704.02147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02147","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02147v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02147","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"E7ZELRBVIDZO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7ZELRBVIDZOF6CM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7ZELRBV","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E7ZELRBVIDZOF6CM6XWEHOCSK5","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T09:14:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9a48c92f60069d035bad1bfa10509aabaa0445aa83b18d2c7f75f1ce6b6fafd","abstract_canon_sha256":"f34440251b1612c04e9c485517fcd2fbf3d36fc219ca9ee2b67e8e3e34e433be"},"schema_version":"1.0"},"canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.595341Z","signature_b64":"fdPZGIL1tpFvXU262jivuTiWdNORZS6xN2omF7hOLjY6id4ZBAnazipUJ4TunC8KQnVmhY3sMZZyufMCNHGvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","last_reissued_at":"2026-05-18T00:46:50.594773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.594773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02147","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-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tG2OfAyQOsgEaglH/p0DdA4cpfjicnafN7zA471AWolbZpegRbyoMku0vEyrOfav+6gtswwA2UnChj7ecIn5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:51:45.444136Z"},"content_sha256":"fd9a7afbbe583eb563344d3a72e21c16f63194f07aa5fc6a755cfae79c8cab2d","schema_version":"1.0","event_id":"sha256:fd9a7afbbe583eb563344d3a72e21c16f63194f07aa5fc6a755cfae79c8cab2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E7ZELRBVIDZOF6CM6XWEHOCSK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Clustering: Objective Functions and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Varun Kanade, Vincent Cohen-Addad","submitted_at":"2017-04-07T09:14:28Z","abstract_excerpt":"Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a `good' hierarchical clustering is one that minimizes some cost function. He showed that this cost function has certain desirable properties.\n  We take an axiomatic approach to defining `good' objective functions for both similarity a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02147","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-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyMI6uG3qCQzsLmiQTL4nNGe2x+AccddUtS4zF7JkjgSXaeK4hemMa1rJAosVNaXLlMCsKqq+W2XiojiGCJEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:51:45.444831Z"},"content_sha256":"1f0b25cc782d3a89d83eee2dfd68b009b3e45f19e1ce8506b00055d71c614bb6","schema_version":"1.0","event_id":"sha256:1f0b25cc782d3a89d83eee2dfd68b009b3e45f19e1ce8506b00055d71c614bb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/bundle.json","state_url":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/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-25T05:51:45Z","links":{"resolver":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5","bundle":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/bundle.json","state":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E7ZELRBVIDZOF6CM6XWEHOCSK5","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":"f34440251b1612c04e9c485517fcd2fbf3d36fc219ca9ee2b67e8e3e34e433be","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T09:14:28Z","title_canon_sha256":"d9a48c92f60069d035bad1bfa10509aabaa0445aa83b18d2c7f75f1ce6b6fafd"},"schema_version":"1.0","source":{"id":"1704.02147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02147","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02147v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02147","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"E7ZELRBVIDZO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7ZELRBVIDZOF6CM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7ZELRBV","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:1f0b25cc782d3a89d83eee2dfd68b009b3e45f19e1ce8506b00055d71c614bb6","target":"graph","created_at":"2026-05-18T00:46:50Z","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 is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a `good' hierarchical clustering is one that minimizes some cost function. He showed that this cost function has certain desirable properties.\n  We take an axiomatic approach to defining `good' objective functions for both similarity a","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Varun Kanade, Vincent Cohen-Addad","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T09:14:28Z","title":"Hierarchical Clustering: Objective Functions and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02147","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:fd9a7afbbe583eb563344d3a72e21c16f63194f07aa5fc6a755cfae79c8cab2d","target":"record","created_at":"2026-05-18T00:46:50Z","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":"f34440251b1612c04e9c485517fcd2fbf3d36fc219ca9ee2b67e8e3e34e433be","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T09:14:28Z","title_canon_sha256":"d9a48c92f60069d035bad1bfa10509aabaa0445aa83b18d2c7f75f1ce6b6fafd"},"schema_version":"1.0","source":{"id":"1704.02147","kind":"arxiv","version":1}},"canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","first_computed_at":"2026-05-18T00:46:50.594773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:50.594773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdPZGIL1tpFvXU262jivuTiWdNORZS6xN2omF7hOLjY6id4ZBAnazipUJ4TunC8KQnVmhY3sMZZyufMCNHGvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:50.595341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd9a7afbbe583eb563344d3a72e21c16f63194f07aa5fc6a755cfae79c8cab2d","sha256:1f0b25cc782d3a89d83eee2dfd68b009b3e45f19e1ce8506b00055d71c614bb6"],"state_sha256":"ba117902750e4b261fb654513b26d2c685f9d617ff046ce6cfb0cf92af22149b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUUkQQYkg5h1bYuSitdaCVVbwxl2ONpvi6kIDCIDq7WG7cBRHY7lLF0I//5wTphIOIL1NR5/rUMtdi5e0bSYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:51:45.447555Z","bundle_sha256":"981be920cdaf56b3a216930856e6c3646d86a4c38cfcd9c411bea55b23f2b9b7"}}