{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:32ECWB7R3EEPSZGRABYXSF62ER","short_pith_number":"pith:32ECWB7R","schema_version":"1.0","canonical_sha256":"de882b07f1d908f964d100717917da246c94a35c3448cf3bb9a1c674116dab28","source":{"kind":"arxiv","id":"1709.04545","version":3},"attestation_state":"computed","paper":{"title":"Efficient Computation of Multiple Density-Based Clustering Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Antonio Cavalcante Araujo Neto, Joerg Sander, Mario A. Nascimento, Ricardo J. G. B. Campello","submitted_at":"2017-09-13T21:24:42Z","abstract_excerpt":"HDBSCAN*, a state-of-the-art density-based hierarchical clustering method, produces a hierarchical organization of clusters in a dataset w.r.t. a parameter mpts. While the performance of HDBSCAN* is robust w.r.t. mpts in the sense that a small change in mpts typically leads to only a small or no change in the clustering structure, choosing a \"good\" mpts value can be challenging: depending on the data distribution, a high or low value for mpts may be more appropriate, and certain data clusters may reveal themselves at different values of mpts. To explore results for a range of mpts values, howe"},"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":"1709.04545","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-13T21:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"6657ccda991e7e44da4ea04eda22e12d71fdb38d31b2e502207e5d6eb761b14b","abstract_canon_sha256":"9a88beb3c5226938fe1ca6ccfc98ade9dfbeaf1fda81b555b78e30d75da9caea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:55.218779Z","signature_b64":"h5R35O34xTVQ0/MNXhqmxFSK9O5fU2wRq2lEjsvrRUO1ojkGCtmfx0By4pdVzU8oIDyyK0AlZ/+xkjfdlffGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de882b07f1d908f964d100717917da246c94a35c3448cf3bb9a1c674116dab28","last_reissued_at":"2026-05-18T00:13:55.217862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:55.217862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Computation of Multiple Density-Based Clustering Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Antonio Cavalcante Araujo Neto, Joerg Sander, Mario A. Nascimento, Ricardo J. G. B. Campello","submitted_at":"2017-09-13T21:24:42Z","abstract_excerpt":"HDBSCAN*, a state-of-the-art density-based hierarchical clustering method, produces a hierarchical organization of clusters in a dataset w.r.t. a parameter mpts. While the performance of HDBSCAN* is robust w.r.t. mpts in the sense that a small change in mpts typically leads to only a small or no change in the clustering structure, choosing a \"good\" mpts value can be challenging: depending on the data distribution, a high or low value for mpts may be more appropriate, and certain data clusters may reveal themselves at different values of mpts. To explore results for a range of mpts values, howe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04545","kind":"arxiv","version":3},"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":"1709.04545","created_at":"2026-05-18T00:13:55.217992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04545v3","created_at":"2026-05-18T00:13:55.217992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04545","created_at":"2026-05-18T00:13:55.217992+00:00"},{"alias_kind":"pith_short_12","alias_value":"32ECWB7R3EEP","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"32ECWB7R3EEPSZGR","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"32ECWB7R","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13520","citing_title":"LEGO-MOF: Equivariant Latent Manipulation for Editable, Generative, and Optimizable MOF Design","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER","json":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER.json","graph_json":"https://pith.science/api/pith-number/32ECWB7R3EEPSZGRABYXSF62ER/graph.json","events_json":"https://pith.science/api/pith-number/32ECWB7R3EEPSZGRABYXSF62ER/events.json","paper":"https://pith.science/paper/32ECWB7R"},"agent_actions":{"view_html":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER","download_json":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER.json","view_paper":"https://pith.science/paper/32ECWB7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04545&json=true","fetch_graph":"https://pith.science/api/pith-number/32ECWB7R3EEPSZGRABYXSF62ER/graph.json","fetch_events":"https://pith.science/api/pith-number/32ECWB7R3EEPSZGRABYXSF62ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER/action/storage_attestation","attest_author":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER/action/author_attestation","sign_citation":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER/action/citation_signature","submit_replication":"https://pith.science/pith/32ECWB7R3EEPSZGRABYXSF62ER/action/replication_record"}},"created_at":"2026-05-18T00:13:55.217992+00:00","updated_at":"2026-05-18T00:13:55.217992+00:00"}