{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:R25JL352ZLISNNO7PWCGHOC24L","short_pith_number":"pith:R25JL352","schema_version":"1.0","canonical_sha256":"8eba95efbacad126b5df7d8463b85ae2d6dfac67ad68ad56f8d631fb4f894f8b","source":{"kind":"arxiv","id":"0910.0767","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.0767","created_at":"2026-05-18T02:11:26.689084+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.0767v2","created_at":"2026-05-18T02:11:26.689084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0767","created_at":"2026-05-18T02:11:26.689084+00:00"},{"alias_kind":"pith_short_12","alias_value":"R25JL352ZLIS","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"R25JL352ZLISNNO7","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"R25JL352","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L","json":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L.json","graph_json":"https://pith.science/api/pith-number/R25JL352ZLISNNO7PWCGHOC24L/graph.json","events_json":"https://pith.science/api/pith-number/R25JL352ZLISNNO7PWCGHOC24L/events.json","paper":"https://pith.science/paper/R25JL352"},"agent_actions":{"view_html":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L","download_json":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L.json","view_paper":"https://pith.science/paper/R25JL352","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.0767&json=true","fetch_graph":"https://pith.science/api/pith-number/R25JL352ZLISNNO7PWCGHOC24L/graph.json","fetch_events":"https://pith.science/api/pith-number/R25JL352ZLISNNO7PWCGHOC24L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/action/storage_attestation","attest_author":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/action/author_attestation","sign_citation":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/action/citation_signature","submit_replication":"https://pith.science/pith/R25JL352ZLISNNO7PWCGHOC24L/action/replication_record"}},"created_at":"2026-05-18T02:11:26.689084+00:00","updated_at":"2026-05-18T02:11:26.689084+00:00"}