{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LEYGYRB4AQAWNBML6P4P7X43FP","short_pith_number":"pith:LEYGYRB4","schema_version":"1.0","canonical_sha256":"59306c443c040166858bf3f8ffdf9b2bf04b5459cdc7c4fc10b9d839e3de6e54","source":{"kind":"arxiv","id":"1611.00484","version":4},"attestation_state":"computed","paper":{"title":"RECOME: a New Density-Based Clustering Algorithm Using Relative KNN Kernel Density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Fuzhen Zhuang, Naixue Xiong, Qingyong Li, Rong Zheng, Ruisi He, Yangli-ao Geng","submitted_at":"2016-11-02T07:10:40Z","abstract_excerpt":"Discovering clusters from a dataset with different shapes, densities, and scales is a known challenging problem in data clustering. In this paper, we propose the RElative COre MErge (RECOME) clustering algorithm. The core of RECOME is a novel density measure, i.e., Relative $K$ nearest Neighbor Kernel Density (RNKD). RECOME identifies core objects with unit RNKD, and {partitions} non-core objects into atom clusters by successively following higher-density neighbor relations toward core objects. Core objects and their corresponding atom clusters are then merged through $\\alpha$-reachable paths "},"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":"1611.00484","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2016-11-02T07:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"748a606b62a1871a0c68fde6b97297e8cec3f429b9f9157fe1be5603e8f176c6","abstract_canon_sha256":"e9d1faf2047b8ec394cdbd47e067fadc95162681e7deb4148e2cd7c3717ec8e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:56.146195Z","signature_b64":"DPn7nEWSdbbkR5BeJRZzMtigO4qQS1DEwgFiQsu4Mtly+HwvPmYECf1qzGLkXnLTk05usCyHk4EjNz6sE9qwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59306c443c040166858bf3f8ffdf9b2bf04b5459cdc7c4fc10b9d839e3de6e54","last_reissued_at":"2026-07-05T01:35:56.145822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:56.145822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RECOME: a New Density-Based Clustering Algorithm Using Relative KNN Kernel Density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Fuzhen Zhuang, Naixue Xiong, Qingyong Li, Rong Zheng, Ruisi He, Yangli-ao Geng","submitted_at":"2016-11-02T07:10:40Z","abstract_excerpt":"Discovering clusters from a dataset with different shapes, densities, and scales is a known challenging problem in data clustering. In this paper, we propose the RElative COre MErge (RECOME) clustering algorithm. The core of RECOME is a novel density measure, i.e., Relative $K$ nearest Neighbor Kernel Density (RNKD). RECOME identifies core objects with unit RNKD, and {partitions} non-core objects into atom clusters by successively following higher-density neighbor relations toward core objects. Core objects and their corresponding atom clusters are then merged through $\\alpha$-reachable paths "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00484","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/1611.00484/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":"1611.00484","created_at":"2026-07-05T01:35:56.145885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00484v4","created_at":"2026-07-05T01:35:56.145885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00484","created_at":"2026-07-05T01:35:56.145885+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEYGYRB4AQAW","created_at":"2026-07-05T01:35:56.145885+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEYGYRB4AQAWNBML","created_at":"2026-07-05T01:35:56.145885+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEYGYRB4","created_at":"2026-07-05T01:35:56.145885+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/LEYGYRB4AQAWNBML6P4P7X43FP","json":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP.json","graph_json":"https://pith.science/api/pith-number/LEYGYRB4AQAWNBML6P4P7X43FP/graph.json","events_json":"https://pith.science/api/pith-number/LEYGYRB4AQAWNBML6P4P7X43FP/events.json","paper":"https://pith.science/paper/LEYGYRB4"},"agent_actions":{"view_html":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP","download_json":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP.json","view_paper":"https://pith.science/paper/LEYGYRB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00484&json=true","fetch_graph":"https://pith.science/api/pith-number/LEYGYRB4AQAWNBML6P4P7X43FP/graph.json","fetch_events":"https://pith.science/api/pith-number/LEYGYRB4AQAWNBML6P4P7X43FP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP/action/storage_attestation","attest_author":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP/action/author_attestation","sign_citation":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP/action/citation_signature","submit_replication":"https://pith.science/pith/LEYGYRB4AQAWNBML6P4P7X43FP/action/replication_record"}},"created_at":"2026-07-05T01:35:56.145885+00:00","updated_at":"2026-07-05T01:35:56.145885+00:00"}