{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FHIKHQ2K7IHHTYW4JZ37XYY6AN","short_pith_number":"pith:FHIKHQ2K","canonical_record":{"source":{"id":"1811.00928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-02T15:17:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5205e402eaf0b1117557e2d13b909c0e167e0fef15ebe466a51e861b8fe1dc12","abstract_canon_sha256":"0d8712ff6dc850ac0902a84113aea8a456b7e5479726384545d0817f4addfa11"},"schema_version":"1.0"},"canonical_sha256":"29d0a3c34afa0e79e2dc4e77fbe31e036ef5435a45180984da358d18501c6f94","source":{"kind":"arxiv","id":"1811.00928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00928","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00928v2","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00928","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"FHIKHQ2K7IHH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FHIKHQ2K7IHHTYW4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FHIKHQ2K","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FHIKHQ2K7IHHTYW4JZ37XYY6AN","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-02T15:17:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5205e402eaf0b1117557e2d13b909c0e167e0fef15ebe466a51e861b8fe1dc12","abstract_canon_sha256":"0d8712ff6dc850ac0902a84113aea8a456b7e5479726384545d0817f4addfa11"},"schema_version":"1.0"},"canonical_sha256":"29d0a3c34afa0e79e2dc4e77fbe31e036ef5435a45180984da358d18501c6f94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.052641Z","signature_b64":"CON+7n2rdbq/NaUiBPVOxEJm/1ELt2woofjcUo8pZMG9OrB5XnTBIH+FlR0YqUFlkKOsdBZSKWSH9XyiOK8hBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d0a3c34afa0e79e2dc4e77fbe31e036ef5435a45180984da358d18501c6f94","last_reissued_at":"2026-05-17T23:43:33.052210Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.052210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00928","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:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zs7w1UPPmyY3xDfSfP1o1HmYZCkSW7VZQNNvGJvua2Az9UsCJ35vaodjMiGKoPdCIrnJzcYiezN/wm60/ZrOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:16:57.219625Z"},"content_sha256":"d6d2a2f1ef60d00e73e581b9b6a5aae4cc492d1d284b04f0feab9156a916696a","schema_version":"1.0","event_id":"sha256:d6d2a2f1ef60d00e73e581b9b6a5aae4cc492d1d284b04f0feab9156a916696a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FHIKHQ2K7IHHTYW4JZ37XYY6AN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Foundations of Comparison-Based Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Debarghya Ghoshdastidar, Micha\\\"el Perrot, Ulrike von Luxburg","submitted_at":"2018-11-02T15:17:48Z","abstract_excerpt":"We address the classical problem of hierarchical clustering, but in a framework where one does not have access to a representation of the objects or their pairwise similarities. Instead, we assume that only a set of comparisons between objects is available, that is, statements of the form \"objects $i$ and $j$ are more similar than objects $k$ and $l$.\" Such a scenario is commonly encountered in crowdsourcing applications. The focus of this work is to develop comparison-based hierarchical clustering algorithms that do not rely on the principles of ordinal embedding. We show that single and comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00928","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:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHQetgxS54Gv17IrSAoE9xDP1UnnZNrwyW/dUo2POof3v+sFK9r0HS6aE+0C27t4ksu5EOeYMiQeMOeRJFMxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:16:57.219957Z"},"content_sha256":"90a9fe97f7d1919db4e479d7c580e9a2cb728581048db28e237d1fb5f966b29c","schema_version":"1.0","event_id":"sha256:90a9fe97f7d1919db4e479d7c580e9a2cb728581048db28e237d1fb5f966b29c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN/bundle.json","state_url":"https://pith.science/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN/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-20T12:16:57Z","links":{"resolver":"https://pith.science/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN","bundle":"https://pith.science/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN/bundle.json","state":"https://pith.science/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHIKHQ2K7IHHTYW4JZ37XYY6AN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FHIKHQ2K7IHHTYW4JZ37XYY6AN","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":"0d8712ff6dc850ac0902a84113aea8a456b7e5479726384545d0817f4addfa11","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-02T15:17:48Z","title_canon_sha256":"5205e402eaf0b1117557e2d13b909c0e167e0fef15ebe466a51e861b8fe1dc12"},"schema_version":"1.0","source":{"id":"1811.00928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00928","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00928v2","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00928","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"FHIKHQ2K7IHH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FHIKHQ2K7IHHTYW4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FHIKHQ2K","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:90a9fe97f7d1919db4e479d7c580e9a2cb728581048db28e237d1fb5f966b29c","target":"graph","created_at":"2026-05-17T23:43:33Z","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":"We address the classical problem of hierarchical clustering, but in a framework where one does not have access to a representation of the objects or their pairwise similarities. Instead, we assume that only a set of comparisons between objects is available, that is, statements of the form \"objects $i$ and $j$ are more similar than objects $k$ and $l$.\" Such a scenario is commonly encountered in crowdsourcing applications. The focus of this work is to develop comparison-based hierarchical clustering algorithms that do not rely on the principles of ordinal embedding. We show that single and comp","authors_text":"Debarghya Ghoshdastidar, Micha\\\"el Perrot, Ulrike von Luxburg","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-02T15:17:48Z","title":"Foundations of Comparison-Based Hierarchical Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00928","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:d6d2a2f1ef60d00e73e581b9b6a5aae4cc492d1d284b04f0feab9156a916696a","target":"record","created_at":"2026-05-17T23:43:33Z","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":"0d8712ff6dc850ac0902a84113aea8a456b7e5479726384545d0817f4addfa11","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-02T15:17:48Z","title_canon_sha256":"5205e402eaf0b1117557e2d13b909c0e167e0fef15ebe466a51e861b8fe1dc12"},"schema_version":"1.0","source":{"id":"1811.00928","kind":"arxiv","version":2}},"canonical_sha256":"29d0a3c34afa0e79e2dc4e77fbe31e036ef5435a45180984da358d18501c6f94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29d0a3c34afa0e79e2dc4e77fbe31e036ef5435a45180984da358d18501c6f94","first_computed_at":"2026-05-17T23:43:33.052210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:33.052210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CON+7n2rdbq/NaUiBPVOxEJm/1ELt2woofjcUo8pZMG9OrB5XnTBIH+FlR0YqUFlkKOsdBZSKWSH9XyiOK8hBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:33.052641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d2a2f1ef60d00e73e581b9b6a5aae4cc492d1d284b04f0feab9156a916696a","sha256:90a9fe97f7d1919db4e479d7c580e9a2cb728581048db28e237d1fb5f966b29c"],"state_sha256":"1b6e4248c2aa0b527a60a6bc0d30bd8fdf9c55137371a4223085643f17670e4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRPUOdOgChqX7JPNcpnY+9IX2s7s8lTzBX3g8Jkh5W9zXdM5Jgk7MnYq0PkwwALojiUTBhEhDMb8ntGIfznqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:16:57.221874Z","bundle_sha256":"e368f089063443126219aa6771b7b4bb7f6e971cd245d543d91581a9b33c579f"}}