{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IU4VLVG2YVFXLWYFLKX233OJVY","short_pith_number":"pith:IU4VLVG2","canonical_record":{"source":{"id":"1805.09476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T01:32:19Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"477c74b6678c7036ebee87d8696f549d521e59a864f148f4e99e92dcf1ae0740","abstract_canon_sha256":"ccf0f75d325fdf1faaab6a1bb2553e463016c48e4cc5af8b5f1859d1be641362"},"schema_version":"1.0"},"canonical_sha256":"453955d4dac54b75db055aafadedc9ae00fad6e9babbc50b706315835c33a94a","source":{"kind":"arxiv","id":"1805.09476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09476","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09476v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09476","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"IU4VLVG2YVFX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IU4VLVG2YVFXLWYF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IU4VLVG2","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IU4VLVG2YVFXLWYFLKX233OJVY","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T01:32:19Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"477c74b6678c7036ebee87d8696f549d521e59a864f148f4e99e92dcf1ae0740","abstract_canon_sha256":"ccf0f75d325fdf1faaab6a1bb2553e463016c48e4cc5af8b5f1859d1be641362"},"schema_version":"1.0"},"canonical_sha256":"453955d4dac54b75db055aafadedc9ae00fad6e9babbc50b706315835c33a94a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.472871Z","signature_b64":"p3Mz0JEIAJSeCrmzPnMgr18uecsx+OwCPP71RGV1e+ctuFQLtYN5P190qY/3pRZy5Mcgy+DTLLsQQtcSpeKxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453955d4dac54b75db055aafadedc9ae00fad6e9babbc50b706315835c33a94a","last_reissued_at":"2026-05-18T00:10:44.472310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.472310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09476","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6c98bhqMyldBM6w2Pewjknk9I0FKcPQKuKUQyGjpvN6n7YGTLB4dq9DO2ageiYvM4/fB87MTMp3m+tXNNdIYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:43:54.749634Z"},"content_sha256":"3dbb2dc9db543ba2b1c189210eee5555c9c0dc6e74434052aa7bf0c59e0fa9e2","schema_version":"1.0","event_id":"sha256:3dbb2dc9db543ba2b1c189210eee5555c9c0dc6e74434052aa7bf0c59e0fa9e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IU4VLVG2YVFXLWYFLKX233OJVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Clustering with Structural Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Moses Charikar, Rad Niazadeh, Vaggos Chatziafratis","submitted_at":"2018-05-24T01:32:19Z","abstract_excerpt":"Hierarchical clustering is a popular unsupervised data analysis method. For many real-world applications, we would like to exploit prior information about the data that imposes constraints on the clustering hierarchy, and is not captured by the set of features available to the algorithm. This gives rise to the problem of \"hierarchical clustering with structural constraints\". Structural constraints pose major challenges for bottom-up approaches like average/single linkage and even though they can be naturally incorporated into top-down divisive algorithms, no formal guarantees exist on the qual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09476","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7+im4tb6N2ZzqoIYn0rRXOz+pWeywajCQoqzj5aygfisztqQspYMi7YwVNF7ilfJEgX98vZGiQ7o117YVjLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:43:54.749991Z"},"content_sha256":"edcfdd79f152be90b08074b68018744b26460a7a58590985c79b030c4c7b166a","schema_version":"1.0","event_id":"sha256:edcfdd79f152be90b08074b68018744b26460a7a58590985c79b030c4c7b166a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU4VLVG2YVFXLWYFLKX233OJVY/bundle.json","state_url":"https://pith.science/pith/IU4VLVG2YVFXLWYFLKX233OJVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU4VLVG2YVFXLWYFLKX233OJVY/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-06-29T14:43:54Z","links":{"resolver":"https://pith.science/pith/IU4VLVG2YVFXLWYFLKX233OJVY","bundle":"https://pith.science/pith/IU4VLVG2YVFXLWYFLKX233OJVY/bundle.json","state":"https://pith.science/pith/IU4VLVG2YVFXLWYFLKX233OJVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU4VLVG2YVFXLWYFLKX233OJVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IU4VLVG2YVFXLWYFLKX233OJVY","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":"ccf0f75d325fdf1faaab6a1bb2553e463016c48e4cc5af8b5f1859d1be641362","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T01:32:19Z","title_canon_sha256":"477c74b6678c7036ebee87d8696f549d521e59a864f148f4e99e92dcf1ae0740"},"schema_version":"1.0","source":{"id":"1805.09476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09476","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09476v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09476","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"IU4VLVG2YVFX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IU4VLVG2YVFXLWYF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IU4VLVG2","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:edcfdd79f152be90b08074b68018744b26460a7a58590985c79b030c4c7b166a","target":"graph","created_at":"2026-05-18T00:10:44Z","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 popular unsupervised data analysis method. For many real-world applications, we would like to exploit prior information about the data that imposes constraints on the clustering hierarchy, and is not captured by the set of features available to the algorithm. This gives rise to the problem of \"hierarchical clustering with structural constraints\". Structural constraints pose major challenges for bottom-up approaches like average/single linkage and even though they can be naturally incorporated into top-down divisive algorithms, no formal guarantees exist on the qual","authors_text":"Moses Charikar, Rad Niazadeh, Vaggos Chatziafratis","cross_cats":["cs.AI","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T01:32:19Z","title":"Hierarchical Clustering with Structural Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09476","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:3dbb2dc9db543ba2b1c189210eee5555c9c0dc6e74434052aa7bf0c59e0fa9e2","target":"record","created_at":"2026-05-18T00:10:44Z","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":"ccf0f75d325fdf1faaab6a1bb2553e463016c48e4cc5af8b5f1859d1be641362","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T01:32:19Z","title_canon_sha256":"477c74b6678c7036ebee87d8696f549d521e59a864f148f4e99e92dcf1ae0740"},"schema_version":"1.0","source":{"id":"1805.09476","kind":"arxiv","version":2}},"canonical_sha256":"453955d4dac54b75db055aafadedc9ae00fad6e9babbc50b706315835c33a94a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"453955d4dac54b75db055aafadedc9ae00fad6e9babbc50b706315835c33a94a","first_computed_at":"2026-05-18T00:10:44.472310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.472310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p3Mz0JEIAJSeCrmzPnMgr18uecsx+OwCPP71RGV1e+ctuFQLtYN5P190qY/3pRZy5Mcgy+DTLLsQQtcSpeKxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.472871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dbb2dc9db543ba2b1c189210eee5555c9c0dc6e74434052aa7bf0c59e0fa9e2","sha256:edcfdd79f152be90b08074b68018744b26460a7a58590985c79b030c4c7b166a"],"state_sha256":"032e7af1bdc2159bf44a6d1389f9aa7f7e955d6e355c328ce5c2b6d5e2c7260e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqpTMyQ2Otqn8J8hi8GGDQEgCfyj+lnfnw4KsYAd7p7gLp7NYBLtOFN34wsq1OGSHJhE+4/Hn9b3zt0y653vCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:43:54.751827Z","bundle_sha256":"a407470c70147af954049c367d8560c1684aab544b22700a7fd6cab6c453d30e"}}