{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GHFOIDOZQBL5RYZQGUKP53ZNS4","short_pith_number":"pith:GHFOIDOZ","schema_version":"1.0","canonical_sha256":"31cae40dd98057d8e3303514feef2d970ac9062193b7bb868038b50435855401","source":{"kind":"arxiv","id":"1911.02282","version":4},"attestation_state":"computed","paper":{"title":"A Hybrid Approach To Hierarchical Density-based Cluster Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Claudia Malzer, Marcus Baum","submitted_at":"2019-11-06T09:59:56Z","abstract_excerpt":"HDBSCAN is a density-based clustering algorithm that constructs a cluster hierarchy tree and then uses a specific stability measure to extract flat clusters from the tree. We show how the application of an additional threshold value can result in a combination of DBSCAN* and HDBSCAN clusters, and demonstrate potential benefits of this hybrid approach when clustering data of variable densities. In particular, our approach is useful in scenarios where we require a low minimum cluster size but want to avoid an abundance of micro-clusters in high-density regions. The method can directly be applied"},"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":"1911.02282","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-11-06T09:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"a1a807e3aba06ccad9f856c4a50bf116ebb2085c03747fd30a2c7e3b0e1cca94","abstract_canon_sha256":"a98819b3ee892396cede3e9dd9fef74dd59644cd8f48ff94625be15199de9094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:28.247807Z","signature_b64":"H5ZIjhSJSkFiEXGSUztO9uixXwckj/d4ZoVlHP9nfQJ4AnXSGYMlf9V099cRCOTAfI6QKfjW0Gsdb4rDlBjNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31cae40dd98057d8e3303514feef2d970ac9062193b7bb868038b50435855401","last_reissued_at":"2026-07-05T02:08:28.247387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:28.247387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid Approach To Hierarchical Density-based Cluster Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Claudia Malzer, Marcus Baum","submitted_at":"2019-11-06T09:59:56Z","abstract_excerpt":"HDBSCAN is a density-based clustering algorithm that constructs a cluster hierarchy tree and then uses a specific stability measure to extract flat clusters from the tree. We show how the application of an additional threshold value can result in a combination of DBSCAN* and HDBSCAN clusters, and demonstrate potential benefits of this hybrid approach when clustering data of variable densities. In particular, our approach is useful in scenarios where we require a low minimum cluster size but want to avoid an abundance of micro-clusters in high-density regions. The method can directly be applied"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02282","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.02282/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.02282","created_at":"2026-07-05T02:08:28.247445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.02282v4","created_at":"2026-07-05T02:08:28.247445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02282","created_at":"2026-07-05T02:08:28.247445+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHFOIDOZQBL5","created_at":"2026-07-05T02:08:28.247445+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHFOIDOZQBL5RYZQ","created_at":"2026-07-05T02:08:28.247445+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHFOIDOZ","created_at":"2026-07-05T02:08:28.247445+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16556","citing_title":"Anomaly Detection and Radio-frequency Interference Classification with Unsupervised Learning in Narrowband Radio Technosignature Searches","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4","json":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4.json","graph_json":"https://pith.science/api/pith-number/GHFOIDOZQBL5RYZQGUKP53ZNS4/graph.json","events_json":"https://pith.science/api/pith-number/GHFOIDOZQBL5RYZQGUKP53ZNS4/events.json","paper":"https://pith.science/paper/GHFOIDOZ"},"agent_actions":{"view_html":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4","download_json":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4.json","view_paper":"https://pith.science/paper/GHFOIDOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.02282&json=true","fetch_graph":"https://pith.science/api/pith-number/GHFOIDOZQBL5RYZQGUKP53ZNS4/graph.json","fetch_events":"https://pith.science/api/pith-number/GHFOIDOZQBL5RYZQGUKP53ZNS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4/action/storage_attestation","attest_author":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4/action/author_attestation","sign_citation":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4/action/citation_signature","submit_replication":"https://pith.science/pith/GHFOIDOZQBL5RYZQGUKP53ZNS4/action/replication_record"}},"created_at":"2026-07-05T02:08:28.247445+00:00","updated_at":"2026-07-05T02:08:28.247445+00:00"}