{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:R25JL352ZLISNNO7PWCGHOC24L","short_pith_number":"pith:R25JL352","canonical_record":{"source":{"id":"0910.0767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-10-05T14:13:25Z","cross_cats_sorted":["cs.DS","q-bio.QM"],"title_canon_sha256":"6d7cae39cb8e45f0829c180b7f9b756d7d757dad1e494fe17abd65687bb80714","abstract_canon_sha256":"e7e85c9880074fe199d7aec1f04df7be29b2af0b65134438e8aede746b0268d3"},"schema_version":"1.0"},"canonical_sha256":"8eba95efbacad126b5df7d8463b85ae2d6dfac67ad68ad56f8d631fb4f894f8b","source":{"kind":"arxiv","id":"0910.0767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.0767","created_at":"2026-05-18T02:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"0910.0767v2","created_at":"2026-05-18T02:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0767","created_at":"2026-05-18T02:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"R25JL352ZLIS","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"R25JL352ZLISNNO7","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"R25JL352","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:R25JL352ZLISNNO7PWCGHOC24L","target":"record","payload":{"canonical_record":{"source":{"id":"0910.0767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-10-05T14:13:25Z","cross_cats_sorted":["cs.DS","q-bio.QM"],"title_canon_sha256":"6d7cae39cb8e45f0829c180b7f9b756d7d757dad1e494fe17abd65687bb80714","abstract_canon_sha256":"e7e85c9880074fe199d7aec1f04df7be29b2af0b65134438e8aede746b0268d3"},"schema_version":"1.0"},"canonical_sha256":"8eba95efbacad126b5df7d8463b85ae2d6dfac67ad68ad56f8d631fb4f894f8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:26.689656Z","signature_b64":"rWdNw/uxruaw3cjGs3c/AdMSJHq0XQlQO82cGs8U5NyQK4G+IwIqAG89VLbNp9Tqp6KyKDPNpz8/D6vMEAvtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eba95efbacad126b5df7d8463b85ae2d6dfac67ad68ad56f8d631fb4f894f8b","last_reissued_at":"2026-05-18T02:11:26.688967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:26.688967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.0767","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-18T02:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fktdVKy6omYEzwa35v8BZ37HkhvjiOqVpq9IP5fjUrl/R3MfUgAMdYH30J0hCeElYQTqCL2lUDL8gF70kiazCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:14:07.269946Z"},"content_sha256":"733846cb561fa79ea3909ef633bae199920886385e0a803111a89166063a7cf1","schema_version":"1.0","event_id":"sha256:733846cb561fa79ea3909ef633bae199920886385e0a803111a89166063a7cf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:R25JL352ZLISNNO7PWCGHOC24L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering with shallow trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.QM"],"primary_cat":"cond-mat.dis-nn","authors_text":"A. Braunstein, A. Flaxman, L. Foini, M. Bailly-Bechet, R. Zecchina, S. Bradde","submitted_at":"2009-10-05T14:13:25Z","abstract_excerpt":"We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message--passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with this general scheme three biological/medical structured datasets (human population based on genetic information, proteins based on sequences and verbal autopsies) and show that the interpolation technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0767","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-18T02:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAbJDomTaW5W51vIE4zHR6YlPicUc1Rmm+xFeKlLhu9idqicCcWR2HQQvBq7bwAwoJIXkmlvH5T5s3WggGi4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:14:07.270446Z"},"content_sha256":"1cd4d1e55ae95f4198fec3f17f1a617127e7210e1a687057156bbf3b822e90b6","schema_version":"1.0","event_id":"sha256:1cd4d1e55ae95f4198fec3f17f1a617127e7210e1a687057156bbf3b822e90b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/bundle.json","state_url":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R25JL352ZLISNNO7PWCGHOC24L/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-25T20:14:07Z","links":{"resolver":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L","bundle":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/bundle.json","state":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R25JL352ZLISNNO7PWCGHOC24L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:R25JL352ZLISNNO7PWCGHOC24L","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":"e7e85c9880074fe199d7aec1f04df7be29b2af0b65134438e8aede746b0268d3","cross_cats_sorted":["cs.DS","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-10-05T14:13:25Z","title_canon_sha256":"6d7cae39cb8e45f0829c180b7f9b756d7d757dad1e494fe17abd65687bb80714"},"schema_version":"1.0","source":{"id":"0910.0767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.0767","created_at":"2026-05-18T02:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"0910.0767v2","created_at":"2026-05-18T02:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0767","created_at":"2026-05-18T02:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"R25JL352ZLIS","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"R25JL352ZLISNNO7","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"R25JL352","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:1cd4d1e55ae95f4198fec3f17f1a617127e7210e1a687057156bbf3b822e90b6","target":"graph","created_at":"2026-05-18T02:11:26Z","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 propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message--passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with this general scheme three biological/medical structured datasets (human population based on genetic information, proteins based on sequences and verbal autopsies) and show that the interpolation technique","authors_text":"A. Braunstein, A. Flaxman, L. Foini, M. Bailly-Bechet, R. Zecchina, S. Bradde","cross_cats":["cs.DS","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-10-05T14:13:25Z","title":"Clustering with shallow trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0767","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:733846cb561fa79ea3909ef633bae199920886385e0a803111a89166063a7cf1","target":"record","created_at":"2026-05-18T02:11:26Z","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":"e7e85c9880074fe199d7aec1f04df7be29b2af0b65134438e8aede746b0268d3","cross_cats_sorted":["cs.DS","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-10-05T14:13:25Z","title_canon_sha256":"6d7cae39cb8e45f0829c180b7f9b756d7d757dad1e494fe17abd65687bb80714"},"schema_version":"1.0","source":{"id":"0910.0767","kind":"arxiv","version":2}},"canonical_sha256":"8eba95efbacad126b5df7d8463b85ae2d6dfac67ad68ad56f8d631fb4f894f8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eba95efbacad126b5df7d8463b85ae2d6dfac67ad68ad56f8d631fb4f894f8b","first_computed_at":"2026-05-18T02:11:26.688967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:11:26.688967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rWdNw/uxruaw3cjGs3c/AdMSJHq0XQlQO82cGs8U5NyQK4G+IwIqAG89VLbNp9Tqp6KyKDPNpz8/D6vMEAvtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:11:26.689656Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.0767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:733846cb561fa79ea3909ef633bae199920886385e0a803111a89166063a7cf1","sha256:1cd4d1e55ae95f4198fec3f17f1a617127e7210e1a687057156bbf3b822e90b6"],"state_sha256":"c7301ebf7a0b7d6517a40264d384160d762642da0ac62a076694836405d1c84d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIyBEeNEtmrgr87GYFeaVxy0jMHtCzN6Ek5jFQQuZTKcuM8iENg6J5PxkF+5ZcnpPsHn8eE+5+UTHJ9jhSN0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:14:07.273785Z","bundle_sha256":"be30e94f08ed19e7ab8547890aee21cccfa97d2a66ad823865fb01536e524be6"}}